The 12345–43215 involution-equivalence conjecture

For a pattern τ\tau, let In(τ)\mathcal{I}_{n}(\tau) denote the number of involutions of length nn avoiding τ\tau, and write σIτ\sigma\sim_{\mathcal{I}}\tau when the two patterns have equal avoidance counts for every nn. 12345–43215 equivalence conjecture.

12345I43215.12345\sim_{\mathcal{I}}43215.

The assertion is one of the two pattern equivalences identified as consistent with the tabulated data for patterns of length five. The source gives no proof or later resolution in the supplied material.

Sources & referencesView supporting material

Primary source

Aaron D. Jaggard, “Prefix exchanging and pattern avoidance by involutions”, arXiv:math/0306002 (2004).

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.