Expanding polynomials and connectedness of self-affine tiles
Publication in refereed journal

香港中文大學研究人員

引用次數
替代計量分析
.

其它資訊
摘要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.
著者Kirat I, Lau KS, Rao H
期刊名稱Discrete and Computational Geometry
出版年份2004
月份3
日期1
卷號31
期次2
出版社SPRINGER-VERLAG
頁次275 - 286
國際標準期刊號0179-5376
語言英式英語
Web of Science 學科類別Computer Science; Computer Science, Theory & Methods; COMPUTER SCIENCE, THEORY & METHODS; Mathematics; MATHEMATICS

上次更新時間 2021-26-02 於 00:35