Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCut and project sets with polytopal window II: linear repetitivity
59
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 projects densely into the internal space and (possibly after translation) hits each supporting hyperplane of the polytopal window. Our main result is that LR is satisfied if and only if the patterns are of low complexity (property C), and the projected lattice satisfies a Diophantine condition (property D). Property C can be checked by computation of the ranks and dimensions of linear spans of the stabiliser subgroups of the supporting hyperplanes, as investigated in Part I to this article. To define the correct Diophantine condition D, we establish new results on decomposing polytopal cut and project schemes to factors, developing concepts initiated in the work of Forrest, Hunton and Kellendonk. This means that, when C is satisfied, the window splits into components which induce a compatible splitting of the lattice. Then property D is the requirement that, for any suitable decomposition, these factors do not project close to the origin in the internal space, relative to the norm in the total space. On each factor, this corresponds to the usual notion from Diophantine Approximation of a system of linear forms being badly approximable. This extends previous work on cubical cut and project schemes to a very general class of cut and project schemes. We demonstrate our main theorem on several examples, and derive some further consequences of our main theorem, such as the equivalence LR, positivity of weights and satisfying a subadditive ergodic theorem for this class of polytopal cut and project sets.
rate research
Read More
We construct the first examples of rational functions defined over a non-archimedean field with certain dynamical properties. In particular, we find such functions whose Julia sets, in the Berkovich projective line, are connected but not contained in a line segment. We also show how to compute the measure-theoretic and topological entropy of such maps. In particular, we show for some of our examples that the measure-theoretic entropy is strictly smaller than the topological entropy, thus answering a question of Favre and Rivera-Letelier.
We study random walks on a $d$-dimensional torus by affine expanding maps whose linear parts commute. Assuming an irrationality condition on their translation parts, we prove that the Haar measure is the unique stationary measure. We deduce that if $K subset mathbb{R}^d$ is an attractor of a finite iterated function system of $ngeq 2$ maps of the form $x mapsto D^{-r_i} x + t_i (i=1, ldots, n)$, where $D$ is an expanding $dtimes d$ integer matrix, and is the same for all the maps, and $r_{i} inmathbb{N}$, under an irrationality condition on the translation parts $t_i$, almost every point in $K$ (w.r.t. any Bernoulli measure) has an equidistributed orbit under the map $xmapsto Dx$ (multiplication mod $mathbb{Z}^{d}$). In the one-dimensional case, this conclusion amounts to normality to base $D$. Thus for example, almost every point in an irrational dilation of the middle-thirds Cantor set is normal to base 3.
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 Bochners theorem from Fourier analysis. This clarifies a common view that the diffraction of a quasicrystal is determined by the diffraction of its underlying lattice. To illustrate our approach, we will also treat a number of well-known explicitly solvable examples.
Finite-time coherent sets represent minimally mixing objects in general nonlinear dynamics, and are spatially mobile features that are the most predictable in the medium term. When the dynamical system is subjected to small parameter change, one can ask about the rate of change of (i) the location and shape of the coherent sets, and (ii) the mixing properties (how much more or less mixing), with respect to the parameter. We answer these questions by developing linear response theory for the eigenfunctions of the dynamic Laplace operator, from which one readily obtains the linear response of the corresponding coherent sets. We construct efficient numerical methods based on a recent finite-element approach and provide numerical examples.
A function which is transcendental and meromorphic in the plane has at least two singular values. On one hand, if a meromorphic function has exactly two singular values, it is known that the Hausdorff dimension of the escaping set can only be either $2$ or $1/2$. On the other hand, the Hausdorff dimension of escaping sets of Speiser functions can attain every number in $[0,2]$ (cf. cite{ac1}). In this paper, we show that number of singular values which is needed to attain every Hausdorff dimension of escaping sets is not more than $4$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
