Abstract
We consider the optimization problem of maximizing the -th Laplacian eigenvalue, , over flat -dimensional tori of fixed volume. For , this problem is equivalent to the densest lattice sphere packing problem. For larger , this is equivalent to the NP-hard problem of finding the -dimensional (dual) lattice with longest -th shortest lattice vector. As a result of extensive computations, for , we obtain a sequence of flat tori, , each of volume one, such that the -th Laplacian eigenvalue of is very large; for each (finite) the -th eigenvalue exceeds the value in (the asymptotic) Weyl's law by a factor between 1.54 and 2.01, depending on the dimension. Stationarity conditions are derived and numerically verified for and we describe the degeneration of the tori as .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.