Polyominoes defined by two vectors (Q1325843): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90107-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2159400964 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3975036 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The undecidability of the domino problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3735714 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tiling with sets of polyominoes / rank | |||
Normal rank |
Latest revision as of 15:51, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polyominoes defined by two vectors |
scientific article |
Statements
Polyominoes defined by two vectors (English)
0 references
22 June 1994
0 references
A polyomino \(\Lambda\) is a finite union of squares (cells) in the square tiling of the plane such that the interior is connected. A column or row of \(\Lambda\) is the intersection of \(\Lambda\) with an infinite vertical or horizontal strip of squares in the tiling. The problem is to characterize all integral vectors \(A=(a_ 1,\ldots,a_ n)\) and \(B=(b_ 1,\ldots,b_ m)\) such that, within a given class of polyominoes, there is a polyomino \(\Lambda\) with \(n\) columns and \(m\) rows such that \(a_ i\) and \(b_ j\) are the numbers of cells in the \(i\)-th column and \(j\)-th row respectively. The author solves the characterization problem for the following classes of polyominoes: directed column-convex, directed convex, and parallelogram. Also, for each of these classes an algorithm is defined which controls the existence of a polyomino for given vectors \(A\) and \(B\).
0 references
cells
0 references
polyomino
0 references
square tiling
0 references
integral vectors
0 references
characterization
0 references
parallelogram
0 references