\(Q\)-grammars and wall polyominoes (Q1306603): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A method for the enumeration of various classes of column-convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute grammars are useful for combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeriation of parallelogram polyominoes with given bond and site perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new way of counting the column-convex polyominoes by perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of linear probing hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brownian excursion area: A numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kac's formula, levy's local time and brownian excursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical exponents from nonlinear functional equations for partially directed cluster models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules / rank
 
Normal rank

Revision as of 08:32, 29 May 2024

scientific article
Language Label Description Also known as
English
\(Q\)-grammars and wall polyominoes
scientific article

    Statements

    \(Q\)-grammars and wall polyominoes (English)
    0 references
    0 references
    5 October 1999
    0 references
    A wall polyomino (or bar-graph polygon or solid-on-solid walk) is defined as a vertically convex polyomino in which all columns have their lowest cell at the same level. The upper path of such a polyomino can be bijectively coded with words using letters \(x\), \(y\), \(\overline y\) (corresponding to east, north and south steps). The language of nonempty words coding such polyominoes is algebraic and is generated by an unambiguous grammar. A slightly different grammar corresponds to coding directed positive words. The grammars lead to functional equations for generating functions for the polyominoes. The form of these equations, and some simple singularity computations, are used to prove that the area of wall polyominoes of perimeter \(2n\) has the Airy distribution as a limit law.
    0 references
    asymptotic enumeration
    0 references
    polyomino
    0 references
    words
    0 references
    coding
    0 references
    grammar
    0 references
    generating functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references