English
Related papers

Related papers: Lattices and codes with long shadows

200 papers

We classify the simple even lattices of square free level and signature (2,n) for n > 3. A lattice is called simple if the space of cusp forms of weight 1+n/2 for the dual Weil representation of the lattice is trivial. For a simple lattice…

Number Theory · Mathematics 2015-02-10 Moritz Dittmann , Heike Hagemeier , Markus Schwagenscheidt

A Type II lattice of norm 8 in dimension 72 is obtained by Construction A applied to an extended Quadratic Residue code over Z8. Its automorphism group contains a subgroup isomorphic to PSL(2,71).

Information Theory · Computer Science 2010-10-27 Jean-Claude Belfiore , Patrick Solé

Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its…

Combinatorics · Mathematics 2015-11-25 Camino Balbuena , Florent Foucaud , Adriana Hansberg

We study the path realization of Demazure crystals related to solvable lattice models in statistical mechanics. Various characters are represented in a unified way as the sums over one dimensional configurations which we call unrestricted,…

q-alg · Mathematics 2008-02-03 A. Kuniba , K. C. Misra , M. Okado , T. Takagi , J. Uchiyama

Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is…

Information Theory · Computer Science 2016-05-10 Maiara F. Bollauf , Ram Zamir

Characteristic Lie rings for Toda type 2+1 dimensional lattices are defined. Some properties of these rings are studied. Infinite sequence of special kind modules are introduced. It is proved that for known integrable lattices these modules…

Exactly Solvable and Integrable Systems · Physics 2015-06-11 Ismagil Habibullin

A natural first step in the classification of all `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ lies in understanding the commutant of the modular matrices $S$ and $T$. We begin this paper extending the work of…

High Energy Physics - Theory · Physics 2009-10-22 Terry Gannon

Let $\lambda_k$ denote the $k$-th successive minimum of a lattice $L$. We study properties of the lengths of certain bases of $L$. If $v_1, \dots v_n$ is a basis which is reduced in the sense of Minkowski we show that $\lvert v_k \rvert^2…

Metric Geometry · Mathematics 2021-08-24 Shvo Regavim

Let G be a topological Kac-Moody group of rank 2 with symmetric Cartan matrix, defined over a finite field F_q. An example is G = SL(2,F_q((t^{-1}))). We determine a positive lower bound on the covolumes of cocompact lattices in G, and…

Group Theory · Mathematics 2020-01-21 Inna , Capdeboscq , Anne Thomas

We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…

Operator Algebras · Mathematics 2009-05-09 Feng Xu

Let $\| \cdot \|$ be the euclidean norm on ${\bf R}^n$ and $\gamma_n$ the (standard) Gaussian measure on ${\bf R}^n$ with density $(2 \pi )^{-n/2} e^{- \| x\|^2 /2}$. Let $\vartheta$ ($ \simeq 1.3489795$) be defined by $\gamma_1 ([ -…

Metric Geometry · Mathematics 2016-09-06 W. Banaszczyk , Stanislaw J. Szarek

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Group Theory · Mathematics 2023-07-11 Lev Glebsky , Alexander Lubotzky , Nicolas Monod , Bharatram Rangarajan

The usual quantizer based on an n-dimensional lattice L maps a point x in R^n to a closest lattice point. Suppose L is the intersection of lattices L_1, ..., L_r. Then one may instead combine the information obtained by simultaneously…

Combinatorics · Mathematics 2014-09-18 N. J. A. Sloane , B. Beferull-Lozano

An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of…

Discrete Mathematics · Computer Science 2011-02-25 Florent Foucaud , Eleonora Guerrini , Matjaz Kovse , Reza Naserasr , Aline Parreau , Petru Valicov

We use the automorphism group $Aut(H)$, of holes in the lattice $L_8=A_2\oplus A_2\oplus D_4$, as the starting point in the construction of sphere packings in 10 and 12 dimensions. A second lattice, $L_4=A_2\oplus A_2$, enters the…

Metric Geometry · Mathematics 2008-02-07 Veit Elser , Simon Gravel

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

Combinatorics · Mathematics 2007-05-23 Bruce E. Sagan

Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…

Rings and Algebras · Mathematics 2013-10-01 G. Grätzer , E. T. Schmidt , R. W. Quackenbush

We investigate the lattice L(V) of subspaces of an m-dimensional vector space V over a finite field GF(q) with q being the n-th power of a prime p. It is well-known that this lattice is modular and that orthogonality is an antitone…

Rings and Algebras · Mathematics 2020-02-04 Ivan Chajda , Helmut Länger

We determine the normalizer in $SL_{2}(\mathbb{R})$ of several families of congruence subgroups of $SL_{2}(\mathbb{Z})$. In addition, we show how these tools can be used to evaluate the groups of automorphisms and the discriminant kernels…

Number Theory · Mathematics 2020-08-13 Shaul Zemel

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Marina V. Semenova