On square-free permutations

DOI10.25596/JALC-2011-003MaRDI QIDQ2819395zbMATH OpenFDO

Authors Sergey Kitaev, Alexandr Valyuzhenich, Sergey Avgustinovich, Artem Pyatkin

Publication date 29 September 2016

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.25596/JALC-2011-003

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cited in

(6)

• Variations on twins in permutations
• On five types of crucial permutations with respect to monotone patterns
• The lengths for which bicrucial square-free permutations exist
• Bicrucial k-power-free permutations
• On P-crucial and S-crucial square-free permutations
• Tight multiple twins in permutations

This page was built for publication: On square-free permutations

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