Related papers: Long shortest vectors in low dimensional lattices
In 2018, the longest vector problem (LVP) and the closest vector problem (CVP) in $p$-adic lattices were introduced. These problems are closely linked to the orthogonalization process. In this paper, we first prove that every $p$-adic…
Given a parametric lattice with a basis given by polynomials in Z[t], we give an algorithm to construct an LLL-reduced basis whose elements are eventually quasi-polynomial in t: that is, they are given by formulas that are piecewise…
Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in some finite cone other than all…
In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
A resolving set for a graph $G$ is a set of vertices $Q = \{q_1, ..., q_k\}$ such that, for all $p\in V(G)$ the $k$-tuple $(d(p, q_1), ..., d(p, q_k ))$ uniquely determines $p$, where $d(p, q_i)$ is considered as the minimum length of a…
A recent SICOMP paper on classical and quantum algorithms for the shortest vector problem introduced a lattice-dependent parameter \(\gamma(L)\), bounded universally in the exponential sense by \(2^{0.402n+o(n)}\), and conjectured that this…
We present a substantially more efficient variant, both in terms of running time and size of preprocessing advice, of the algorithm by Liu, Lyubashevsky, and Micciancio for solving CVPP (the preprocessing version of the Closest Vector…
We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…
We show that for any sufficiently large integer $Q$ and a real $0\leq\lambda\leq\frac34$ there exists a value $c(n,f,J)>0$ such that all strips $L(Q,\lambda)=\{(x,y):|y-f(x)|<Q^{-\lambda}, x\in J=[a,b]\}$ contain at least $c(n, f,…
In the following paper we continue the work of Bimonte-Lizzi-Sparano on distances on a one dimensional lattice. We succeed in proving analytically the exact formulae for such distances. We find that the distance to an even point on the…
Let ${\bf C}$ be a smooth geometrically connected projective curve over a finite field, and let $A$ be the affine algebra of its regular functions outside a fixed place of ${\bf C}$. We give precise relationships between the Mahler…
The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2.…
For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…
We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
We study the variance in the number of points contained within a window $\Omega$ of arbitrary size, and to further illuminate our understanding of {\it hyperuniform} systems, i.e., point patterns that do not possess long-wavelength…
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree…
Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…