English
Related papers

Related papers: Recovering the lattice from its random perturbatio…

200 papers

Continuing the analysis in a unified scheme for treating generalized superselection sectors based upon the notion of selection criteria for states of relevance in quantum physics, we extend the Doplicher-Roberts superselection theory for…

Mathematical Physics · Physics 2007-05-23 I. Ojima

We describe how to overcome some problems that usually prevent from obtaining an efficient algorithm to fix a generic covariant gauge on the lattice. This gauge is the lattice equivalent of the generic gauge usually adopted in perturbative…

High Energy Physics - Lattice · Physics 2015-06-25 L. Giusti , M. L. Paciello , S. Petrarca , B. Taglienti

Recovering an unknown Hamiltonian from measurements is an increasingly important task for certification of noisy quantum devices and simulators. Recent works have succeeded in recovering the Hamiltonian of an isolated quantum system with…

Quantum Physics · Physics 2019-01-24 Eyal Bairey , Itai Arad , Netanel H. Lindner

A simplified test of universality in Lattice QCD is performed by analytically evaluating the continuous Euclidean time limits of various lattice fermion determinants, both with and without a Wilson term to lift the fermion doubling on the…

High Energy Physics - Lattice · Physics 2009-11-10 David H. Adams

A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…

Combinatorics · Mathematics 2021-05-31 Alexander P. Kartun-Giles , Kostas Koufos , Nicolas Privault

We derive an improved lattice Hamiltonian for pure gauge theory, coupling arbitrarily distant links in the kinetic term. The level of improvement achieved is examined in variational calculations of the SU(2) specific heat in 2+1 dimensions.

High Energy Physics - Lattice · Physics 2015-06-25 J. Carlsson , J. A. L. McIntosh , B. H. J. McKellar , L. C. L. Hollenberg

We study the problem of learning a tensor from a set of linear measurements. A prominent methodology for this problem is based on a generalization of trace norm regularization, which has been used extensively for learning low rank matrices,…

Machine Learning · Computer Science 2013-07-18 Bernardino Romera-Paredes , Massimiliano Pontil

Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…

We present a technique for recovering a vector field and a symmetric $2$-tensor field, both real-valued and compactly supported in some strictly convex bounded domain with smooth boundary in the Euclidean plane, from the sum of their…

Analysis of PDEs · Mathematics 2025-05-06 Rahul Bhardwaj , Karishman B. Solanki

Consider a $d$-dimensional simplex whose vertices are random points chosen independently according to the standard Gaussian distribution on $\mathbb R^d$. We prove that the expected angle sum of this random simplex equals the angle sum of…

Probability · Mathematics 2019-03-06 Zakhar Kabluchko , Dmitry Zaporozhets

This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using ``coupling…

Combinatorics · Mathematics 2007-05-23 James Propp

We present a systematic method for the construction of discrete Painlev\'e equations. The method, dubbed `restoration', allows one to obtain all discrete Painlev\'e equations that share a common autonomous limit, up to homographic…

Mathematical Physics · Physics 2019-06-26 Basil Grammaticos , Alfred Ramani , Ralph Willox

A discretization of the peakons lattice is introduced, belonging to the same hierarchy as the continuous--time system. The construction examplifies the general scheme for integrable discretization of systems on Lie algebras with $r$--matrix…

solv-int · Physics 2009-10-28 Yuri B. Suris

We propose methods for synthesizing multilayer optical lattices of cold atoms in a layer-by-layer manner, to unlock the potential of optical lattices in simulating the fascinating physics of multilayer systems. Central to the approach is to…

Quantum Gases · Physics 2021-05-07 Lei Hao

Gabor phase retrieval is the problem of reconstructing a signal from only the magnitudes of its Gabor transform. Previous findings suggest a possible link between unique solvability of the discrete problem (recovery from measurements on a…

Functional Analysis · Mathematics 2025-05-07 Rima Alaifari , Francesca Bartolucci , Stefan Steinerberger , Matthias Wellershoff

The discrete Gaussian $D_{L- t, s}$ is the distribution that assigns to each vector $x$ in a shifted lattice $L - t$ probability proportional to $e^{-\pi \|x\|^2/s^2}$. It has long been an important tool in the study of lattices. More…

Computational Complexity · Computer Science 2019-01-28 Noah Stephens-Davidowitz

Lattice gauge theories are considered with a partial axial gauge fixing along one direction only. This leaves a residual gauge symmetry that is still local in three directions but now global in one. It is found that this $N^{d-1}$ fold…

High Energy Physics - Lattice · Physics 2007-05-23 Michael Grady

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…

Information Theory · Computer Science 2017-09-19 Jinchi Chen , Yulong Liu

We propose a diagnostic tool, a temperature estimator, for lattice gauge theory simulations. The estimator is obtained from the gradient and the Hessian of the Euclidean lattice action. It is gauge invariant, configuration-based, and…

High Energy Physics - Lattice · Physics 2026-01-27 Vamika Longia , Navdeep Singh Dhindsa , Anosh Joseph

A perturbed lattice is a point process $\Pi=\{x+Y_x:x\in \mathbb{Z}^d\}$ where the lattice points in $\mathbb{Z}^d$ are perturbed by i.i.d.\ random variables $\{Y_x\}_{x\in \mathbb{Z}^d}$. A random point process $\Pi$ is said to be rigid if…

Probability · Mathematics 2014-09-17 Yuval Peres , Allan Sly