Related papers: Sharper Bounds on Four Lattice Constants

In 2024, Kliuchnikov and Sch\"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks.…

We present an update on Numerical Stochastic Perturbation Theory projects for Lattice QCD, which are by now run on apeNEXT. As a first issue, we discuss a strategy to tackle finite size effects which can be quite sizeable in the computation…

The Hierarchical Reference Theory (HRT) and the Self-Consistent Ornstein-Zernike Approximation (SCOZA) are two liquid state theories that both furnish a largely satisfactory description of the critical region as well as phase separation and…

We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…

The lowest (``vector'') and next-lowest (``scalar'') bound-state masses of the massive Schwinger model have been determined recently to a very high accuracy numerically on the lattice. Therefore, improved results for these bound-state…

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…

Consider a distributed control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and…

We give a survey on the general effective reduction theory of integral polynomials and its applications. We concentrate on results providing the finiteness for the number of `$\mathbb{Z}$-equivalence classes' and…

We consider a reconstruction problem of a reduced stable positive network system with the preservation of the original interconnection structure based on an $H^2$ optimal model reduction problem with constraints. To this end, we define an…

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…

Let $\Gamma$ be an irreducible lattice in $\PSL_2(\RR)^d$ ($d\in\NN$) and $z$ a point in the $d$-fold direct product of the upper half plane. We study the discrete set of componentwise distances ${\bf D}(\Gm,z)\subset \RR^d$ defined in (1).…

Derivation of the lattice Boltzmann method from the continuous kinetic theory [X. He and L. S. Luo, {\it Phys. Rev. E} {\bf 55}, R6333 (1997); X. Shan and X. He, {\it Phys. Rev. Lett.} {\bf 80}, 65 (1998)] is extended in order to obtain…

We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…

We introduce the Lattice Deduction Transformer (LDT), a recurrent transformer that approximates logically sound deduction by projecting its latent state through a lattice between forward passes. We train on-policy in a process that mirrors…

This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…

This paper describes a constant-time lattice encoder for the National Institute of Standards and Technology (NIST) recommended post-quantum encryption algorithm: Kyber. The first main contribution of this paper is to refine the analysis of…

This paper introduces a simple principle for robust high-dimensional statistical inference via an appropriate shrinkage on the data. This widens the scope of high-dimensional techniques, reducing the moment conditions from sub-exponential…

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum) has been obtained. Our reduction adapts to linear codes…

We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…