Matching for generalised $\beta$-transformations
Henk Bruin, Carlo Carminati, Charlene Kalle

TL;DR
This paper studies the property of matching in generalized beta-transformations, showing that for certain Pisot numbers, matching occurs densely and the size of the non-matching set is quantified, supported by numerical evidence.
Contribution
It demonstrates that for specific Pisot numbers, matching occurs on an open dense set of parameters and calculates the Hausdorff dimension of the non-matching set.
Findings
Matching occurs on an open dense set for certain Pisot numbers.
The Hausdorff dimension of the non-matching set is computed.
Numerical evidence suggests matching is widespread across parameters.
Abstract
We investigate matching for the family , , for fixed . Matching refers to the property that there is an such that . We show that for various Pisot numbers , matching occurs on an open dense set of and we compute the Hausdorff dimension of its complement. Numerical evidence shows more cases where matching is prevalent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Computability, Logic, AI Algorithms · semigroups and automata theory
