Prefix-exchange conjecture for increasing and decreasing patterns

From papers

Let σ\sigma and τ\tau be patterns, and write σIτ\sigma\sim_{\mathcal{I}}\tau when they are equinumerous for avoidance by involutions, meaning that In(σ)=In(τ)\mathcal{I}_{n}(\sigma)=\mathcal{I}_{n}(\tau) for every nn. A prefix is an initial consecutive pattern such as 12k12\ldots k or k21k\ldots21. Prefix-exchange conjecture. For every kk, the prefixes 12k12\ldots k and k21k\ldots21 may be exchanged; equivalently,

12kIk21.12\ldots k\sim_{\mathcal{I}}k\ldots21.

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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.