Combinatorics of diagonally convex directed polyominoes (Q1924364)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Combinatorics of diagonally convex directed polyominoes
scientific article

    Statements

    Combinatorics of diagonally convex directed polyominoes (English)
    0 references
    0 references
    0 references
    27 November 1996
    0 references
    The authors consider the problem of finding a generating function for diagonally convex directed (dcd) polyominoes. These are first defined and shown to be in correspondence (not (1-1)) with lattice paths wholly below the line \(y={1\over 2} x\) and also with ternary trees, to which ``1-source'' polyominoes are shown to be in 1-1 correspondence. The main result of the paper is to extend the enumeration by perimeter of dcd polyominoes to the multisource case. The formula is confined by another method, and a start is made on the problem of finding a ``\(q\)-enumeration'' generating function, enumeration by perimeter and area. This is accomplished for ``1-source'' polyominoes, but the general case is deferred to a further paper. Reviewer's note: This is one of the most skilful uses of generating functions and transformations I have ever seen. It is comparable with MacMahon's classic work.
    0 references
    generating function
    0 references
    diagonally convex directed (dcd) polyominoes
    0 references
    lattice paths
    0 references

    Identifiers