Corpus ID: 31133227

Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints. (Énumération de polyominos définis en terme d'évitement de motif ou de contraintes de convexité)

@inproceedings{Battaglino2014EnumerationOP,
  title={Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints. ({\'E}num{\'e}ration de polyominos d{\'e}finis en terme d'{\'e}vitement de motif ou de contraintes de convexit{\'e})},
  author={Daniela Battaglino},
  year={2014}
}
In this thesis, we consider the problem of characterising and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well-known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to… Expand
2 Citations
Binary Pictures with Excluded Patterns
Permutation classes and polyomino classes with excluded submatrices

References

SHOWING 1-10 OF 126 REFERENCES
Enumeration of 4-stack polyominoes
Combinatorial aspects of L-convex polyominoes
Enumeration of L-convex polyominoes by rows and columns
The number of Z-convex polyominoes
Ordering and Convex Polyominoes
Enumeration of three-dimensional convex polygons
Enumeration of convex polyominoes using the ECO method
(2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations
A new way of counting the column-convex polyominoes by perimeter
  • S. Feretic
  • Computer Science, Mathematics
  • Discret. Math.
  • 1998
...
1
2
3
4
5
...