A self-similar tiling generated by the minimal Pisot number
Shigeki Akiyama, Taizo Sadahiro (1998)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Displaying similar documents to “Tilings associated with beta-numeration and substitutions.”
A self-similar tiling generated by the minimal Pisot number
When can you tile a box with translates of two given rectangular bricks?
Bower, Richard J., Michael, T.S. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting fixed-height tatami tilings.
Ruskey, Frank, Woodcock, Jennifer (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Monomer-dimer tatami tilings of rectangular regions.
Erickson, Alejandro, Ruskey, Frank, Woodcock, Jennifer, Schurch, Mark (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multiple tilings of with long periods, and tiles with many-generated level semigroups.
Steinberger, John P. (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
On substitution invariant Sturmian words: an application of Rauzy fractals
Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
Sturmian words are infinite words that have exactly factors of length for every positive integer . A Sturmian word is also defined as a coding over a two-letter alphabet of the orbit of point under the action of the irrational rotation (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give an alternative ...
Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences.
Sagan, Bruce E., Savage, Carla D. (2010)
Integers
Similarity:
On multiplicatively dependent linear numeration systems, and periodic points
Christiane Frougny (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.