The umbral transfer-matrix method. I: Foundations
From MaRDI portal
Publication:1584666
DOI10.1006/jcta.2000.3110zbMath0961.05003OpenAlexW2056111563MaRDI QIDQ1584666
Publication date: 28 May 2001
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2000.3110
Related Items
Counting coloured planar maps: differential equations ⋮ Smooth column convex polyominoes ⋮ Fast Algorithms for Discrete Differential Equations ⋮ Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers ⋮ The site-perimeter of bargraphs ⋮ Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees ⋮ Using Rota's Umbral calculus to enumerate Stanley's \(P\)-partitions ⋮ Universal singular exponents in catalytic variable equations ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ Babson-Steingrímsson statistics are indeed Mahonian (and sometimes even Euler-Mahonian) ⋮ Locally restricted compositions over a finite group ⋮ The umbral transfer-matrix method. I: Foundations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The umbral calculus
- Formal power series of logarithmic type
- The umbral transfer-matrix method. I: Foundations
- The invariant theory of binary forms
- Automated counting of lego towers
- The Number of Partitions of a Set
- The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks
- The umbral transfer-matrix method. III: Counting animals
This page was built for publication: The umbral transfer-matrix method. I: Foundations
