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

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)42x3(x1)F(x)3+x(x32x2+4x1)F(x)2(2x22x+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.

The conjecture was formulated from computed initial terms using Pantone's software; the paper reports that Pantone subsequently proved it by calculating the generating function.

Sources & referencesView supporting material

Primary 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.