The Number of Degree-Restricted Rooted Maps on the Sphere
SIAM Journal on Discrete Mathematics
A method for the enumeration of various classes of column-convex polygons
Discrete Mathematics
A new way of counting the column-convex polyominoes by perimeter
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Factors of iterated resultants and discriminants
Journal of Symbolic Computation
Discrete Mathematics
Regular Article: Enumeration of Planar Constellations
Advances in Applied Mathematics
The Umbral transfer-matrix method. I: foundations
Journal of Combinatorial Theory Series A
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Generating functions for generating trees
Discrete Mathematics
A solution to the tennis ball problem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Counting 5-connected planar triangulations
Journal of Graph Theory
Exact solution of two classes of prudent polygons
European Journal of Combinatorics
The kernel method and systems of functional equations with several conditions
Journal of Computational and Applied Mathematics
A bijection for triangulations, quadrangulations, pentagulations, etc.
Journal of Combinatorial Theory Series A
Unified bijections for maps with prescribed degrees and girth
Journal of Combinatorial Theory Series A
European Journal of Combinatorics
Hi-index | 0.00 |
Let F(t, u) = F(u) be a formal power series in t with polynomial coefficients in u. Let F1,...,Fk be k formal power series in t, independent of u. Assume all these series are characterized by a polynomial equation P(F(u), F1,...,Fk,t,u) = 0. We prove that, under a mild hypothesis on the form of this equation, these k + 1 series are algebraic, and we give a strategy to compute a polynomial equation for each of them. This strategy generalizes the so-called kernel method and quadratic method, which apply, respectively, to equations that are linear and quadratic in F(u). Applications include the solution of numerous map enumeration problems, among which the hard-particle model on general planar maps.