相关论文: Improved Upper Bounds on the Hermite and KZ Consta…
For the hard-core lattice gas model defined on independent sets weighted by an activity $\lambda$, we study the critical activity $\lambda_c(\mathbb{Z}^2)$ for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice…
Guaranteed upper-lower bounds on homogenized coefficients, arising from the periodic cell problem, are calculated in a scalar elliptic setting. Our approach builds on the recent variational reformulation of the Moulinec-Suquet (1994) Fast…
Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…
We present an improved result of lattice computation of the proton decay matrix elements in $N_f=2+1$ QCD. In this study, the significant improvement of statistical accuracy by adopting the error reduction technique of All-mode-averaging,…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay between error bounds…
Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper shows that lattice coding, as a joint ECC and modulation…
In this article, we prove the restriction theorem for the Fourier-Hermite transform and obtain the Strichartz estimate for the system of orthonormal functions for the Hermite operator $H=-\Delta+|x|^2$ on $\mathbb{R}^n$ as application.…
In practical applications, lattice quantizers leverage discrete lattice points to approximate arbitrary points in the lattice. An effective lattice quantizer significantly enhances both the accuracy and efficiency of these approximations.…
The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with either lower theoretic complexity or fixed-complexity…
We obtain lower bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta function for all k > 1. Previously such lower bounds were known only for rational values of k, with the bounds depending on the height of the…
Review of results from lattice QCD of relevance to standard-model phenomenology, to appear in Annual Review of Nuclear and Particle Science. KEY WORDS: hadron masses, quark mixing (CKM) matrix, weak matrix elements, strong coupling…
We discuss the renormalization of the lattice formulation of the Heavy Quark Effective Theory (LHQET). In addition to wave function and composite operator renormalizations, on the lattice the classical velocity is also renormalized. The…
We discuss testing improved actions in the context of finite volume gauge theories, where both results for the continuum and the Wilson lattice action are known analytically for volumes up to 0.7 fermi across. A new improved action is…
We propose a family of surface codes with general lattice structures, where the error-tolerances against bit and phase errors can be controlled asymmetrically by changing the underlying lattice geometries. The surface codes on various…
We introduce a dilated coordinate method to address computational challenges in nuclear lattice effective field theory (NLEFT) for weakly-bound few-body systems. The approach employs adaptive mesh refinement via analytic coordinate…
In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…
Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…
We suggest several techniques to improve the toric codes and the finite-rate generalized toric codes (quantum hypergraph-product codes) recently introduced by Tillich and Z\'emor. For the usual toric codes, we introduce the rotated lattices…
Special relativity has been tested at low energy with great accuracy, but these results cannot be extrapolated to very high-energy phenomena: this new domain of physics may actually provide the key to the, yet unsettled, question of the…