相关论文: Extreme lattices and vexillar designs

For some extremal (optimal) odd unimodular lattice $L$ in dimensions $12,16,20,28,32,36,40$ and $44$, we determine all integers $k$ such that $L$ contains a $k$-frame. This result yields the existence of an extremal Type I…

We study the error of the number of unimodular lattice points that fall into a dilated and centred ellipse around $0$. We first show that the study of the error, when the error is normalized by $\sqrt{t}$ with $t$ the parameter of…

This paper is devoted to the classification of all flag-transitive point-primitive non-trivial $2$-$(v, k, \lambda)$ designs with the alternating group $A_n$($n \le 10$) as the socle of their automorphism groups, and 87 different designs…

The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…

A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…

Morris and Saxton used the method of containers to bound the number of $n$-vertex graphs with $m$ edges containing no $\ell$-cycles, and hence graphs of girth more than $\ell$. We consider a generalization to $r$-uniform hypergraphs. The…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…

We consider the emergence of edge states in a finite optical lattice and show that the boundaries of the lattice play a decisive role for their location in the corresponding energy spectrum. We introduce a simple parametrisation of the…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

Exceptional points~(EPs) appear as degeneracies in the spectrum of non-Hermitian matrices at which the eigenvectors coalesce. In general, an EP of order $n$ may find room to emerge if $2(n-1)$ real constraints are imposed. Our results show…

We introduce a new class of poset edge labelings for locally finite lattices which we call $SB$-labelings. We prove for finite lattices which admit an $SB$-labeling that each open interval has the homotopy type of a ball or of a sphere of…

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the…

The automorphism groups of the three known extremal even unimodular lattices of dimension 48 and the one of dimension 72 are computed using the classification of finite simple groups. Restrictions on the possible automorphisms of…

We give a new existence proof for the rank 2^d even lattices usually called the Barnes-Wall lattices, and establish new results on uniqueness, structure and transitivity of the automorphism group on certain kinds of sublattices. Our proofs…

Let $G$ be a symplectic or special orthogonal group, let $H$ be a connected reductive subgroup of $G$, and let $X$ be a flag variety of $G$. We classify all triples $(G,H,X)$ such that the natural action of $H$ on $X$ is spherical. For each…

Part I introduced diptych varieties $V_{ABLM}$ and gave a rigorous construction of them in the case $d,e\ge 2$ and $de>4$. Here we prove the existence of $V_{ABLM}$ in all the cases with $de\le4$. At the same time we construct some classes…