2000 character limit reached
Matching for generalised $β$-transformations
Published 6 Oct 2016 in math.DS | (1610.01872v1)
Abstract: We investigate matching for the family $T_\alpha(x) = \beta x + \alpha \pmod 1$, $\alpha \in [0,1]$, for fixed $\beta > 1$. Matching refers to the property that there is an $n \in \mathbb N$ such that $T_\alphan(0) = T_\alphan(1)$. We show that for various Pisot numbers $\beta$, matching occurs on an open dense set of $\alpha \in [0,1]$ and we compute the Hausdorff dimension of its complement. Numerical evidence shows more cases where matching is prevalent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.