Антимонотонные перестановки

The paper is devoted to a class of infinite permutations. One of the properties of these permutations is their avoiding monotone subsequences of elements with numbers forming an arithmetical progression of length 3. We find the complexity of these permutations, their Rauzy graphs, their maximal pattern complexity, their arithmetical complexity with odd differences, and also we find the lower and upper bounds for their arithmetical complexity and show that these bounds are attained.