相关论文: Lattices and codes with long shadows

An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…

We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly,…

We give an explicit formula to express the weight of $2$-reflective modular forms. We prove that there is no $2$-reflective lattice of signature $(2,n)$ when $n\geq 15$ and $n\neq 19$ except the even unimodular lattices of signature…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

We prove several inequalities on the determinants of sublattices in LLL-reduced bases. They generalize the inequalities on the length of the shortest vector proven by Lenstra, Lenstra, and Lovasz, and show that LLL-reduction finds not only…

An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…

Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…

We characterize conjugacy classes of isometries of odd prime order in unimodular Z-lattices. This is applied to give a complete classification of odd prime order non-symplectic automorphisms of irreducible holomorphic symplectic manifolds…

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…

Let L and L' be two integral Euclidean lattices in the same genus. We give an asymptotic formula for the number of Kneser p-neighbors of L which are isometric to L', when the prime p goes to infinity. In the case L is unimodular, and if we…

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 D\'iaz-Dineen's problem for regular homogeneous vector-valued polynomials. In particular, we prove that if $E^*$ and $F^*$ are lattice isomorphic with at least one having order continuous norm, then $\mathcal{P}^r(^n E; G^*)$ and…

We prove that up to scaling there are only finitely many integral lattices L of signature (2,n) with n>20 or n=17 such that the modular variety defined by the orthogonal group of L is not of general type. In particular, when n>107, every…

We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

There exists a lattice map from the set of pure uniformizable Anderson t-motives to the set of lattices. It is not known what is the image and the fibers of this map. We prove a local result that sheds the first light to this problem and…

The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…

We prove that there are only finitely many isometry classes of even lattices $L$ of signature $(2,n)$ for which the space of cusp forms of weight $1+n/2$ for the Weil representation of the discriminant group of $L$ is trivial. We compute…

E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…