On infinite permutations

zbMATH Open1192.05002MaRDI QIDQ3576702FDOQ3576702

Authors: Dmitry G. Fon-Der-Flaass, Anna Frid 

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0153/0.html

Recommendations

• On periodicity and low complexity of infinite permutations
• Infinite permutations of lowest maximal pattern complexity
• Ergodic infinite permutations of minimal complexity
• On automatic infinite permutations
• Ergodic infinite permutations of minimal complexity

zbMATH Keywords

complexityorderingperiodicitySturmian wordssubword complexityinfinite permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (13)

• An infinite antichain of permutations
• On automatic infinite permutations
• Orbit theory, locally finite permutations and Morse arithmetic
• Infinite Combinatorics
• On the infinite permutation generated by the period doubling word
• On an infinite permutation similar to the Thue-Morse word
• On periodicity and low complexity of infinite permutations
• Title not available (Why is that?)
• Homogeneous permutations
• On permutations generated by infinite binary words
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite permutations of lowest maximal pattern complexity

This page was built for publication: On infinite permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576702)