Expanding polynomials and connectedness of self-affine tiles


Kirat I., Lau K., Rao H.

DISCRETE & COMPUTATIONAL GEOMETRY, vol.31, no.2, pp.275-286, 2004 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 31 Issue: 2
  • Publication Date: 2004
  • Doi Number: 10.1007/s00454-003-2879-8
  • Title of Journal : DISCRETE & COMPUTATIONAL GEOMETRY
  • Page Numbers: pp.275-286

Abstract

Little is known about the connectedness of self-affine tiles in 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 height reducing property, on expanding polynomials (i.e., all the roots have moduli > 1), we show that all such tiles in R-n, n less than or equal to 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.