Related papers: Recovering the lattice from its random perturbatio…
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
A novel application of lattice QCD spectral reconstruction is presented, in which euclidean correlation function data in a fixed time range are used to infer values outside the range, enabling a model-independent investigation of the…
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…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
We consider a collection of weighted Euclidian random balls in R^d distributed according a determinantal point process. We perform a zoom-out procedure by shrinking the radii while increasing the number of balls. We observe that the…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We show that the transition laws for a 2-connection can be recovered by discretizing the base 2-space of a 2-bundle into an Euclidean hypercubic lattice. The aim of this work is to serve as an example of how important results in higher…
Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$…
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it…
The aim of the paper is to provide a constructive method for recovering a unitary matrix from experimental data. Since there is a natural immersion of unitary matrices within the set of double stochastic ones, the problem to solve is to…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
It is well known that from two-dimensional lattice equations one can derive one-dimensional lattice equations by imposing periodicity in some direction. In this paper we generalize the periodicity condition by adding a symmetry…
The diffraction of various random subsets of the integer lattice $\mathbb{Z}^{d}$, such as the coin tossing and related systems, are well understood. Here, we go one important step beyond and consider random point sets in $\mathbb{R}^{d}$.…
We introduce a dynamical lattice regulator for Euclidean quantum field theories on a fixed hypercubic graph $\Lambda\simeq\mathbb{Z}^d$, in which the embedding $x:\Lambda\to\mathbb{R}^d$ is promoted to a dynamical field and integrated over…
This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar with…
We develop a systematic procedure of finding integrable ''relativistic'' (regular one-parameter) deformations for integrable lattice systems. Our procedure is based on the integrable time discretizations and consists of three steps. First,…
We consider the problem of structure recovery in a graphical model of a tree where some variables are latent. Specifically, we focus on the Gaussian case, which can be reformulated as a well-studied problem: recovering a semi-labeled tree…
We propose an effective geometrical approach to recover the normal form of a given Elasticity tensor, once we know its symmetry class. In other words, we produce a rotation which brings an Elasticity tensor onto its normal form, given its…