Results 81 to 90 of about 2,994 (170)

On Computing the Degree of Convexity of Polyominoes [PDF]

open access: diamond, 2015
Stefano Brocchi   +2 more
openalex   +1 more source

The combinatorics of Motzkin polyominoes

open access: yesDiscrete Applied Mathematics
A word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column contains $w_i$ cells, and all columns are bottom-justified.
Baril, Jean-Luc   +3 more
openaire   +3 more sources

Inversion relations, reciprocity and polyominoes [PDF]

open access: green, 1999
Mireille Bousquet‐Mélou   +3 more
openalex   +2 more sources

Polyomino Convolutions and Tiling Problems

open access: yesJournal of Combinatorial Theory, Series A, 2001
8 pages, 8 figures. To appear in \emph{J. of Combin. Theory Ser. A}
openaire   +2 more sources

Home - About - Disclaimer - Privacy