置换排序循环置换数的上界
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation
摘要:
我们考虑的问题上界的循环置换排序所需的数量。众所周知,任何置换都可以使用至多$n(n-1)/2$相邻的置换来排序。我们表明,如果我们允许所有相邻的换位,以及换位的元素在位置1与元素在最后一个位置,那么所需的换位的数量是最多$n^2/4$。这回答了Feng,Chitturi和Sudborough(2010)提出的一个开放性问题。
英文摘要:
We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow all adjacent transpositions, as well as the transposition that interchanges the element in position 1 with the element in the last position, then the number of transpositions needed is at most $n^2/4$. This answers an open question posed by Feng, Chitturi and Sudborough (2010).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。