3,409 research outputs found
Weak local rules for planar octagonal tilings
We provide an effective characterization of the planar octagonal tilings
which admit weak local rules. As a corollary, we show that they are all based
on quadratic irrationalities, as conjectured by Thang Le in the 90s.Comment: 23 pages, 6 figure
Generalized quasiperiodic Rauzy tilings
We present a geometrical description of new canonical -dimensional
codimension one quasiperiodic tilings based on generalized Fibonacci sequences.
These tilings are made up of rhombi in 2d and rhombohedra in 3d as the usual
Penrose and icosahedral tilings. Thanks to a natural indexing of the sites
according to their local environment, we easily write down, for any
approximant, the sites coordinates, the connectivity matrix and we compute the
structure factor.Comment: 11 pages, 3 EPS figures, final version with minor change
Generalized quasiperiodic Rauzy tilings
We present a geometrical description of new canonical -dimensional
codimension one quasiperiodic tilings based on generalized Fibonacci sequences.
These tilings are made up of rhombi in 2d and rhombohedra in 3d as the usual
Penrose and icosahedral tilings. Thanks to a natural indexing of the sites
according to their local environment, we easily write down, for any
approximant, the sites coordinates, the connectivity matrix and we compute the
structure factor.Comment: 11 pages, 3 EPS figures, final version with minor change
A formula for the number of tilings of an octagon by rhombi
We propose the first algebraic determinantal formula to enumerate tilings of
a centro-symmetric octagon of any size by rhombi. This result uses the
Gessel-Viennot technique and generalizes to any octagon a formula given by
Elnitsky in a special case.Comment: New title. Minor improvements. To appear in Theoretical Computer
Science, special issue on "Combinatorics of the Discrete Plane and Tilings
Fixed Point and Aperiodic Tilings
An aperiodic tile set was first constructed by R.Berger while proving the
undecidability of the domino problem. It turned out that aperiodic tile sets
appear in many topics ranging from logic (the Entscheidungsproblem) to physics
(quasicrystals) We present a new construction of an aperiodic tile set that is
based on Kleene's fixed-point construction instead of geometric arguments. This
construction is similar to J. von Neumann self-reproducing automata; similar
ideas were also used by P. Gacs in the context of error-correcting
computations. The flexibility of this construction allows us to construct a
"robust" aperiodic tile set that does not have periodic (or close to periodic)
tilings even if we allow some (sparse enough) tiling errors. This property was
not known for any of the existing aperiodic tile sets.Comment: v5: technical revision (positions of figures are shifted
Quasiperiodicity and non-computability in tilings
We study tilings of the plane that combine strong properties of different
nature: combinatorial and algorithmic. We prove existence of a tile set that
accepts only quasiperiodic and non-recursive tilings. Our construction is based
on the fixed point construction; we improve this general technique and make it
enforce the property of local regularity of tilings needed for
quasiperiodicity. We prove also a stronger result: any effectively closed set
can be recursively transformed into a tile set so that the Turing degrees of
the resulted tilings consists exactly of the upper cone based on the Turing
degrees of the later.Comment: v3: the version accepted to MFCS 201
- …