相关论文: Improved Upper Bounds on the Hermite and KZ Consta…

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…

Given a lattice basis of n vectors in Z^n, we propose an algorithm using 12n^3+O(n^2) floating point operations for checking whether the basis is LLL-reduced. If the basis is reduced then the algorithm will hopefully answer ''yes''. If the…

The use of Heavy Quark Effective Theory (HQET) on the lattice as an approach to B-physics phenomenology is based on a non-perturbative matching of HQET to QCD in finite volume. As a first step to apply the underlying strategy in the…

In this work we introduce a worldline based fermion Monte Carlo algorithm for studying few body quantum mechanics of self-interacting fermions in the Hamiltonian lattice formulation. Our motivation to construct the method comes from our…

We present an approach to achieve zero modes in lattice models that do not rely on any symmetry or topology of the bulk, which are robust against disorder in the bulk of any type and strength. Such symmetry-free zero modes (SFZMs) are…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the additional property that the $n$ cyclic shifts of every given codeword are all distinct, where $n$ is the code length. Constant weight binary hopping cyclic codes are also…

We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…

Within the framework of the search for the still unknown exact value of the real and complex Grothendieck constant $K_G^\mathbb{F}$ in the famous Grothendieck inequality (unsolved since 1953), where $\mathbb{F}$ denotes either the real or…

We prove a new lower bound on the algorithmic information content of points lying on a line in $\mathbb{R}^n$. More precisely, we show that a typical point $z$ on any line $\ell$ satisfies \begin{equation*} K_r(z)\geq \frac{K_r(\ell)}{2} +…

The slope of the Isgur-Wise function at the normalization point, $\xi^{(1)}(1)$,is one of the basic parameters for the extraction of the $CKM$ matrix element $V_{cb}$ from exclusive semileptonic decay data. A method for measuring this…

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…

Employing the lattice theory on majorization, we investigate the universal quantum uncertainty relation for any number observables and general measurement. We find: 1. The least bounds of the universal uncertainty relations can only be…

This paper considers $n= 128$ dimensional construction A lattice design, using binary codes with known minimum Hamming distance and codeword multiplicity, the number of minimum weight codeword. A truncated theta series of the lattice is…

In the lattice formulation of the Heavy Quark Effective Theory (LHQET), the classical velocity becomes renormalized. The origin of this renormalization is the reduction of Lorentz (or O(4)) invariance to (hyper)cubic invariance. The…

Let $\zeta_K(s)$ denote the Dedekind zeta-function associated to a number field $K$. In this paper, we give an effective upper bound for the height of first non-trivial zero other than $1/2$ of $\zeta_K(s)$ under the generalized Riemann…

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…

A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…

For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…