Generating Permutations with k-Differences

DOI10.1137/0403049MaRDI QIDQ5203013zbMATH OpenOpenAlexFDO

Authors Carla D. Savage

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/53620a8f3329922f0f9c50a6356c69364bf6cc31

zbMATH Keywords

generating permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Generation of Permutations Following Lehmer and Howell
• scientific article; zbMATH DE number 3557795
• Finding parity difference by involutions
• Generating permutations with given ups and downs
• Generating permutations of a bag by interchanges

Cited in

(7)

• Generating stable permutations
• Hamilton-connected derangement graphs on \(S_ n\)
• On TDP permutations
• Ordering a set of values of an objective-function argument in combinatorial optimization
• Geometric permutations and two applications
• scientific article; zbMATH DE number 5855074 (Why is no real title available?)
• A remarkable connection between k-permutations and colourings of graphs

This page was built for publication: Generating Permutations with k-Differences

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