相关论文: Extreme lattices and vexillar designs
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…
We show that, if L is an extremal Type II lattice of rank 40 or 80, then L is generated by its vectors of norm min(L)+2. This sharpens earlier results of Ozeki, and the second author and Abel, which showed that such lattices L are generated…
Among the properties of homogeneity of incidence structures flag-transitivity obviously is a particularly important and natural one. Consequently, in the last decades also flag-transitive Steiner tdesigns (i.e. flag-transitive t-(v,k,1)…
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
Almost hypercomplex pseudo-Hermitian manifolds are considered. Isotropic hyper-K\"ahler manifolds are introduced. A 4-parametric family of 4-dimensional manifolds of this type is constructed on a Lie group. This family is characterized…
We present a new, explicit and very geometric construction for the iterated clique graphs of the hexagonal lattice $\mathrm{Hex}$ which makes apparent its clique-divergence and sheds light on some previous observations, such as the…
We construct a $40$-dimensional extremal Type II lattice not having any subsets consisting of $40$ orthogonal minimal vectors, and determine the automorphism group. This lattice gives an example different from the $16470$ lattices…
Let $(K,\mathcal O, k)$ be a $p$-modular system with $k$ algebraically closed and $\mathcal O$ unramified, and let $\Lambda$ be an $\mathcal O$-order in a separable $K$-algebra. We call a $\Lambda$-lattice $L$ rigid if ${\rm…
Consider a simple complex Lie group $G$ acting diagonally on a triple flag variety $G/P_1\times G/P_2\times G/P_3$, where $P_i$ is parabolic subgroup of $G$. We provide an algorithm for systematically checking when this action has finitely…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
Keszegh (2009) proved that the extremal function $ex(n, P)$ of any forbidden light $2$-dimensional 0-1 matrix $P$ is at most quasilinear in $n$, using a reduction to generalized Davenport-Schinzel sequences. We extend this result to…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
We study an extremal projection principle for families of operators ordered by domination, induced by fixed bounded linear mappings acting on a source with an additive baseline. Stability is defined through domination of second--order…
A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
This paper explores the study of the general Hermite constant associated to the general linear group and its irreducible representations, as defined by T. Watanabe. To that end, a height, which naturally applies to flag varieties, is built…
We study the connection between the theory of spherical designs and the question of extrema of the height function of lattices. More precisely, we show that a full-rank n-dimensional Euclidean lattice, all layers of which hold a spherical…