The generating function of convex polyominoes: The resolution of a \(q\)- differential system (Q1343776)

From MaRDI portal
Revision as of 02:47, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dm/Bousquet-MelouF95, #quickstatements; #temporary_batch_1731547958265)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The generating function of convex polyominoes: The resolution of a \(q\)- differential system
scientific article

    Statements

    The generating function of convex polyominoes: The resolution of a \(q\)- differential system (English)
    0 references
    12 March 1995
    0 references
    The authors obtain a closed formula for the generating function \(Z(x, y,q)\) of convex polygons, according to the height, width and area, by solving a system of \(q\)-algebraic equations that defines \(Z(x, y,q)\). The method of resolution of this system is a kind of \(q\)-analogue of the method used for solving linear systems of differential equations. The result is expressed in terms of certain \(q\)-series of the following form: \[ \sum_{n\geq 0} x^ n f_ n(y, q), \] where \(f_ n(y,q)\) is an explicit rational function in \(y\) and \(q\). The formula thus obtained is, up to now, the ``nicest'' formula known for \(Z(x,y,q)\). Note that it has been reobtained later on by a different and simpler method; see the first author [A method for the enumeration of various classes of column-convex polygons, to appear in Discrete Math.].
    0 references
    generating function
    0 references
    convex polygons
    0 references
    \(q\)-algebraic equations
    0 references
    \(q\)-series
    0 references
    0 references

    Identifiers