Reflection-symmetry conjecture for LEGO counting polynomials

For each positive integer nn, let pn(w)p_n(w) be the polynomial counting the LEGO structures made from nn parallel w×1w\times1 tiles. Reflection-symmetry conjecture. For every nNn\in\mathbb{N},

pn(1w)=(1)n1pn(w).p_n(1-w)=(-1)^{n-1}p_n(w).

The symmetry would explain the alternating-sum identity for the polynomial coefficients observed in the enumerated data. It is presented as an observation in a conjecture environment and is not proved in the supplied text.

Sources & referencesView supporting material

Primary source

Alexander Gunning, Anthony J Guttmann and Rasmus M Nilsson, “Counting LEGO configurations”, arXiv:2605.07380 (2026).

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.