Abstract
The polyominoes' problem defined by two vectors has been proposed by M. Nivat in the course of the seminar held at the Dipartimento di Sistemi e Informatica di Firenze, on September 1992, on the subject Tiling the plane with a horizontal bar h m and a vertical bar v n . It is the problem of establishing the existence of a polyomino with a given number of cells in every column and every row. The problem is solved for the following classes of polyominoes: directed column-convex, directed convex, and parallelogram. The problem is also solved in the class of convex polyominoes in a particular case. Furthermore, it is possible to define an algorithm that controls the existence of a directed column-convex, or directed convex, or parallelogram polyomino, with a given number of cells in every column and in every row.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
