Related papers: On the error performance of the $A_n$ lattices
We consider the problem of distributed computation of the nearest lattice point for a two dimensional lattice. An interactive model of communication is considered. We address the problem of reconfiguring a specific rectangular partition, a…
The usual quantizer based on an n-dimensional lattice L maps a point x in R^n to a closest lattice point. Suppose L is the intersection of lattices L_1, ..., L_r. Then one may instead combine the information obtained by simultaneously…
Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.
We study the vortex formation in optical lattices submitted to artificial gauge potentials. We compute the superfluid density for Abelian and non-Abelian gauge potentials with a mean-field approach of the Bose-Hubbard model and we determine…
We say a lattice point $X=(x_1,\ldots,x_m)$ is visible from the origin, if $\gcd(x_1,...,x_m)=1$. In other word, there are no other lattice point on the line segment from the origin $O$ to $X$. From J.E. Nymann's result, we know that the…
Deep-inelastic scattering, in the laboratory and on the lattice, is most instructive for understanding how the nucleon is built from quarks and gluons. The long-term goal is to compute the associated structure functions from first…
The kernel interpolant in a reproducing kernel Hilbert space is optimal in the worst-case sense among all approximations of a function using the same set of function values. In this paper, we compare two search criteria to construct lattice…
New lattice quantizers with lower normalized second moments than previously reported are constructed in 13 and 14 dimensions and conjectured to be optimal. Our construction combines an initial numerical optimization with a subsequent…
We study the sizes of the Voronoi cells of $k$ uniformly chosen vertices in a random split tree of size $n$. We prove that, for $n$ large, the largest of these $k$ Voronoi cells contains most of the vertices, while the sizes of the…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
Given a full column rank $M \in \Z^{\ell \times m}$ and an $F \in \Z^{n \times m}$ we present an algorithm to compute the $n \times n$ basis in Hermite form of the integer lattice comprised of all rows $p \in \Z^{1 \times n}$ such that $pF…
In this paper, we address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a…
Recent lattice calculations of hadron structure functions are described.
An accurate and easily extendable method to deal with lattice dynamics of solids is offered. It is based on first-principles molecular dynamics simulations and provides a consistent way to extract the best possible harmonic - or higher…
We prove a generalized version of Rogers' mean value formula in the space $X_n$ of unimodular lattices in $R^n$, which gives the mean value of a multiple sum over a lattice $L$ and its dual $L^*$. As an application, we prove that for $L$…
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…
Computing a basis for the exponent lattice of algebraic numbers is a basic problem in the field of computational number theory with applications to many other areas. The main cost of a well-known algorithm…
We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive direction $(u,v)$ and two side lengths,…
Effective transport properties of heterogeneous structures are predicted by geometric microstructural parameters, but these can be difficult to calculate. Here, a boundary element code with a recurrent series method accurately and…
The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order…