اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWell-rounded sublattices of planar lattices
50
0
0.0
(
0
)
تأليف
Michael Baake
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The task of enumerating well-rounded sublattices of a given lattice is of interest already in dimension 2, and has recently been treated by several authors. In this paper, we analyse the question more closely in the spirit of earlier work on similar sublattices and coincidence site sublattices. Combining explicit geometric considerations with known techniques from the theory of Dirichlet series, we arrive, after a considerable amount of computation, at asymptotic results on the number of well-rounded sublattices up to a given index in any planar lattice. For the two most symmetric lattices, the square and the hexagonal lattice, we present detailed results.
قيم البحث
اقرأ أيضاً
The correspondence between unmixed bipartite graphs and sublattices of the oolean lattice is discussed. By using this correspondence, we show the existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs.
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $sqrt{s}cdot L$ is isometric to a sublattice of $mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$ and determinant
$7$ in 1989. We find two more ones of rank $12$ and determinant $15$. Then we introduce a method of embedding a given lattice into a unimodular lattice, which plays a key role in proving minimality of non $2$-integrable lattices and finding candidates for non $2$-integrable lattices.
New series of $2^{2m}$-dimensional universally strongly perfect lattices $Lambda_I $ and $Gamma_J $ are constructed with $$2BW_{2m} ^{#} subseteq Gamma _J subseteq BW_{2m} subseteq Lambda _I subseteq BW _{2m}^{#} .$$ The lattices are found by restric
ting the spin representations of the automorphism group of the Barnes-Wall lattice to its subgroup ${mathcal U}_m:={mathcal C}_m (4^H_{bf 1}) $. The group ${mathcal U}_m$ is the Clifford-Weil group associated to the Hermitian self-dual codes over ${bf F} _4$ containing ${bf 1}$, so the ring of polynomial invariants of ${mathcal U}_m$ is spanned by the genus-$m$ complete weight enumerators of such codes. This allows us to show that all the ${mathcal U}_m$ invariant lattices are universally strongly perfect. We introduce a new construction, $D^{(cyc)}$ for chains of (extended) cyclic codes to obtain (bounds on) the minimum of the new lattices.
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove the famous
three gap property for Kronecker sequences. We show that recently developed lattice point counting techniques can then be applied to derive that a certain class of Kronecker sequences have $beta$-pair correlations for all $0 < beta < 1$.
We classify the dual strongly perfect lattices in dimension 16. There are four pairs of such lattices, the famous Barnes-Wall lattice $Lambda _{16}$, the extremal 5-modular lattice $N_{16}$, the odd Barnes-Wall lattice $O_{16}$ and its dual, and one
pair of new lattices $Gamma _{16}$ and its dual. The latter pair belongs to a new infinite series of dual strongly perfect lattices, the sandwiched Barnes-Wall lattices, described by the authors in a previous paper. An updated table of all known strongly perfect lattices up to dimension 26 is available in the catalogue of lattices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
