Corpus ID: 2833587

The number of $k$-parallelogram polyominoes

@article{Battaglino2013TheNO,
  title={The number of \$k\$-parallelogram polyominoes},
  author={Daniela Battaglino and J. Fedou and S. Rinaldi and S. Socci},
  journal={Discrete Mathematics \& Theoretical Computer Science},
  year={2013},
  pages={1113-1124}
}
A convex polyomino is $k$-$\textit{convex}$ if every pair of its cells can be connected by means of a $\textit{monotone path}$, internal to the polyomino, and having at most $k$ changes of direction. The number $k$-convex polyominoes of given semi-perimeter has been determined only for small values of $k$, precisely $k=1,2$. In this paper we consider the problem of enumerating a subclass of $k$-convex polyominoes, precisely the $k$-$\textit{convex parallelogram polyominoes}$ (briefly, $k… Expand

Figures from this paper

On the exhaustive generation of k-convex polyominoes
The number of directed k-convex polyominoes

References

SHOWING 1-10 OF 13 REFERENCES
Combinatorial aspects of L-convex polyominoes
The number of Z-convex polyominoes
Enumeration of L-convex polyominoes by rows and columns
Ordering and Convex Polyominoes
A Tomographical Characterization of L-Convex Polyominoes
A method for the enumeration of various classes of column-convex polygons
THE AVERAGE HEIGHT OF PLANTED PLANE TREES
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
Enumerative combinatorics
...
1
2
...