English
Related papers

Related papers: Lattices and codes with long shadows

200 papers

In the first paper of this series, we constructed a family of lattices in dimensions 2^{n+1} for positive integers n, and proved that the associated lattice packings of spheres equal or exceed the previous records for several values of n.…

Number Theory · Mathematics 2007-05-23 Noam D. Elkies

We present a geometric approach towards derandomizing the Isolation Lemma by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially…

Data Structures and Algorithms · Computer Science 2018-05-08 Rohit Gurjar , Thomas Thierauf , Nisheeth K. Vishnoi

We give a classification of the lattices of rank r=4, r=8 and r=12 over \Q(\sqrt{-3}), which are even and unimodular \Z-lattices. Using this classification we construct the associated theta series, which are Hermitian modular forms, and…

Number Theory · Mathematics 2009-03-26 Michael Hentschel , Aloys Krieg , Gabriele Nebe

For coprime integers $N,a,b,c$, with $0<a<b<c<N$, we define the set $$ \{ (na \! \! \! \! \pmod{N}, nb \! \! \! \! \pmod{N}, nc \! \! \! \! \pmod{N}) : 0 \leq n < N\}. $$ We study which parameters $N,a,b,c$ generate point sets with long…

Number Theory · Mathematics 2020-08-27 Florian Pausinger

We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…

Data Structures and Algorithms · Computer Science 2013-11-05 Ishay Haviv , Oded Regev

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.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

Lattices with a circulant generator matrix represent a subclass of cyclic lattices. This subclass can be described by a basis containing a vector and its circular shifts. In this paper, we present certain conditions under which the norm…

Information Theory · Computer Science 2023-07-07 William Lima da Silva Pinto , Carina Alves

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.…

Rings and Algebras · Mathematics 2011-07-04 Luigi Santocanale , Friedrich Wehrung

The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…

Metric Geometry · Mathematics 2025-09-05 Maiara F. Bollauf , Hsuan-Yin Lin

Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…

Number Theory · Mathematics 2020-11-30 Lenny Fukshansky , Pavel Guerzhoy , Stefan Kuehnlein

The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…

Algebraic Geometry · Mathematics 2026-03-30 András Némethi , Gergő Schefler

We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice…

Number Theory · Mathematics 2024-10-02 Serge Vlăduţ

This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…

Combinatorics · Mathematics 2019-01-04 Peng He , Xue-ping Wang

There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…

Combinatorics · Mathematics 2020-03-24 Andrey Zabolotskiy

For some extremal (optimal) odd unimodular lattice $L$ in dimensions $12,16,20,28,32,36,40$ and $44$, we determine all integers $k$ such that $L$ contains a $k$-frame. This result yields the existence of an extremal Type I…

Combinatorics · Mathematics 2015-03-17 Masaaki Harada

To every $n$-dimensional lens space $L$, we associate a congruence lattice $\mathcal L$ in $\mathbb Z^m$, with $n=2m-1$ and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on $L$ with the number of lattice…

Differential Geometry · Mathematics 2016-07-20 Emilio A. Lauret , Roberto J. Miatello , Juan Pablo Rossetti

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.

Rings and Algebras · Mathematics 2019-07-03 Gábor Czédli

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.…

Combinatorics · Mathematics 2009-01-26 Junichi Shigezumi

We prove that the signature of an even, symmetric form on a finite rank integral lattice, has signature divisible by 8, provided its associated linking form vanishes in the Witt group of linking forms. Our result generalizes the well know…

Geometric Topology · Mathematics 2012-04-26 Stanislav Jabuka

Self-dual codes have been studied actively because they are connected with mathematical structures including block designs and lattices and have practical applications in quantum error-correcting codes and secret sharing schemes.…

Cryptography and Security · Computer Science 2024-09-04 Minjia Shi , Sihui Tao , Jihoon Hong , Jon-Lark Kim