Elementary Fractal Geometry. 3. Complex Pisot Factors Imply Finite Type

IF 0.6 3区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Discrete & Computational Geometry Pub Date : 2024-07-20 DOI:10.1007/s00454-024-00678-2
Christoph Bandt
{"title":"Elementary Fractal Geometry. 3. Complex Pisot Factors Imply Finite Type","authors":"Christoph Bandt","doi":"10.1007/s00454-024-00678-2","DOIUrl":null,"url":null,"abstract":"<p>Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker separation property which is always fulfilled for crystallographic data. Ngai and Wang gave more specific results for a finite type property (FT), and for algebraic data with a real Pisot expansion factor. We show how the algorithmic FT concept of Bandt and Mesing relates to the property of Ngai and Wang. Merits and limitations of the FT algorithm are discussed. Our main result says that FT is always true in the complex plane if the similarity mappings are given by a complex Pisot expansion factor <span>\\(\\lambda \\)</span> and algebraic integers in the number field generated by <span>\\(\\lambda .\\)</span> This extends the previous results and opens the door to huge classes of separated self-similar sets, with large complexity and an appearance of natural textures. Numerous examples are provided.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"12 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00678-2","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker separation property which is always fulfilled for crystallographic data. Ngai and Wang gave more specific results for a finite type property (FT), and for algebraic data with a real Pisot expansion factor. We show how the algorithmic FT concept of Bandt and Mesing relates to the property of Ngai and Wang. Merits and limitations of the FT algorithm are discussed. Our main result says that FT is always true in the complex plane if the similarity mappings are given by a complex Pisot expansion factor \(\lambda \) and algebraic integers in the number field generated by \(\lambda .\) This extends the previous results and opens the door to huge classes of separated self-similar sets, with large complexity and an appearance of natural textures. Numerous examples are provided.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
初级分形几何3.复皮索特因子意味着有限类型
自相似集合需要一个分离条件,才能获得良好的数学结构。经典的开放集条件(OSC)很难验证。泽纳证明,对于较弱的分离性质,存在一个正的和有限的豪斯多夫度量,而对于晶体学数据,这个分离性质总是满足的。Ngai 和 Wang 针对有限类型属性(FT)和具有实 Pisot 扩展因子的代数数据给出了更具体的结果。我们展示了 Bandt 和 Mesing 的算法有限类型性质概念与 Ngai 和 Wang 的性质之间的关系。我们还讨论了 FT 算法的优点和局限性。我们的主要结果表明,如果相似性映射是由复数皮索特扩展因子(\λ\)和由\(\λ.\)产生的数域中的代数整数给出的,那么在复平面上FT总是真实的。这扩展了以前的结果,并为具有大复杂性和自然纹理外观的巨大类分离自相似集打开了大门。本文提供了大量实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete & Computational Geometry
Discrete & Computational Geometry 数学-计算机:理论方法
CiteScore
1.80
自引率
12.50%
发文量
99
审稿时长
6-12 weeks
期刊介绍: Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.
期刊最新文献
The Complexity of Order Type Isomorphism Volume Computation for Meissner Polyhedra and Applications Erdős–Szekeres-Type Problems in the Real Projective Plane The Structure of Metrizable Graphs Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1