The Cayley-equivalence content conjecture

Let pp and qq be Cayley permutations of the same length. Write pcqp\sim_c q for Cayley-equivalence and pcmqp\sim_{cm}q for Cayley-equivalence with respect to content multiplicities. The Cayley-equivalence content conjecture. If

pcq,p\sim_c q,

then

pcmq.p\sim_{cm}q.

The conjecture is posed as an open problem. The paper identifies p=13442p=13442 and q=14233q=14233 as the smallest candidate for a counterexample and notes that their relevant Cayley-avoidance counts agree through size 99, while a content-multiplicity count already differs at the indicated parameters. No proof or counterexample is supplied.

Sources & referencesView supporting material

Primary source

Anders Claesson, Giulio Cerbai, Dana C. Ernst and Hannah Golab, “Pattern-avoiding Cayley permutations via combinatorial species”, arXiv:2407.19583 (2024).

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.