Searcharxiv⌕ Search

arXiv subjects

Nicolas Bédaride

Publications and source records attributed to Nicolas Bédaride.

24 records · Page 2Linked to original sources

No Weak Local Rules for the 4p-Fold Tilings

On the one hand, Socolar showed in 1990 that the n-fold planar tilings admit weak local rules when n is not divisible by 4 (the n=10 case corresponds to the Penrose tilings and is known since 1974). On the other hand, Burkov showed in 1988 that the 8-fold tilings do not admit weak local rules, and Le showed the same for the 12-fold tilings (unpublished). We here show that this is actually the case for all the 4p-fold tilings.

math.DS↗

When periodicities enforce aperiodicity

Aperiodic tilings are non-periodic tilings defined by local rules. They are widely used to model quasicrystals, and a central question is to understand which of the non-periodic tilings are actually aperiodic. Among tilings, those by rhombi can be easily seen as approximations of surfaces in higher dimensional spaces. In particular, those which approximate irrational planes are non-periodic. But which ones are also aperiodic? This paper introduces the notion of subperiod, which links algebraic properties of a plane with geometric properties of the tilings that approximate it. A necessary and sufficient condition is obtained for tilings that can be seen in the four dimensional Euclidean space. This result is then applied to some examples in higher codimensions, notably tilings with n-fold rotational symmetry.

math.DS↗

The Ammann-Beenker tilings revisited

This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as the solution of a simple optimization problem.

math.CO↗

Classification of rotations on the torus $\mathbb{T}^2$

We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the Morse-Hedlund theorem. Here we make a generalization in dimension two.

math.DS↗

Entropy of polyhedral billiard

We consider the billiard map in a convex polyhedron of $\mathbb{R}^3$, and we prove that it is of zero topological entropy.

math.DS↗