ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S(Zn)S(\mathbb{Z}_n) denote the permutations of Zn\mathbb{Z}_n, let [π][\pi] be the coset of a permutation π\pi under cyclic shifts, and let t([π])t([\pi]) be the minimum number of transpositions needed to sort that coset. A permutation π\pi is affine if

π(x)=ax+b\pi(x)=ax+b

for some a∈Zn×a\in\mathbb{Z}_n^{\times} and b∈Znb\in\mathbb{Z}_n. Adin–Alon–Roichman affine-permutation conjecture. If t([π])=n−2t([\pi])=n-2, then nn is prime and π\pi is affine.

The conjecture refines the claim that the upper bound t(n)≤n−2t(n)\leq n-2 can be attained only for prime nn. The paper gives counterexamples to its affine conclusion, so the conjecture is refuted, although the composite-order part remains a separate open problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.