Related papers: Spherical designs and lattices
We survey results concerning special elements of nine types (modular, lower-modular, upper-modular, cancellable, distributive, codistributive, standard, costandard and neutral elements) in the lattice of all semigroup varieties and certain…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
Let $L$ be a finite $n$-element semilattice. We prove that if $L$ has at least $127\cdot 2^{n-8}$ subsemilattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar semilattice with exactly $127\cdot 2^{n-8}-1$…
We show that there is a unique extremal even unimodular lattice of dimension 48 which has an automorphism of order 5 of type 5-(8,16)-8. Since the three known extremal lattices do not admit such an automorphism, this provides a new example…
Given an open set $T\subset [-1,1)$, we introduce the concepts of $T$-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set $T$. We show that certain codes found in the minimal vectors of the…
We introduce the notion of a conformal design based on a vertex operator algebra. This notation is a natural analog of the notion of block designs or spherical designs when the elements of the design are based on self-orthogonal binary…
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…
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…
We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.
In this note, we construct nine families of projective complex minimal surfaces of general type having the canonical map of degree 8 and irregularity 0 or 1. For six of these families the canonical system has a non trivial fixed part.
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
Let $X \subset {\mathbb R}^m$ be a spherical code (i.e., a finite subset of the unit sphere) and consider the ideal of all polynomials in $m$ variables which vanish on $X$. Motivated by a study of cometric ($Q$-polynomial) association…
We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…
We give classifications of integral lattices which include the Barnes-Wall lattice $BW_{16}$ or laminated lattices of dimension $1 \leqslant d \leqslant 8$ and of minimum 4. Also, we give certain lattice neighboring from each lattice.…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
Let $L$ be a finite $n$-element lattice. We prove that if $L$ has at least $83\cdot 2^{n-8}$ sublattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar lattice with exactly $83\cdot 2^{n-8}-1$ sublattices.
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…
The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…