Solving the Sigma-Tau Problem

DOI10.1145/3359589zbMath1458.05108OpenAlexW2987306417WikidataQ126788855 ScholiaQ126788855MaRDI QIDQ4973059

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) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Star transposition Gray codes for multiset permutations ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Sparse Kneser graphs are Hamiltonian

This page was built for publication: Solving the Sigma-Tau Problem