scientific article; zbMATH DE number 1111371
This book gives a comprehensive account of the theory of combinatorial species, introduced by Joyal in 1981. It provides a unified approach to the use of generating functions in enumerating labelled and unlabelled combinatorial structures. Much of the first two chapters is devoted to developing relations between various combinatorial operations on species and corresponding algebraic operations on associated generating functions; the concepts of virtual species and canonical decompositions are introduced to provide a combinatorial interpretation of the difference of two species and the inverse of suitable species with respect to multiplication or composition. The algebra of species is applied in Chapter 3 to solve various types of combinatorial functional equations, especially those associated with tree-like structures; the authors give combinatorial versions of the Lagrange inversion formula, the implicit function theorem, and the Newton-Raphson iterative procedure for constructing species defined by certain functional equations, among other things. Chapter 4 is devoted to the enumeration of unlabelled structures. In particular, two fundamental substitution formulas involving cycle-index series are established and numerious families of unlabelled graphs are enumerated; the asymmetry index series of a species is introduced as a tool in enumerating asymmetric structures. The theory is extended in Chapter 5 to a variant of species to treat problems involving structures that depend on a total order on the underlying set; this gives rise to a combinatorial approach to the solution of certain (systems of) differential equations. There is a vast amount of material in this book. Many applications are given; for example, combinatorial interpretations are given for a number of relations involving various orthogonal polynomials. Many results are presented as exercises. The bibliography contains 340 entries.
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Commutative combinatorial Hopf algebras.
- Coassociative magmatic bialgebras and the Fine numbers.
- Une combinatoire sous-jacente au théorème des fonctions implicites. (Combinatorics underlying the implicit functions theorem)
- Automatic average-case analysis of algorithms
- Möbius species
- The functorial composition of species, a forgotten operation
- Enumeration of symmetry classes of convex polyominoes in the square lattice
- Cubical species and nonassociative algebras
- Renormalization automated by Hopf algebra
- Analytic combinatorics of non-crossing configurations
- A bijective proof of infinite variated Good's inversion
- Analysis of a randomized rendezvous algorithm
- The Specker-Blatter theorem does not hold for quaternary relations
- Object grammars and bijections.
- Generalized binomial coefficients for molecular species
- Generalized rook polynomials
- Enumeration of \(m\)-ary cacti
- Generalised Brownian motion and second quantisation
- Combinatorics of second derivative: graphical proof of Glaisher-Crofton identity
- Binomial species and combinatorial exponentiation
- Random enriched trees with applications to random graphs
- Monops, monoids and operads: the combinatorics of Sheffer polynomials
- Rhombic alternative tableaux and assemblées of permutations
- Periodic parallelogram polyominoes
- The Heisenberg product: from Hopf algebras and species to symmetric functions
- On the shape of random Pólya structures
- Analytic results on the polymerisation random graph model
- Boltzmann samplers for first-order differential specifications
- Matrix method for linear sequential dynamical systems on digraphs
- Services within a busy period of an M/M/1 queue and Dyck paths
- Analytic urns
- Species over a finite field
- Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams
- Algorithms for sequential generation of combinatorial structures
- Labelled and unlabelled enumeration of k-gonal 2-trees
- The operator of inversion as an everywhere continuous nowhere differentiable function
- Application des fonctions symétriques à la résolution d'équations différentielles autonomes combinatoires. (Application of symmetric functions to the solution of autonomous combinatorial differential equations)
- A shifted asymmetry index series
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
- A classification of plane and planar 2-trees
- Trees, arborescences, and symmetric square roots
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution
- On the Cartier duality of certain finite group schemes of type (p^n, p^n)
- Colored operads, series on colored operads, and combinatorial generating systems
- On the combinatorics of the universal enveloping algebra \(\widehat{U}_h(\mathfrak{sl}_2)\)
- Species substitution, graph suspension, and graded Hopf algebras of painted tree polytopes
- Split graphs: combinatorial species and asymptotics
- Wonderful models for generalized Dowling arrangements
- Lagrange inversion and combinatorial species with uncountable color palette
- Shift-plethysm, hydra continued fractions, and m-distinct partitions
- Exact controllability of the 1-d wave equation on finite metric tree graphs
- Galois connections for phylogenetic networks and their polytopes
- Counting tanglegrams with species
- Free nonunitary Rota-Baxter family algebras and typed leaf-spaced decorated planar rooted forests
- Virial inversion and density functionals
- From Hertzsprung's problem to pattern-rewriting systems
- Enumeration of bipartite non-crossing geometric graphs
- Dendrimer eigen-characteristics
- Minimum status of series-reduced trees with given parameters
- An enumeration of distinct and non-isomorphic functional quasi-order relations
- Convergence of cluster and virial expansions for repulsive classical gases
- A new approach to the \(r\)-Whitney numbers by using combinatorial differential calculus
- Combinatorial micro-macro dynamical systems
- A remark on the enumeration of rooted labeled trees
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Word operads and admissible orderings
- Combinatorics of \((q,y)\)-Laguerre polynomials and their moments
- Euler characteristics of exotic configuration spaces
- Graph insertion operads
- A combinatorial classification of 2-regular simple modules for Nakayama algebras
- The sets of star and semistar operations on semilocal Prüfer domains
- A species approach to Rota's twelvefold way
- Lattice paths and branched continued fractions. II: Multivariate Lah polynomials and Lah symmetric functions
- The Hopf monoid and the basic invariant of directed graphs
- Description and generation of permutations containing cycles
- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
- Analytic functors between presheaf categories over groupoids
- Brown's theorem and its application for enumeration of dissections and planar trees
- Structure and enumeration of \((3+1)\)-free posets
- Combinatorial operads from monoids
- The non-symmetric operad pre-Lie is free
- Koszul duality for monoids and the operad of enriched rooted trees
- Topological graph polynomials and quantum field theory. I: Theory kernel theories
- Free (tri)dendriform family algebras
- Maximal independent sets and maximal matchings in series-parallel and related graph classes
- On integral structure types
- Pell graphs
- The virial series for a gas of particles with uniformly repulsive pairwise interaction and its relation with the approach to the mean field
- Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
- Semi-pointed partition posets and species
- Enumerating secondary structures and structural moieties for circular RNAs
- The categorified Heisenberg algebra. I: A combinatorial representation.
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
- Action of the symmetric groups on the homology of the hypertree posets
- Exhaustive generation of atomic combinatorial differential operators
- Counting unlabeled \(k\)-trees
- Torsion pairs in cluster tubes
- The structure of \(K_{3,3}\)-subdivision-free toroidal graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375247)
