Related papers: Module Lattice Security (Part III): Structured CVP…
One of the landmarks in approximation algorithms is the $O(\sqrt{\log n})$-approximation algorithm for the Uniform Sparsest Cut problem by Arora, Rao and Vazirani from 2004. The algorithm is based on a semidefinite program that finds an…
It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \frac{1}{\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on…
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…
Let $(Q,\mathfrak{n})$ be a regular local ring of dimension $c \geq 2$ with algebraically closed residue field $k = Q/\mathfrak{n}$. Let $f_1, f_2, \ldots f_{c-1}, g$ be a regular sequence in $Q$ such that $ f_i \in \mathfrak{n}^2$ for all…
In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Bloemer. The technique is based on the transference theorems given by Banaszczyk which imply some necessary conditions on the coefficients of the closest…
Under-approximations of reachable sets and tubes have been receiving growing research attention due to their important roles in control synthesis and verification. Available under-approximation methods applicable to continuous-time linear…
We present a new self-contained proof of the well-known fact that the minimal area of a Voronoi cell in a unit circle packing is equal to $2\sqrt{3}$, and the minimum is achieved only on a perfect hexagon. The proof is short and, in our…
In this paper we consider the problem of finding a vector that can be written as a nonnegative integer linear combination of given 0-1 vectors, the generators, such that the l_1-distance between this vector and a given target vector is…
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…
In this study, we present continuum limit results for the unpolarized parton distribution function of the nucleon computed in lattice QCD. This study is the first continuum limit using the pseudo-PDF approach with Short Distance…
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…
A Voronoi diagram partitions the plane into convex cells, each containing the points closest to a single generator. Given such a tessellation, the inverse Voronoi problem seeks the generator set \( S \) that produced it. Our algorithm…
We study multivariate monomial Vandermonde matrices $V_N(Z)$ with arbitrary distinct nodes $Z=\{z_1,\dots,z_s\}\subset B_2^n$ in the high-degree regime $N\ge s-1$. Introducing a projection-based geometric statistic -- the \emph{max-min…
Let $V$ be a $C_2$-cofinite vertex operator algebra without nonzero elements of negative weights. We prove the conjecture that the spaces spanned by analytic extensions of pseudo-$q$-traces ($q=e^{2\pi i\tau}$) shifted by $-\frac{c}{24}$ of…
We show a $2^{n/2+o(n)}$-time algorithm that finds a (non-zero) vector in a lattice $\mathcal{L} \subset \mathbb{R}^n$ with norm at most $\tilde{O}(\sqrt{n})\cdot \min\{\lambda_1(\mathcal{L}), \det(\mathcal{L})^{1/n}\}$, where…
One of the basic propositions of quantum field theory is Lorentz invariance. The spontaneous breaking of Lorentz symmetry at a high energy scale can be studied at low energy extensions like the Standard model in a model-independent way…
In the context of the mean-field exciton-polariton (EP) theory with balanced loss and pump, we investigate the formation of lattice structures built of individual vortex-antivortex (VAV) bound states under the action of the two-dimensional…
The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP are via so-called sieving methods. While these still take…
Consider the setting where a $\rho$-sparse Rademacher vector is planted in a random $d$-dimensional subspace of $R^n$. A classical question is how to recover this planted vector given a random basis in this subspace. A recent result by…
Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the most important problem for the cryptanalysis of lattice-based cryptography, and many lattice-based…