TY - JOUR
T1 - Expanding Polynomials and Connectedness of Self-Affine Tiles
AU - Kirat, Ibrahim
AU - Lau, Ka Sing
AU - Rao, Hui
PY - 2004/3
Y1 - 2004/3
N2 - Little is known about the connectedness of self-affine tiles in ℝ 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 ℝn, n ≤ 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.
AB - Little is known about the connectedness of self-affine tiles in ℝ 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 ℝn, n ≤ 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.
UR - http://www.scopus.com/inward/record.url?scp=1642372739&partnerID=8YFLogxK
U2 - 10.1007/s00454-003-2879-8
DO - 10.1007/s00454-003-2879-8
M3 - Article
AN - SCOPUS:1642372739
SN - 0179-5376
VL - 31
SP - 275
EP - 286
JO - Discrete and Computational Geometry
JF - Discrete and Computational Geometry
IS - 2
ER -