Related papers: Module Lattice Security (Part III): Structured CVP…

This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…

$ \newcommand{\SVP}{\mathsf{SVP}} \newcommand{\NP}{\mathsf{NP}} \newcommand{\RTIME}{\mathsf{RTIME}} \newcommand{\RSUBEXP}{\mathsf{RSUBEXP}} \newcommand{\eps}{\epsilon} \newcommand{\poly}{\mathop{\mathrm{poly}}} $We show that unless $\NP…

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

Let $\lambda_k$ denote the $k$-th successive minimum of a lattice $L$. We study properties of the lengths of certain bases of $L$. If $v_1, \dots v_n$ is a basis which is reduced in the sense of Minkowski we show that $\lvert v_k \rvert^2…

We propose a self-improving algorithm for computing Voronoi diagrams under a given convex distance function with constant description complexity. The $n$ input points are drawn from a hidden mixture of product distributions; we are only…

We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…

Let $k$ be a field and let $E$ be a finite quiver. We study the structure of the finitely presented modules of finite length over the Leavitt path algebra $L_k (E)$ and show its close relationship with the finite-dimensional representations…

We show that it is now possible to fully determine the CKM matrix, for the first time, using lattice QCD. |V_{cd}|, |V_{cs}|, |V_{ub}|, |V_{cb}| and |V_{us}| are, respectively, directly determined with our lattice results for form factors…

We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…

In this paper, we introduce the Maximum Distance Sublattice Problem (MDSP). We observed that the problem of solving an instance of the Closest Vector Problem (CVP) in a lattice $\mathcal{L}$ is the same as solving an instance of MDSP in the…

The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost $f(\cdot)$ due to an ordering…

In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are…

Let $\mathbb{R}^m$ be endowed with the Euclidean metric. The covering radius of a lattice $\Lambda \subset \mathbb{R}^m$ is the least distance $r$ such that, given any point of $\mathbb{R}^m$, the distance from that point to $\Lambda$ is…

We present results for charmonium-nucleon potential $V_{c\bar{c}-N}(r)$ from quenched lattice QCD, which is calculated from the equal-time Bethe-Salpeter amplitude through the effective Schr\"odinger equation. Detail information of the…

Inspired by constructions over the complex numbers of Dolgachev and Alexeev-Engel, we define moduli stacks $\mathcal{M}_{(L,\mathcal{A})/\mathbb{Z}}$ of lattice-polarized K3 surfaces over arbitrary bases, paying particular attention to the…

We propose a high-rate scheme for discretely-modulated continuous-variable quantum key distribution (DM CVQKD) using quantum machine learning technologies, which divides the whole CVQKD system into three parts, i.e., the initialization part…

Given $x \in (\mathbb{R}_{\geq 0})^{\binom{[n]}{2}}$ recording pairwise distances, the METRIC VIOLATION DISTANCE (MVD) problem asks to compute the $\ell_0$ distance between $x$ and the metric cone; i.e., modify the minimum number of entries…

Let $V$ be a simple VOA of CFT-type satisfying $V'\cong V$ and $\sigma$ a finite automorphism of $V$. We prove that if all $V$-modules are completely reducible and a fixed point subVOA $V^\sigma$ is $C_2$-cofinite, then all…

We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the…

The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…