Related papers: Module lattices and their shortest vectors
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
We apply the technique of K\'aroly Bezdek and Daniel Bezdek to study billiard trajectories in convex bodies, when the length is measured with a (possibly asymmetric) norm. We prove a lower bound for the length of the shortest closed…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. We show how to…
We introduce a class of "Lipschitz horizontal" vector fields in homogeneous groups, for which we show equivalent descriptions, e.g. in terms of suitable derivations. We then investigate the associated Cauchy problem, providing a uniqueness…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We give a polynomial time Turing reduction from the $\gamma^2\sqrt{n}$-approximate closest vector problem on a lattice of dimension $n$ to a $\gamma$-approximate oracle for the shortest vector problem. This is an improvement over a…
We study downward deviations of the boundary of the range of a transient walk on the Euclidean lattice. We describe the optimal strategy adopted by the walk in order to shrink the boundary of its range. The technics we develop apply equally…
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…
Spatial-temporal linear model and the corresponding likelihood-based statistical inference are important tools for the analysis of spatial-temporal lattice data. In this paper, we study the asymptotic properties of maximum likelihood…
The closest tensors of higher symmetry classes are derived in explicit form for a given elasticity tensor of arbitrary symmetry. The mathematical problem is to minimize the elastic length or distance between the given tensor and the closest…
We compare lower defect groups associated with $p$-regular classes and vertices of simple modules for a block of a finite group algebra. We show that lower defect groups are contained in vertices of simple modules after suitable reordering.…
We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of…
Any ideal in a number field can be factored into a product of prime ideals. In this paper we study the prime ideal shortest vector problem (SVP) in the ring $ \Z[x]/(x^{2^n} + 1) $, a popular choice in the design of ideal lattice based…
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,…
We present a novel block reduction method for the study of a general class of random band matrices (RBM) defined on the $d$-dimensional lattice $\mathbb{Z}_{L}^d:=\{1,2,\ldots,L\}^{d}$ for $d\in \{1,2\}$, with band width $W$ and an almost…
Two themes associated with invariant measures on the matrix groups ${\rm SL}_N(\mathbb F)$, with $\mathbb F = \mathbb R, \mathbb C$ or $\mathbb H$, and their corresponding lattices parametrised by ${\rm SL}_N(\mathbb F)/{\rm SL}_N(\mathbb…
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…