2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2009★ 1 cited
Infinite permutations of lowest maximal pattern complexity
S. V. Avgustinovich, A. E. Frid, T. Kamae +1
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…
math.CO2009
On the number of factors in codings of three interval exchange
Petr Ambrož, Anna Frid, Zuzana Masáková +1
We consider exchange of three intervals with permutation . The aim of this paper is to count the cardinality of the set $3\iet(N)$ of all words of length which appear…