Generating Permutations with k-Differences

DOI10.1137/0403049zbMATH Open0726.05009OpenAlexW2056080077MaRDI QIDQ5203013FDOQ5203013

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

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

zbMATH Keywords

generating permutations

Mathematics Subject Classification ID

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

Cited In (7)

• On TDP permutations
• Geometric permutations and two applications
• Generating stable permutations
• A remarkable connection between \(k\)-permutations and colourings of graphs
• Hamilton-connected derangement graphs on \(S_ n\)
• Title not available (Why is that?)
• Ordering a set of values of an objective-function argument in combinatorial optimization

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)