Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.07380

Counting LEGO configurations

Alexander Gunning·Anthony J Guttmann·Rasmus M Nilsson
View original source ↗Read source document ↗Export metadata ↓

Abstract

We discuss the problem of counting certain LEGO structures, primarily those comprising parallel $w \times 1$ tiles. These can be combined, as a single LEGO structure, by interlocking the tiles. %Alternatively, if the interlocking condition is relaxed, so that tiles can also be placed end-to-end, a greater number of possible configurations results. We also study the historically earlier problem of counting the number of ways to combine $2 \times 4$ LEGO tiles, which in this case gives a 3-dimensional structure. In all cases the number of configurations is dominated by an exponential growth term, $μ^n$ where $n$ is the number of tiles. We present an algorithm for counting these various LEGO configurations, and use the data to estimate the asymptotics. We analyse the data so generated, and conjecture that, for the two-dimensional structures, the number of possible configurations grows like $A(w)μ(w)^n/n,$ and we give numerical estimates for $A(w)$ and $μ(w)$ for $w < 11,$ while for the three-dimensional structure the number of possible configurations is conjectured to grow like $Aμ^n/n^{3/2},$ where $μ= 117.25 \pm 0.05.$ We also study the sequences that arise when we fix the number of tiles $n,$ and vary the tile size $w.$ We prove that the sequences are polynomials of degree $n-1,$ and we give these explicitly for $n=1 \ldots 14.$

Explore related subjects

math.COmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Gunning, Anthony J Guttmann, Rasmus M Nilsson. 2026-07-30. Counting LEGO configurations. https://arxiv.org/abs/2605.07380

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗