Transposition generation of alternating permutations

DOI10.1007/BF00563523zbMATH Open0731.05002MaRDI QIDQ807622FDOQ807622

Frank Ruskey

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Recommendations

• Generating alternating permutations lexicographically
• A survey of alternating permutations
• A Note on Alternating Permutations
• Counting permutations by their alternating runs
• Generating permutations with given ups and downs

zbMATH Keywords

Euler numberstranspositionAlternating permutations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Generation of Permutations by Adjacent Transposition
• A structured program to generate all topological sorting arrangements
• Adjacent interchange generation of combinations
• On the generation of all topological sortings
• Computation of Tangent, Euler, and Bernoulli Numbers
• Title not available (Why is that?)

Cited In (9)

• Sign imbalances of snakes and valley-signed permutations
• Gray codes for signed involutions
• Generating alternating permutations lexicographically
• Title not available (Why is that?)
• A generalized permutahedron
• Generating linear extensions of posets by transpositions
• Generating permutations with given ups and downs
• Using the Entringer numbers to count the alternating permutations according a new parameter
• Parity alternating permutations starting with an odd integer

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

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