Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Infinite permutations of lowest maximal pattern complexity   An infinite permutation is a linear ordering of the set of non-negative
integers. Generally, the properties of infinite permutations analogous to those
of infinite words show some resemblances and some differences between
permutations and words. In this paper, we define maximal pattern complexity for
infinite permutations and show that this complexity function is ultimately
constant if and only if the permutation is ultimately periodic. Then we
characterize the non-periodic permutations of minimal complexity (equal to n)
and find that they all are constructed with the use of Sturmian words.

15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas