A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Minimal complexity of equidistributed infinite permutations
[article]
2016
arXiv
pre-print
An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class of equidistributed infinite permutations, that is, infinite permutations which can be defined by equidistributed sequences. Similarly to infinite words, a complexity p(n) of an infinite permutation is defined as a function counting the number of its
arXiv:1503.06188v3
fatcat:sbhvzgiesfdjljasg572owfodu