On the number of certain lattice polygons

From MaRDI portal
Publication:4091943

DOI10.1016/S0021-9800(69)80113-4zbMath0327.05010MaRDI QIDQ4091943

George Pólya

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)




Related Items

Hook differences and lattice pathsThree recurrences for parallelogram polyominoesGeneralized Euler and Chu-Vandermonde identitiesThe degree of symmetry of lattice pathsCombinatorial objects enumerated by \(q\)-Bessel functionsTwo combinatorial statistics on Dyck pathsAlgebraic languages and polyominoes enumerationOrdered trees and non-crossing partitionsEnumeriation of parallelogram polyominoes with given bond and site perimeterExact scaling behavior of partially convex vesiclesA \(q\)-enumeration of convex polyominoes by the festoon approachGenerating convex polyominoes at randomA new way of counting the column-convex polyominoes by perimeterEnumeration of the directed convex polyominoesExhaustive generation of gominoesSolving multivariate functional equationsLinear recurrences under side conditionsMeasuring symmetry in lattice paths and partitionsA generalized q-multinomial Vandermonde convolutionOn the \(q\)-analogue of Pólya's theoremThe perimeter generating function for nondirected diagonally convex polyominoesUnnamed ItemOn the area of square lattice polygons.Enumeration of skew Ferrers diagramsOn the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice pathsGENERATING FUNCTIONS FOR THE NUMBERS OF PYRAMID AND STAIRCASE POLYHEDRADeux propriétés combinatoires des nombres de SchröderAttribute grammars are useful for combinatoricsBasic series identities and combinatoricsOn an involution on the Dyck pathsAn involution on the Dyck pathsFamilies of \(m\)-convex polygons: \(m=1\)Enumeration of skew Ferrers diagrams and basic Bessel functionsOn pairs of non-crossing generalized Dyck pathsA bijection for the total area of parallelogram polyominoesAsymptotic bounds for the number of convex \(n\)-ominoesOn three and four vicious walkersUnnamed ItemOn the recursion depth of special tree traversal algorithmsA probabilistic interpretation of the Gaussian binomial coefficientsSkew diagrams and ordered treesUnnamed ItemOn coherent sheaves of small length on the affine planeECO:a methodology for the enumeration of combinatorial objectsGenerating functions for column-convex polyominoesEnumeration of symmetry classes of convex polyominoes in the square latticeExact solutions of lattice polymer modelsExactly Solved ModelsThe combinatorial analysis of patterns and the principle of inclusion- exclusionEnumeration of three-dimensional convex polygonsSteep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functionsElementary divisors and determinants of random matrices over a local field.q-Catalan numbers