Related papers: Sharp density discrepancy for cut and project sets…
We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…
We study points in cut-and-project sets which are visible from the origin, continuing a direction of inquiry initiated in [6,14] where the asymptotic density of visible points was investigated. We establish an error bound for the density of…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…
The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…
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…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we…
We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Following a century of research on the topic, it is still unclear…
We study the $L^{\infty}$ discrepancy of point sets generated by determinantal point processes on all compact, connected two-point homogeneous spaces, namely spheres and projective spaces. Using concentration inequalities and variance…
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…
In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…
We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices.…
We briefly review the diffraction of quasicrystals and then give an elementary alternative proof of the diffraction formula for regular cut-and-project sets, which is based on Bochner's theorem from Fourier analysis. This clarifies a common…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
In the present paper we establish bounds for the size of the spectral gap for actions of algebraic groups on certain homogeneous spaces. Our approach is based on estimating operator norms of suitable averaging operators, and we develop…
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…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
We generalise M. M. Skriganov's notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such…