Rational generating-function conjecture for a non-Hertzsprung mesh pattern

Let pp be the mesh pattern represented by the diagram encoded in the source, and let Sn(p)|\mathcal{S}_n(p)| denote the number of length-nn objects avoiding pp. Rational generating-function conjecture. For this pattern pp,

n0Sn(p)xn=m0m!(x1+x2)m.\sum_{n\geq 0}|\mathcal{S}_n(p)|x^n=\sum_{m\geq 0}m!\left(\frac{x}{1+x^2}\right)^m.

The question arises from a theorem giving this form for Hertzsprung patterns; the source presents this example as evidence that other nontrivial mesh patterns may also have such generating functions. The diagram-specific pattern notation is not defined in the supplied context.

Sources & referencesView supporting material

Primary source

Anders Claesson, “From Hertzsprung's problem to pattern-rewriting systems”, arXiv:2012.15309 (2021).

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.