Related papers: Effective module lattices and their shortest vecto…

We study the shortest vector lengths in module lattices over arbitrary number fields, with an emphasis on cyclotomic fields. In particular, we sharpen the techniques of arXiv:2308.15275v2 to establish improved results for the variance of…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

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 an effective variant of the Kazhdan-Margulis theorem generalized to stationary actions of semisimple groups over local fields: the probability that the stabilizer of a random point admits a non-trivial intersection with a small…

We examine the moments of the number of lattice points in a fixed ball of volume $V$ for lattices in Euclidean space which are modules over the ring of integers of a number field $K$. In particular, denoting by $\omega_K$ the number of…

This paper partially addresses the problem of characterizing the lengths of vectors in a family of Euclidean lattices that arise from any CM number field. We define a modified quadratic form on these lattices, the weighted norm, that…

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only…

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…

We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…

Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

We prove an effective version of a result due to Einsiedler, Mozes, Shah and Shapira on the asymptotic distribution of primitive rational points on expanding closed horospheres in the space of lattices. Key ingredients of our proof include…

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.

Orders in number fields provide natural examples of lattices. We ask: what can the successive minima of lattices arising from orders in number fields be? Given an order $\mathcal{O}$ of absolute discriminant $\Delta$ in a degree $n$ number…