Algorithms for combinatorial structures: well-founded systems and Newton iterations
From MaRDI portal
Publication:444909
DOI10.1016/j.jcta.2012.05.007zbMath1246.05012arXiv1109.2688MaRDI QIDQ444909
Michèle Soria, Carine Pivoteau, Bruno Salvy
Publication date: 24 August 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2688
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
34A05: Explicit solutions, first integrals of ordinary differential equations
Related Items
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations, Formulae and Asymptotics for Coefficients of Algebraic Functions, Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers, Exact-Size Sampling of Enriched Trees in Linear Time, Simplifications of Uniform Expressions Specified by Systems, Free integro-differential algebras and Gröbner-Shirshov bases., An algorithm computing combinatorial specifications of permutation classes, Counting and generating permutations in regular classes, Convergence of Newton's method over commutative semirings, On the number of unary-binary tree-like structures with restrictions on the unary height, A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space, Statistical properties of lambda terms, On the number of planar Eulerian orientations, Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation
Cites Work
- Dérivées directionnelles et développements de Taylor combinatoires. (Directional derivatives and combinatorial Taylor expansions)
- Une approche combinatoire pour l'itération de Newton-Raphson
- Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles. (Combinatorial bloomings applied to the multidimensional inversion of formal series)
- Une combinatoire sous-jacente au théorème des fonctions implicites. (Combinatorics underlying the implicit functions theorem)
- On combinatorial differential equations
- Une théorie combinatoire des séries formelles
- On asymmetric structures
- Counting asymmetric enriched trees
- A calculus for the random generation of labelled combinatorial structures
- Relax, but don't be too lazy
- Fast Algorithms for Manipulating Formal Power Series
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Boltzmann Sampling of Unlabelled Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item