The number of directed k-convex polyominoes

zbMath1335.05037arXiv1501.00872MaRDI QIDQ2803319

Simone Rinaldi, Samanta Socci, Adrien Boussicault

Publication date: 4 May 2016

Full work available at URL: https://arxiv.org/abs/1501.00872

zbMATH Keywords

treegenerating functionpathparallelogram polyominodegree of convexitydirected convex polyomino

Mathematics Subject Classification ID

Trees (05C05) Polytopes and polyhedra (52B99) Polyominoes (05B50)

Related Items (6)

Geometric properties of matrices induced by pattern avoidance ⋮ On the enumeration of \(k\)-omino towers ⋮ A new occurrence of Catalan numbers: cap permutations ⋮ Periodic parallelogram polyominoes ⋮ On the exhaustive generation of \(k\)-convex polyominoes ⋮ The number of directed \(k\)-convex polyominoes

This page was built for publication: The number of directed k-convex polyominoes