2000 character limit reached
Pairs of Full-Rank Lattices With Parallelepiped-Shaped Common Fundamental Domains
Published 15 Jul 2015 in math.MG | (1507.04671v1)
Abstract: We provide a complete characterization of pairs of full-rank lattices in which admit common connected fundamental domains of the type where is an invertible matrix of order Using our characterization, we construct several pairs of lattices of the type which admit a common fundamental domain of the type Moreover, we show that for there exists an uncountable family of pairs of lattices of the same volume which do not admit a common connected fundamental domain of the type
Paper Prompts
Sign up for free to create and run prompts on this paper.