Solving the sigma-tau problem

DOI10.1145/3359589MaRDI QIDQ4973059zbMATH OpenOpenAlexWikidataFDO

Authors Joe Sawada, Aaron Williams

Publication date 2 December 2019

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3359589

zbMATH Keywords

permutationsCayley graphHamilton cyclesuccessor rulesigma-tau problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• scientific article; zbMATH DE number 6850346
• An explicit universal cycle for the (n-1)-permutations of an n-set
• Syntactic view of sigma-tau generation of permutations
• The Number System of the Permutations Generated by Cyclic Shift
• Syntactic view of sigma-tau generation of permutations

Cited in

(14)

• A proof of Simmons' conjecture
• Kneser graphs are Hamiltonian
• On the hardness of Gray code problems for combinatorial objects
• Constructing the first (and coolest) fixed-content universal cycle
• Sparse Kneser graphs are Hamiltonian
• Kneser graphs are Hamiltonian
• The Taub solution again
• The Taub solution again
• Generating all invertible matrices by row operations
• Star transposition Gray codes for multiset permutations
• Generating all invertible matrices by row operations
• Syntactic view of sigma-tau generation of permutations
• Syntactic view of sigma-tau generation of permutations
• Constant time and space updates for the sigma-tau problem

This page was built for publication: Solving the sigma-tau problem

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