اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExtreme lattices and vexillar designs
206
0
0.0
(
0
)
تأليف
Bertrand Meyer
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We define a notion of vexillar design for the flag variety in the spirit of the spherical designs introduced by Delsarte, Goethals and Seidel. For a finite subgroup of the orthogonal group, we explain how conditions on the group have the orbits of any flag under the group action be a design and point out why the minima of a lattice in the sense of the general Hermite constant forming a 4-design implies being extreme. The reasoning proves useful to show the extremality of many new expected examples ($E_8$, $La_{24}$, Barnes-Wall lattices, Thompson-Smith lattice for instance) that were out of reach until now.
قيم البحث
اقرأ أيضاً
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta function i
n terms of them and count the number of orbits of the Galois action associated with each cyclotomic-like polynomial to obtain its further factorization. We also give a necessary and sufficient condition for such a polynomial to be irreducible and discuss its irreducibility from this point of view.
A graphical design is a proper subset of vertices of a graph on which many eigenfunctions of the Laplacian operator have mean value zero. In this paper, we show that extremal independent sets make extremal graphical designs, that is, a design on whic
h the maximum possible number of eigenfunctions have mean value zero. We then provide examples of such graphs and sets, which arise naturally in extremal combinatorics. We also show that sets which realize the isoperimetric constant of a graph make extremal graphical designs, and provide examples for them as well. We investigate the behavior of graphical designs under the operation of weak graph product. In addition, we present a family of extremal graphical designs for the hypercube graph.
A generalization of forming derived and residual designs from $t$-designs to subspace designs is proposed. A $q$-analog of a theorem by Van Trung, van Leijenhorst and Driessen is proven, stating that if for some (not necessarily realizable) parameter
set the derived and residual parameter set are realizable, the same is true for the reduced parameter set. As a result, we get the existence of several previously unknown subspace designs. Some consequences are derived for the existence of large sets of subspace designs. Furthermore, it is shown that there is no $q$-analog of the large Witt design.
A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment method. For gene
ral $n,t$ we give a %linear programming lower bound . For $nge 4$ and $t=2,$ this bound is strong enough to show a lower bound on the size of such $t$-designs of $n(n-1)dots (n-t+1),$ which is best possible when sharply $t$-transitive sets of permutations exist. This shows, in particular, that tight $2$-designs do not exist.
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was obtained. Here, we
illustrate the method by investigating triangle decompositions: we give a simple proof that a triangle-divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasi-random host graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
