PreprintarXiv licencearXiv
Efficient counting of 2 x 4 LEGO brick buildings
Abstract
We outline the algorithmic advances behind our recent computation of the number 8364925094730088313 of ways to combine eleven 2 x 4 LEGO bricks.
Related
- Fourfold Is Enough: Connected LEGO Models from One Brick Type
- A cubulation of the associahedron using a torus-equivariant degeneration of the brick variety
- Another Brick in the Wall: A Computationally Assisted Proof of an Improved Upper Bound for Thrackles
- Finiteness and growth of brick chain filtrations
- A Proof of the Second brick-Brauer-Thrall Conjecture for E-infinite algebras
BibTeX
@misc{eilers2026efficient,
title = {{Efficient counting of 2 x 4 LEGO brick buildings}},
author = {Søren Eilers},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.06986},
eprint = {2611.06986},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.06986},
}
RIS
TY - UNPB
TI - Efficient counting of 2 x 4 LEGO brick buildings
AU - Søren Eilers
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.06986
UR - https://arxiv.org/abs/2611.06986
AB - We outline the algorithmic advances behind our recent computation of the number 8364925094730088313 of ways to combine eleven 2 x 4 LEGO bricks.
ER -