相关论文: A characterisation of linear repetitivity for cut …

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…

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…

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

Quasiperiodic arrangements of the constitutive materials in composites result in effective properties with very unusual electromagnetic and elastic properties. The paper discusses the cut-and-projection method that is used to characterize…

Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…

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…

Tilings based on the cut and project method are key model systems for the description of aperiodic solids. Typically, quantities of interest in crystallography involve averaging over large patches, and are well defined only in the…

Model sets (or cut and project sets) provide a familiar and commonly used method of constructing and studying nonperiodic point sets. Here we extend this method to situations where the internal spaces are no longer Euclidean, but instead…

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.…

Averaging certain class of quasiperiodic monotone operators can be simplified to the periodic homogenization setting by mapping the original quasiperiodic structure onto a periodic structure in a higher dimensional space using cut-and…

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…

Alternating projection method has been used in a wide range of engineering applications since it is a gradient-free method (without requiring tuning the step size) and usually has fast speed of convergence. In this paper, we formalize two…

Different notions on regularity of sets and of collection of sets play an important role in the analysis of the convergence of projection algorithms in nonconvex scenarios. While some projection algorithms can be applied to feasibility…

We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalises work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on…

In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\{z\in \mathcal H\mid…

We study the variance in the number of points contained within a window $\Omega$ of arbitrary size, and to further illuminate our understanding of {\it hyperuniform} systems, i.e., point patterns that do not possess long-wavelength…

We prove that almost every finite collection of matrices in $GL_d(\mathbb{R})$ and $SL_d(\mathbb{R})$ with positive entries is Diophantine. Next we restrict ourselves to the case $d=2$. A finite set of $SL_2(\mathbb{R})$ matrices induces a…

A question raised by Davies et al [Phys. Rev. Lett. 131, 2023] is: "Can developing new cut and project models, where the lattice is not square or the curve is non-linear, generate better performing graded metamaterials?" In this article, we…

Model sets (also called cut and project sets) are generalizations of lattices. Here we show how the self-similarities of model sets are a natural replacement for the group of translations of a lattice. This leads us to the concept of…

We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible set is defined by a nonlinear and nonsmooth continuous…