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.… Expand

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.Expand

An unknown planar discrete set of points A can be inspected by means of a probe P of generic shape that moves around it, and reveals, for each position, the number of its elements as a magnifying glass.Expand

We use the notion of pattern avoidance in order to recognize or describe families of polyominoes defined by means of geometrical constraints or combinatorial properties.Expand

An unknown planar discrete set of points A can be inspected by means of a probe P of generic shape that moves around it, and reveals, for each position, the number of its elements as a magnifying glass.Expand

We study the set Cn, a set of permutations of the elements of the cyclic group Zn, and provide a different algorithm for the proof of Hall's Theore m.Expand