Thread View: gwene.acm.algorithms.transactions
1 messages
1 total messages
Started by unknown
Fri, 15 Nov 2019 01:00
Solving the Sigma-Tau Problem
Author: unknown
Date: Fri, 15 Nov 2019 01:00
Date: Fri, 15 Nov 2019 01:00
1 lines
649 bytes
649 bytes
Joe Sawada, Aaron Williams<br /><br />Knuth assigned the following open problem a difficulty rating of 48/50 in The Art of Computer Programming Volume 4A: For odd n โฅ 3, can the permutations of { 1,2,โฆ , n} be ordered in a cyclic list so that each permutation is transformed into the next by applying either the operation ฯ, a rotation to the left, or ฯ, a transposition of the first two symbols? The Sigma-Tau problem is equivalent to finding a Hamilton cycle in the directed Cayley graph generated by ฯ = (1 2 แนก n) and ฯ = (1 2).
<p><a href="http://dl.acm.org/citation.cfm?id359589">Link</a>
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads