Transposition generation of alternating permutations

DOI10.1007/BF00563523zbMath0731.05002MaRDI QIDQ807622

Frank Ruskey

Publication date: 1989

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

transpositionEuler numbersAlternating permutations

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Generating linear extensions of posets by transpositions ⋮ A generalized permutahedron ⋮ Sign imbalances of snakes and valley-signed permutations ⋮ Generating permutations with given ups and downs ⋮ Generating alternating permutations lexicographically ⋮ Gray codes for signed involutions

Cites Work

• Unnamed Item
• Unnamed Item
• A structured program to generate all topological sorting arrangements
• On the generation of all topological sortings
• Adjacent interchange generation of combinations
• Computation of Tangent, Euler, and Bernoulli Numbers
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Transposition generation of alternating permutations