Abstract
Little is known about the connectedness of self-affine tiles in ${\Bbb R}^n$. In this note we consider this property on the self-affine tiles that are generated by consecutive collinear digit sets. By using an algebraic criterion, we call it the {\it height reducing property}, on expanding polynomials (i.e., all the roots have moduli $ > 1$), we show that all such tiles in ${\Bbb R}^n, n \leq 3$, are connected. The problem is still unsolved for higher dimensions. For this we make another investigation on this algebraic criterion. We improve a result of Garsia concerning the heights of expanding polynomials. The new result has its own interest from an algebraic point of view and also gives further insight to the connectedness problem.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Kirat, I., Lau, KS. & Rao, H. Expanding Polynomials and Connectedness of Self-Affine Tiles. Discrete Comput Geom 31, 275–286 (2004). https://doi.org/10.1007/s00454-003-2879-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-2879-8