Polynomial equations with one catalytic variable, algebraic series and map enumeration
From MaRDI portal
Publication:2498737
DOI10.1016/j.jctb.2005.12.003zbMath1099.05043arXivmath/0504018OpenAlexW2083916911MaRDI QIDQ2498737
Mireille Bousquet-Mélou, Arnaud Jehanne
Publication date: 16 August 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0504018
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Counting coloured planar maps: differential equations, Enumeration of \(r\)-regular maps on the torus. I: Rooted maps on the torus, the projective plane and the Klein bottle. Sensed maps on the torus, Counting quadrant walks via Tutte's invariant method, Generating functions of bipartite maps on orientable surfaces, Counting coloured planar maps, An elementary solution of Gessel's walks in the quadrant, Asymptotic Distribution of Parameters in Random Maps, On the number of planar Eulerian orientations, Blossoming bijection for bipartite pointed maps and parametric rationality of general maps of any surface, Counting gluings of octahedra, The vectorial kernel method for walks with longer steps, The kernel method and systems of functional equations with several conditions, Solving multivariate functional equations, Bijections between planar maps and planar linear normal \(\lambda\)-terms with connectivity condition, Fast Algorithms for Discrete Differential Equations, Unnamed Item, Unnamed Item, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, A simple formula for the series of constellations and quasi-constellations with boundaries, Staircases, dominoes, and the growth rate of 1324-avoiders, Universal asymptotic properties of positive functional equations with one catalytic variable, Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022, Parking on the infinite binary tree, Stack-sortable permutations and beyond, Fighting fish, Is the full susceptibility of the square-lattice Ising model a differentially algebraic function?, Random cubic planar maps, Unified bijections for maps with prescribed degrees and girth, Formulae and Asymptotics for Coefficients of Algebraic Functions, The representation of the symmetric group on \(m\)-Tamari intervals, Une note sur les intervalles de Tamari, A bijection between Tamari intervals and extended fighting fish, Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons, A bijection for triangulations, quadrangulations, pentagulations, etc., An analogue of the Harer-Zagier formula for unicellular maps on general surfaces, A Boltzmann Approach to Percolation on Random Triangulations, Enumeration of unrooted odd-valent regular planar maps, Local convergence of large random triangulations coupled with an Ising model, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Planar maps and continued fractions, A generic method for bijections between blossoming trees and planar maps, Universal singular exponents in catalytic variable equations, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Critical Ising model on random triangulations of the disk: enumeration and local limits, Some properties of a new partial order on Dyck paths, Fighting fish: enumerative properties, Generating permutations with restricted containers, Exact solution of two classes of prudent polygons, Counting quadrant walks via Tutte's invariant method (extended abstract), Counting colored planar maps: algebraicity results, Asymptotics of 3-stack-sortable permutations, Counting walks with large steps in an orthant, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Square lattice walks avoiding a quadrant, Enumeration of planar constellations with an alternating boundary, Counting 3-stack-sortable permutations, A partial order on Motzkin paths, Inhomogeneous restricted lattice walks, Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth, Quarter-plane lattice paths with interacting boundaries: the Kreweras and reverse Kreweras models, Enumeration of rooted 3-connected bipartite planar maps, Troupes, cumulants, and stack-sorting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Census of planar maps: From the one-matrix model solution to a combinatorial proof
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- Factors of iterated resultants and discriminants
- Generating functions for generating trees
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- A new way of counting the column-convex polyominoes by perimeter
- Multi-static enumeration of two-stack sortable permutations
- Enumeration of planar constellations
- The umbral transfer-matrix method. I: Foundations
- Linear recurrences with constant coefficients: The multivariate case
- Basic analytic combinatorics of directed lattice paths
- The kernel method: a collection of examples
- Combinatorics of hard particles on planar graphs
- Chromatic sums revisited
- A method for the enumeration of various classes of column-convex polygons
- Noncrossing partitions
- On the existence of square roots in certain rings of power series
- Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
- A solution to the tennis ball problem
- Counting 5-connected planar triangulations
- Planar Maps are Well Labeled Trees
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- A Census of Planar Triangulations
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- The Number of Degree-Restricted Rooted Maps on the Sphere
- Counting Walks in the Quarter Plane
- Critical and tricritical hard objects on bicolourable random lattices: exact solutions
- Combinatorics of bicubic maps with hard particles
- Chromatic Sums for Rooted Planar Triangulations, V: Special Equations
- Enumeration of Triangulations of the Disk
- Enumeration of Quadrangular Dissections of the Disk
- On the enumeration of planar maps
- Enumeration of Non-Separable Planar Maps
- On the Enumeration of Rooted Non-Separable Planar Maps
- Algorithms in real algebraic geometry