Monotonicity conjecture for cyclic 321-avoidance growth

For each n1n\geq 1, let cn=Cn(321)c_n=|\mathcal C_n(321)|, where Cn(321)\mathcal C_n(321) is the set of cyclic permutations of size nn avoiding 321321. The monotonicity conjecture. The sequence

cnn\sqrt[n]{c_n}

is monotonically increasing in nn. The paper has already established that its limit exists by supermultiplicativity, while the asserted monotonicity is presented as a stronger unproved result.

Sources & referencesView supporting material

Primary source

Robert P. Laudone, “Characterizing avoidance in cycles via vincular patterns”, arXiv:2505.05651 (2025).

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.