相关论文: Improved Upper Bounds on the Hermite and KZ Consta…
We revisit the earlier determination of alpha_s(M_Z) via perturbative analyses of short-distance-sensitive lattice observables, incorporating new lattice data and performing a modified version of the original analysis. We focus on two…
The classical Erd\H{o}s-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
Given a simple closed plane curve $\Gamma$ of length $L$ enclosing a compact convex set $K$ of area $F$, Hurwitz found an upper bound for the isoperimetric deficit, namely $L^2-4\pi F\leq \pi |F_{e}|$, where $F_{e}$ is the algebraic area…
In this work, we improve the accuracy and stability of the lattice Boltzmann model for the Kuramoto-Sivashinsky equation proposed in \cite{2017_Otomo}. This improvement is achieved by controlling the relaxation time, modifying the…
In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
Hybrid Monte Carlo (HMC) simulations of lattice gauge theories with fermionic matter rely on the invertibility of the lattice Dirac operator. Near-zero modes of the latter can therefore significantly slow down the update algorithm and cause…
Fixed-frequency transmon qubits, characterized by simple architectures and long coherence times, are promising platforms for large-scale quantum computing. However, the rapidly increasing frequency collisions, which directly reduce the…
We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…
The influence of the use of the generalized Hermite polynomial on the Hermite-based lattice Boltzmann (LB) construction approach, lattice sets, the thermal weights, moments and the equilibrium distribution function (EDF) are addressed. A…
A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…
Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we…
The work contains a detailed study of the scaling limit of a certain critical, integrable inhomogeneous six-vertex model subject to twisted boundary conditions. It is based on a numerical analysis of the Bethe ansatz equations as well as…
Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols as a part of the decoding process. In…
Lattice quantum chromodynamics (LQCD) has the promise of constraining low-energy constants (LECs) of nuclear effective field theories (EFTs) from first-principles calculations that incorporate the dynamics of quarks and gluons. Given the…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
In this paper we give an improved upper bound for critical value $\lambda_c$ of the basic contact process on the lattice $\mathbb{Z}^d$ with $d\geq 3$. As a direct corollary of out result, \[ \lambda_c\leq 0.384. \] when $d=3$.
After a brief discussion of the promise and limitations of the lattice technique, I review lattice QCD results for several quantities of phenomenological interest. These are: matrix elements for heavy-to-light meson decays, leptonic decay…