Q-grammars and wall polyominoes
From MaRDI portal
Publication:1306603
DOI10.1007/BF01608790zbMATH Open0939.05025OpenAlexW2092841585MaRDI QIDQ1306603FDOQ1306603
Authors: Philippe Duchon
Publication date: 5 October 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01608790
Recommendations
Asymptotic enumeration (05A16) Exactly solvable models; Bethe ansatz (82B23) Polyominoes (05B50) Functional equations for complex functions (39B32)
Cites Work
- A method for the enumeration of various classes of column-convex polygons
- On the analysis of linear probing hashing
- Kac's formula, levy's local time and brownian excursion
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- The Brownian excursion area: A numerical analysis
- Title not available (Why is that?)
- Attribute grammars are useful for combinatorics
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Title not available (Why is that?)
- A new way of counting the column-convex polyominoes by perimeter
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
Cited In (24)
- \(Q\)-walls to \(Q\)-balls
- Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons
- Counting water cells in bargraphs of compositions and set partitions
- Counting corners in compositions and set partitions presented as bargraphs
- Circular bargraphs
- Limit distributions and scaling functions
- Protected cells in bargraphs
- Title not available (Why is that?)
- On \(q\)-functional equations and excursion moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Area limit laws for symmetry classes of staircase polygons
- Bargraphs in bargraphs
- The height and width of bargraphs
- Cohomology of noncommutative Hilbert schemes
- The perimeter of 2-compositions
- \(t\)-bargraphs and \(t\)-compositions
- Counting permutations by the number of vertical edges in their bargraphs
- Exact solution of two classes of prudent polygons
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Combinatorial parameters in bargraphs
- Impulse parameter and a new equivalence between 123- and 132-avoiding permutations
- The inner site-perimeter of compositions
- Formulae and asymptotics for coefficients of algebraic functions
This page was built for publication: \(Q\)-grammars and wall polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306603)