Related papers: Recovering the lattice from its random perturbatio…
The Hamiltonian limit of lattice gauge theories can be found by extrapolating the results of anisotropic lattice computations, i.e., computations using lattice actions with different temporal and spatial lattice spacings ($a_t\neq a_s$), to…
The simplest nontrivial toy model of a classical SU(3) lattice gauge theory is studied in the Hamiltonian approach. By means of singular symplectic reduction, the reduced phase space is constructed. Two equivalent descriptions of this space…
We show how to perform a resummation, to all orders in perturbation theory, of a certain class of gauge invariant tadpole-like diagrams in Lattice QCD. These diagrams are often largely responsible for lattice artifacts. Our resummation…
We propose a scheme to generate an arbitrary Abelian vector potential for atoms trapped in a two-dimensional optical lattice. By making the optical lattice potential dependent on the atomic state, we transform the problem into that of a…
Computing the first few singular vectors of a large matrix is a problem that frequently comes up in statistics and numerical analysis. Given the presence of noise, exact calculation is hard to achieve, and the following problem is of…
We extend to the clover improved lattice formulation of QCD the resummation of cactus diagrams, i.e. a certain class of tadpole-like gauge invariant diagrams. Cactus resummation yields an improved perturbative expansion. We apply it to the…
A planar array of identical charges at vanishing temperature forms a Wigner crystal with hexagonal symmetry. We take off one (reference) charge in a perpendicular direction, hold it fixed, and search for the ground state of the whole…
This paper studies the problem of accurately recovering a structured signal from a small number of corrupted sub-Gaussian measurements. We consider three different procedures to reconstruct signal and corruption when different kinds of…
We present deterministic algorithms for the uniform recovery of $d$-variate rank one tensors from function values. These tensors are given as product of $d$ univariate functions whose $r$th weak derivative is bounded by $M$. The recovery…
In data processing and machine learning, an important challenge is to recover and exploit models that can represent accurately the data. We consider the problem of recovering Gaussian mixture models from datasets. We investigate symmetric…
The vicious random walker problem on a one dimensional lattice is considered. Many walkers take simultaneous steps on the lattice and the configurations in which two of them arrive at the same site are prohibited. It is known that the…
A theoretical formulation of lattice Boltzmann models on a general curvilinear coordinate system is presented. It is based on a volumetric representation so that mass and momentum are exactly conserved as in the conventional lattice…
In this paper, we consider a regular tessellation of the Euclidean plane and the sequence of its geometric scalings by negative powers of a fixed integer. We generate iteratively random sets as the union of adjacent tiles from these…
We study the wave function localization properties in a d-dimensional model of randomly spaced particles with isotropic hopping potential depending solely on Euclidean interparticle distances. Due to the generality of this model usually…
We establish novel uniqueness results for the Gabor phase retrieval problem: if $\mathcal{G} : L^2(\mathbb{R}) \to L^2(\mathbb{R}^2)$ denotes the Gabor transform then every $f \in L^4[-\tfrac{c}{2},\tfrac{c}{2}]$ is determined up to a…
A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
In the phase retrieval problem, an unknown vector is to be recovered given quadratic measurements. This problem has received considerable attention in recent times. In this paper, we present an algorithm to solve a nonconvex formulation of…
We study the multivariate integration problem for periodic functions from the weighted Korobov space in the randomized setting. We introduce a new randomized rank-1 lattice rule with a randomly chosen number of points, which avoids the need…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…