Cycle conjecture for exact skew-symmetric permutations

About 11 years old · traced to

Let p=(s~,π)\mathfrak{p}=(\tilde{s},\pi) be exact and skew-symmetric on [n]∗∪[n]−[n]^*\cup[n]^{-}, with Dp=pr−1D_{\mathfrak{p}}=p_r^{-1}, and suppose that

π(si−1)=s2n+1−i,1≤i≤n.\pi(s_{i-1})=s_{2n+1-i},\qquad 1\leq i\leq n.

Cycle conjecture. The elements nn and sns_n are in the same cycle of π\pi.

This conjecture is introduced to provide a 22-reversal in the critical case arising in the analysis of sorting signed permutations. The paper presents examples supporting it, but does not establish the claim; a broader version is stated later without the exactness assumption.

References

Primary source

Ricky X. F. Chen and Christian M. Reidys, “A simple framework on sorting permutations”, arXiv:1502.07971 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.