相关论文: Lattices and codes with long shadows
Docovic and Szechtman, [Proc. Amer. Math. Soc. 133 (2005) 2853-2863] considered a vector space V endowed with a bilinear form. They proved that all isometries of V over a field F of characteristic not 2 have determinant 1 if and only if V…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
The main goal of the article is testing a new classification algorithm. To this end we apply it to a relevant problem of describing the integrable cases of a subclass of two-dimensional lattices. By imposing the cut-off conditions…
We study the existence of cocompact lattices in Lie groups with bi-invariant metric of signature $(2,n-2)$. We assume in addition that the Lie groups under consideration are simply-connected, indecomposable and solvable. Then their centre…
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$…
The present work deals with the characterization of parity vectors of Collatz sequences (of finite and infinite length). Such a characterization leads to the determination of several numbers (integers or non-integers) that we call the…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…
We characterize the irreducible polynomials that occur as a characteristic polynomial of an automorphism of an even unimodular lattice of given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general…
We investigate the alternate order on a congruence-uniform lattice $\mathcal{L}$ as introduced by N. Reading, which we dub the core label order of $\mathcal{L}$. When $\mathcal{L}$ can be realized as a poset of regions of a simplicial…
We derive a necessary and sufficient condition for Poincar\'e Lie superalgebras in any dimension and signature to be isomorphic. This reduces the classification problem, up to certain discrete operations, to classifying the orbits of the…
The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…
We consider the lattice of supercharacter theories, in the sense of Diaconis and Isaacs, of the cyclic group of order n. We find necessary and sufficient conditions on n for that lattice to be upper or lower semimodular.
The d-invariant of an integral, positive definite lattice L records the minimal norm of a characteristic covector in each equivalence class mod 2L. We prove that the 2-isomorphism type of a connected graph is determined by the d-invariant…
Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…
We prove new upper bounds on the size of families of vectors in $\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\vec{u}_1,\ldots,\vec{u}_t \in \Z_m^n$ and $\vec{v}_1,\ldots,\vec{v}_t \in…
A set of vectors all of which have a constant (non-zero) norm value in an Euclidean lattice is called a shell of the lattice. Venkov classified strongly perfect lattices of minimum 3 (R\'{e}seaux et "designs" sph\'{e}rique, 2001), whose…
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…