The 12345–43215 involution-equivalence conjecture
The 12345–43215 involution-equivalence conjecture
For a pattern , let denote the number of involutions of length avoiding , and write when the two patterns have equal avoidance counts for every . 12345–43215 equivalence conjecture.
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
Sign in to submit a solution.
No solutions have been posted yet.