On the Asymptotic Enumeration of LEGO Structures

DOI10.1080/10586458.2011.564539zbMath1262.05006OpenAlexW2016718258MaRDI QIDQ4915379

Mikkel Abrahamsen, Søren Eilers

Publication date: 10 April 2013

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1317924406

zbMATH Keywords

Monte Carlo methodsasymptotic enumerationLEGO

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

The LEGO Counting Problem ⋮ On the entropy of \(\mathsf{LEGO}^{\circledR}\)

Cites Work

• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.

This page was built for publication: On the Asymptotic Enumeration of LEGO Structures