LEGO configuration counts grow exponentially with tile number n, conjectured as A(w) mu(w)^n / n for 2D and A mu^n / n^{3/2} for 3D with mu approximately 117.25, while fixed-n counts in width w are proven to be polynomials of degree n-1.
Enting and Iwan Jensen,Exact Enumerations, Polygons, Polyominoes and Polycubes, ed
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Counting LEGO configurations
LEGO configuration counts grow exponentially with tile number n, conjectured as A(w) mu(w)^n / n for 2D and A mu^n / n^{3/2} for 3D with mu approximately 117.25, while fixed-n counts in width w are proven to be polynomials of degree n-1.