Algebraic languages and polyominoes enumeration

From MaRDI portal
Publication:1348529

DOI10.1016/0304-3975(84)90116-6zbMath0985.68516OpenAlexW1980486012MaRDI QIDQ1348529

Xavier G. Viennot, Delest, Marie-Pierre

Publication date: 13 May 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90116-6




Related Items (only showing first 100 items - show all)

Geometric properties of matrices induced by pattern avoidanceA consecutive Lehmer code for parabolic quotients of the symmetric groupThe degree of symmetry of lattice pathsIrregular polyomino tiling via integer programming with application in phased array antenna designCounting pairs of noncrossing binary paths: a bijective approachWatermelon uniform random generation with applicationsCombinatorial aspects of \(L\)-convex polyominoesThe generating function of convex polyominoes: The resolution of a \(q\)- differential systemTwo combinatorial statistics on Dyck pathsThe Narayana distributionA bijective proof of a Touchard-Riordan formula``Deco polyominoes, permutations and random generationEnumeration of polyominoes using MacsymaEnumeriation of parallelogram polyominoes with given bond and site perimeterA decomposition of column-convex polyominoes and two vertex statisticsNondecreasing Dyck paths and \(q\)-Fibonacci numbersSmooth column convex polyominoesOn the enumeration of \(k\)-omino towersAsymptotic enumeration of convex polygonsGenerating convex polyominoes at randomCombinatorial theory of \(\text{T}\)-fractions and two points Padé approximantsA method for the enumeration of various classes of column-convex polygonsArea of Catalan paths on a checkerboardEnumeration of various animals on the triangular latticeA new way of counting the column-convex polyominoes by perimeterSelf-avoiding walks, the language of science, and Fibonacci numbersEnumeration of the directed convex polyominoesEnumeration of 4-stack polyominoesSolving multivariate functional equationsCounting \(k\)-convex polyominoesCombinatorics of non-ambiguous treesFrom Tetris to polyominoes generationPeriodic parallelogram polyominoesObject grammars and bijections.Enumeration via ballot numbersStatistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbersCounting problems and algebraic formal power series in noncommuting variablesThe enumeration of prudent polygons by area and its unusual asymptoticsLattice path matroids: Enumerative aspects and Tutte polynomialsSaturated fully leafed tree-like polyforms and polycubesOn the area of square lattice polygons.Automatic average-case analysis of algorithmsOn the tiling system recognizability of various classes of convex polyominoesThe complexity of computing the number of strings of given length in context-free languagesOn computing the degree of convexity of polyominoesPartially directed animals with a bounded number of holesRandom generation of words in an algebraic language in linear binary spaceThe number of convex permutominoesIdentities from weighted Motzkin pathsEmpilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)Attribute grammars are useful for combinatoricsA framework for generating some discrete sets with disjoint components by using uniform distributionsIdentities involving weighted Catalan, Schröder and Motzkin pathsOn the exhaustive generation of \(k\)-convex polyominoesThe number of Z-convex polyominoesIdentities in search of identityContext-free grammars, differential operators and formal power seriesOn an involution on the Dyck pathsEnumeration of Hamiltonian cycles in a squared rectangleAn involution on the Dyck pathsNarayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapesOn the generation of convex polyominoesFamilies of \(m\)-convex polygons: \(m=1\)A benchmark set for the reconstruction of \(hv\)-convex discrete setsThe average height of directed column-convex polyominoes having square, hexagonal and triangular cellsThe number of three-choice polygonsEnumeration of skew Ferrers diagrams and basic Bessel functionsOn pairs of non-crossing generalized Dyck pathsA symmetric variation of a distribution of Kreweras and PoupardCombinatorics of labelled parallelogram polyominoesA bijection for the total area of parallelogram polyominoesSkew Dyck pathsThe number of convex polyominoes and the generating function of Jacobi polynomialsThe perimeter of wordsNoncrossing normal ordering for functions of boson operatorsSymmetric peaks and symmetric valleys in Dyck pathsCritical exponents from nonlinear functional equations for partially directed cluster modelsStacking models of vesicles and compact clustersThe number of directed \(k\)-convex polyominoesParallelogram polyominos with border and Bessel functionsGenerating functions for column-convex polyominoesEnumeration of symmetry classes of convex polyominoes in the square latticeThe number of convex polyominoes with given perimeterOn column-convex and convex Carlitz polyominoesStrip tiling and regular grammarsMaximal superpositions of horizontally convex polyominoesLimits of areas under lattice pathsPairs of noncrossing free Dyck paths and noncrossing partitionsEnumeration of three-dimensional convex polygonsRandom walks in octants, and related structuresSteep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functionsDyck path enumerationConstraint-sensitive Catalan path statistics having the Narayana distributionEnumeration of L-convex polyominoes by rows and columnsAdsorbing staircase walks and staircase polygonsCoding the convex polyominoes and equations for the enumeration according to the areaBasic analytic combinatorics of directed lattice pathsA strip-like tiling algorithm\(q\)-enumeration of convex polyominoesKontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution



Cites Work


This page was built for publication: Algebraic languages and polyominoes enumeration