Flat tori with large Laplacian eigenvalues in dimensions up to eight

02/16/2022
by   Chiu-Yen Kao, et al.
0

We consider the optimization problem of maximizing the k-th Laplacian eigenvalue, λ_k, over flat d-dimensional tori of fixed volume. For k=1, this problem is equivalent to the densest lattice sphere packing problem. For larger k, this is equivalent to the NP-hard problem of finding the d-dimensional (dual) lattice with longest k-th shortest lattice vector. As a result of extensive computations, for d ≤ 8, we obtain a sequence of flat tori, T_k,d, each of volume one, such that the k-th Laplacian eigenvalue of T_k,d is very large; for each (finite) k the k-th eigenvalue exceeds the value in (the k→∞ 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 T_k,d and we describe the degeneration of the tori as k →∞.

READ FULL TEXT
research
04/03/2023

Spectral monotonicity of the Hodge Laplacian

If K,G are finite abstract simplicial complexes and K is a subcomplex of...
research
06/20/2022

Extremal graph realizations and graph Laplacian eigenvalues

For a regular polyhedron (or polygon) centered at the origin, the coordi...
research
10/25/2021

Packing 2D disks into a 3D container

In this article, we consider the problem of finding in three dimensions ...
research
05/23/2022

Eigenvalue bounds of the Kirchhoff Laplacian

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a gra...
research
10/25/2021

Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix

For a connected graph 𝒢=(V,E) with n nodes, m edges, and Laplacian matri...
research
02/16/2013

k-d Darts: Sampling by k-Dimensional Flat Searches

We formalize the notion of sampling a function using k-d darts. A k-d da...
research
03/04/2019

Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties

We discuss the design of interlayer edges in a multiplex network, under ...

Please sign up or login with your details

Forgot password? Click here to reset