Generating indecomposable permutations

DOI10.1016/j.disc.2006.01.005zbMath1086.05004OpenAlexW2081993715MaRDI QIDQ2368923

Andrew D. King

Publication date: 28 April 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.005

zbMATH Keywords

Gray codeCAT algorithmcombinatorial generation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Related Items (7)

Toppling on permutations with an extra chip ⋮ Regenerative random permutations of integers ⋮ On full differential uniformity of permutations on the ring of integers modulo \(n\) ⋮ Enumeration by kernel positions for strongly Bernoulli type truncation games on words ⋮ Cardinality of Rauzy classes ⋮ On pattern avoiding indecomposable permutations ⋮ Discretization of prime counting functions, convexity and the Riemann hypothesis

Cites Work

• Generation of Permutations by Adjacent Transposition
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating indecomposable permutations