اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLow dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16
163
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 cite{CGH15} we introduced TiRS graphs and TiRS frames to create a new natural setting for duals of canonical extensions of lattices. In this continuation of cite{CGH15} we answer Problem 2 from there by characterising the perfect lattices that are
dual to TiRS frames (and hence TiRS graphs). We introduce a new subclass of perfect lattices called PTi lattices and show that the canonical extensions of lattices are PTi lattices, and so are `more than just perfect lattices. We introduce morphisms of TiRS structures and put our correspondence between TiRS graphs and TiRS frames from cite{CGH15} into a full categorical framework. We illustrate our correspondences between classes of perfects lattices and classes of TiRS graphs by examples.
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide several new minimal non-strongly-perfect graphs.
A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent neighbors. The characterization of claw-free graphs that are strongly per
fect by a set of forbidden induced subgraphs was conjectured by Ravindra in 1990 and was proved by Wang in 2006. Here we give a shorter proof of this characterization.
Matter waves can be coherently and adiabatically loaded and controlled in strongly driven optical lattices. This coherent control is used in order to modify the modulus and the sign of the tunneling matrix element in the tunneling Hamiltonian. Our fi
ndings pave the way for studies of driven quantum systems and new methods for engineering Hamiltonians that are impossible to realize with static techniques.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
