Geodesic
On infinite permutations
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an infinite number of distinct $t$-periodic permutations. At last, we introduce a complexity notion for permutations analogous to subword complexity for words, and consider the problem of minimal complexity of non-periodic permutations. Its answer is different for the right infinite and the bi-infinite case. 
@article{DMTCS_2005_special_250_a67,
     author = {Fon-Der-Flaass, Dmitri G. and Frid, Anna E.},
     title = {On infinite permutations},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3458},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3458/}
}
TY  - JOUR
AU  - Fon-Der-Flaass, Dmitri G.
AU  - Frid, Anna E.
TI  - On infinite permutations
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3458/
DO  - 10.46298/dmtcs.3458
LA  - en
ID  - DMTCS_2005_special_250_a67
ER  - 
%0 Journal Article
%A Fon-Der-Flaass, Dmitri G.
%A Frid, Anna E.
%T On infinite permutations
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3458/
%R 10.46298/dmtcs.3458
%G en
%F DMTCS_2005_special_250_a67
Fon-Der-Flaass, Dmitri G.; Frid, Anna E. On infinite permutations. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3458. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3458/

Cité par Sources :