Related papers: Lattice Bounded Distance Equivalence for 1D Delone…
We investigate the complex spectra \[ X^{\mathcal A}(\beta)=\left\{\sum_{j=0}^na_j\beta^j : n\in{\mathbb N},\ a_j\in{\mathcal A}\right\} \] where $\beta$ is a quadratic or cubic Pisot-cyclotomic number and the alphabet $\mathcal A$ is given…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace, and are fully characterised by the shape of the slice (window) and the choice of the lattice. In this context we…
One-dimensional cut-and-project point sets obtained from the square lattice in the plane are considered from a unifying point of view and in the perspective of aperiodic wavelet constructions. We successively examine their geometrical…
This paper uses a connection between bounded remainder sets in $\mathbb{R}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some…
Lattice results, kinematical constraints and QCD dispersion relations are combined for the first time to derive model-independent bounds for QCD form factors and corresponding rates. To take into account the error bars on the lattice…
One of the aims of this paper is to solve an open problem of Lovasz about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the cut-norm and the two largest singular values…
Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…
We show that the possibility to address and image single sites of an optical lattice, now an experimental reality, allows to measure the frequency-resolved local particle and hole spectra of a wide variety of one- and two-dimensional…
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight…
It is shown that the partial amplitudes of the pure point part of the diffraction spectrum of an aperiodic Delone point pattern of finite local complexity are linked by a set of linear constraints. These relations can be explicitly derived…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
We investigate one-electron properties of one-dimensional self-similar structures called limit quasi-periodic lattices. The trace map of such a lattice is nonconservative in contrast to the quasi-periodic case, and we can determine the…
Results are presented for hadron spectroscopy with gauge groups SU(N) with N=3, 5, 7. Calculations use the quenched approximation. Lattice spacings are matched using the static potential. Meson spectra show independence on N and…
The (classical) Lagrange spectrum is a closed subset of the positive real numbers defined in terms of diophantine approximation. Its structure is quite involved. This article describes a polynomial time algorithm to approximate it in…
In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
Markoff-Lagrange spectrum uncovers exotic topological properties of Diophantine approximation. We investigate asymptotic properties of geometric progressions modulo one and observe significantly analogous results on the set \[ {\mathcal…