Pages that link to "Item:Q5676239"
From MaRDI portal
The following pages link to A Procedure for Improving the Upper Bound for the Number of <i>n</i>-Ominoes (Q5676239):
Displaying 46 items.
- Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region (Q281197) (← links)
- An improved upper bound on the growth constant of polyominoes (Q322215) (← links)
- Exhaustive generation of gominoes (Q391401) (← links)
- Counting \(k\)-convex polyominoes (Q396773) (← links)
- Formulae and growth rates of high-dimensional polycubes (Q555508) (← links)
- Counting polyominoes: yet another attack (Q1155065) (← links)
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes) (Q1193571) (← links)
- Several constants arising in statistical mechanics (Q1306604) (← links)
- Coding the convex polyominoes and equations for the enumeration according to the area (Q1314326) (← links)
- \(q\)-enumeration of convex polyominoes (Q1318368) (← links)
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system (Q1343776) (← links)
- New enumerative results on two-dimensional directed animals (Q1381815) (← links)
- Enumerating polyominoes with fixed perimeter defect (Q1689885) (← links)
- Saturated fully leafed tree-like polyforms and polycubes (Q1711661) (← links)
- On the number of hexagonal polyominoes (Q1885027) (← links)
- A method for the enumeration of various classes of column-convex polygons (Q1918535) (← links)
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 (Q1945952) (← links)
- Automatic generation of formulae for polyominoes with a fixed perimeter defect (Q2088891) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- Concatenation arguments and their applications to polyominoes and polycubes (Q2230414) (← links)
- Asymptotic bounds for the number of convex \(n\)-ominoes (Q2264682) (← links)
- Counting \(n\)-cell polycubes proper in \(n - k\) dimensions (Q2357227) (← links)
- Small polyomino packing (Q2361496) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- On the enumeration of \(k\)-omino towers (Q2400563) (← links)
- On the number of planar Eulerian orientations (Q2400972) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- The growth rate of high-dimensional tree polycubes (Q2509733) (← links)
- On the entropy of \(\mathsf{LEGO}^{\circledR}\) (Q2511468) (← links)
- Image denoising by statistical area thresholding (Q2573029) (← links)
- Barrier Coverage (Q2830235) (← links)
- Formulae and Growth Rates of High-Dimensional Polycubes (Q2851503) (← links)
- (Q2857314) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- On the Exact Complexity of Polyomino Packing (Q3305727) (← links)
- λ > 4 (Q3452770) (← links)
- Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères (Q4012669) (← links)
- (Q4571826) (← links)
- The LEGO Counting Problem (Q4576116) (← links)
- (Q5088997) (← links)
- (Q5210579) (← links)
- (Q5239738) (← links)
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES (Q5322313) (← links)
- Improved upper bounds on the growth constants of polyominoes and polycubes (Q5970780) (← links)
- An improved lower bound on the growth constant of polyiamonds (Q5971174) (← links)
- Loops and regions in Hitomezashi patterns (Q6080150) (← links)
