← All problems

Pantone's algebraicity conjecture for inversion sequences avoiding 000 and 102

1 year old · documented by

Let I(000,102)\mathcal{I}(000,102) be the class of inversion sequences avoiding the patterns 000000 and 102102, and let F(x)F(x) be its ordinary generating function. Pantone's algebraicity conjecture. The generating function FF is algebraic, with minimal polynomial

x4F(x)4−2x3(x−1)F(x)3+x(x3−2x2+4x−1)F(x)2−(2x2−2x+1)F(x)+1.x^4 F(x)^4-2x^3(x-1)F(x)^3+x(x^3-2x^2+4x-1)F(x)^2-(2x^2-2x+1)F(x)+1.
References

Status

  • Solved: Benjamin Testart. Completing the enumeration of inversion sequences avoiding one or two patterns of length 3 (arXiv, 2024) https://arxiv.org/abs/2407.07701

Source: Benjamin Testart, “Completing the enumeration of inversion sequences avoiding one or two patterns of length 3”, arXiv:2407.07701 (2025).

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.