Prefix-exchange conjecture for increasing and decreasing patterns
Let and be patterns, and write when they are equinumerous for avoidance by involutions, meaning that for every . A prefix is an initial consecutive pattern such as or . Prefix-exchange conjecture. For every , the prefixes and may be exchanged; equivalently,
The conjecture extends the known results for short increasing and decreasing prefixes and would explain further pattern equivalences for involutions. Its general case is left open in the source.
References
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.