n-集的(n-1)-置换的显泛圈
An explicit universal cycle for the (n-1)-permutations of an n-set
摘要:
给出了在有向Cayley图Cay({σ_n,sigma_{n-1} }:\mathbb{S}_n)中构造显式Hamilton圈的方法,其中σ_k =(1 2 >. k)。Jackson(离散数学,149(1996)123-129)证明了这种循环的存在,但证明仅表明某个有向图是欧拉图,而Knuth(第4卷分册2,生成所有元组和排列(2005))要求明确的构造。我们表明,一个简单的递归描述我们的汉密尔顿周期和周期可以产生的迭代算法,使用O(n)空间。此外,该算法在恒定时间内产生周期的每个连续边沿;这种算法被称为无环算法。
英文摘要:
We show how to construct an explicit Hamilton cycle in the directed Cayley graph Cay({σ_n, sigma_{n-1}} : \mathbb{S}_n), where σ_k = (1 2 >... k). The existence of such cycles was shown by Jackson (Discrete Mathematics, 149 (1996) 123-129) but the proof only shows that a certain directed graph is Eulerian, and Knuth (Volume 4 Fascicle 2, Generating All Tuples and Permutations (2005)) asks for an explicit construction. We show that a simple recursion describes our Hamilton cycle and that the cycle can be generated by an iterative algorithm that uses O(n) space. Moreover, the algorithm produces each successive edge of the cycle in constant time; such algorithms are said to be loopless.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。