Atkinson's conjecture on the density of simple permutations

About 12 years old · traced to

Let C\mathcal{C} be a proper permutation class, and let Si⁡n(C)\operatorname{Si}_n(\mathcal{C}) be the set of simple permutations in C\mathcal{C} of length nn. Let Cn\mathcal{C}_n be the set of permutations in C\mathcal{C} of length nn.

Atkinson's conjecture.

∣Si⁡n(C)∣∣Cn∣⟶0as n⟶∞.\frac{|\operatorname{Si}_n(\mathcal{C})|}{|\mathcal{C}_n|}\longrightarrow 0\qquad\text{as }n\longrightarrow\infty.

The source attributes this conjecture to Atkinson and gives no resolution.

References

Primary source

Vincent Vatter, “Permutation classes”, arXiv:1409.5159 (2015).

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.