Graph explorer

Sós Permutations

Let $f(x) = αx + β\mod 1$ for fixed real parameters $α$ and $β$. For any positive integer $n$, define the Sós permutation $π$ to be the lexicographically first permutation such that $0 \leq f(π(0)) \leq f(π(1)) \leq \cdots \leq f(π(n)) < 1$. In this article we give a bijection between Sós permutations and regions in a partition of the parameter space $(α,β)\in [0,1)^2$. This allows us to enumerate these permutations and to obtain the following &#34;three areas&#34; theorem: in any vertical strip $(a/b,c/d)\times [0,1)$, with $(a/b,c/d)$ a Farey interval, there are at most three distinct areas of regions, and one of these areas is the sum of the other two.

6 nodes5 linksoverview previewSós Permutations
6 nodes5 links
Sós Permutations6 visible / 6 total nodes / 11 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalWSós Permutationspreprint / 2020ASarah Bockting-ConradResearcherAYevgenia KashinaResearcherAT. Kyle PetersenResearcherABridget Eileen TennerResearcherTmath.CO8936 works
PaperSignal 105 links

Sós Permutations

preprint / 2020

Open