scientific article; zbMATH DE number 1111371
From MaRDI portal
Publication:4375247
Recommendations
Cited in
(only showing first 100 items - show all)- Feynman graphs, and nerve theorem for compact symmetric multicategories (extended abstract)
- Combinatorial operads from monoids
- Enumeration of chains and saturated chains in Dyck lattices.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Enumerating tree-like polyphenyl isomers
- The virial series for a gas of particles with uniformly repulsive pairwise interaction and its relation with the approach to the mean field
- Analytic combinatorics of non-crossing configurations
- The leading root of the partial theta function
- Boltzmann samplers for first-order differential specifications
- Exact enumeration of satisfiable 2-SAT formulae
- Commutative combinatorial Hopf algebras.
- Koszul duality for monoids and the operad of enriched rooted trees
- The uplift principle for ordered trees
- The structure of alternative tableaux
- Analytic results on the polymerisation random graph model
- The Specker-Blatter theorem does not hold for quaternary relations
- On the arithmetic product of combinatorial species
- Enumeration of symmetry classes of convex polyominoes in the square lattice
- The polytope algebra of generalized permutahedra
- The asymptotic expansion for \(n!\) and the Lagrange inversion formula
- An antipode formula for the natural Hopf algebra of a set operad.
- Combinatorics of \((q,y)\)-Laguerre polynomials and their moments
- Boltzmann sampling of ordered structures
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
- Labeled floor diagrams for plane curves
- Enumeration of bipartite graphs and bipartite blocks
- Counting tanglegrams with species
- Analytic urns
- Outerplanar obstructions for a feedback vertex set
- Species over a finite field
- Extremal results on average subtree density of series-reduced trees
- Two applications of analytic functors
- Outerplanar obstructions for the feedback vertex set
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- The specification of 2-trees
- Tree quantum field theory
- On the Euler characteristic of Kronecker moduli spaces
- A countercyclical operad on shrubs
- Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
- Convergence of cluster and virial expansions for repulsive classical gases
- The asymptotic number of spanning forests of complete bipartite labelled graphs
- scientific article; zbMATH DE number 4143982 (Why is no real title available?)
- Spanning trees in random series-parallel graphs
- Derivations and automorphisms on non-commutative power series.
- Algorithms for sequential generation of combinatorial structures
- Brill-Gordan loci, transvectants and an analogue of the Foulkes conjecture
- The degree sequence of random graphs from subcritical classes
- Torsion pairs in cluster tubes
- Ptolemy diagrams and torsion pairs in the cluster category of Dynkin type \(A _{n }\)
- A set-operad of formal fractions and dendriform-like sub-operads
- Bilinear system interconnections and generating series of weighted Petri nets
- Generating functions of bipartite maps on orientable surfaces
- On symmetries in phylogenetic trees
- Graph limits of random unlabelled k-trees
- Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
- Data types with symmetries and polynomial functors over groupoids
- The distribution of height and diameter in random non-plane binary trees
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
- Invariant tensors and the cyclic sieving phenomenon
- Description and generation of permutations containing cycles
- Uniform random sampling of planar graphs in linear time
- The mathematical life of Pierre Leroux
- Constructive field theory in zero dimension
- ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS
- On urn models, non-commutativity and operator normal forms
- Une combinatoire sous-jacente au théorème des fonctions implicites. (Combinatorics underlying the implicit functions theorem)
- Invariants from classical field theory
- Counting unlabeled \(k\)-trees
- Intervals of balanced binary trees in the Tamari lattice
- Services within a busy period of an M/M/1 queue and Dyck paths
- A Galton-Watson estimate for Dyson series
- Topological graph polynomials and quantum field theory. I: Theory kernel theories
- Cayley continuants
- Nonlocal, noncommutative diagrammatics and the linked cluster theorems
- Object grammars and bijections.
- Dérivées directionnelles et développements de Taylor combinatoires. (Directional derivatives and combinatorial Taylor expansions)
- Tree expansion in time-dependent perturbation theory
- Enumerating stereo-isomers of tree-like polyinositols
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Trees, functional equations, and combinatorial Hopf algebras
- Decomposing labeled interval orders as pairs of permutations
- Cyclic Inclusion-Exclusion
- Lattice paths and branched continued fractions. II: Multivariate Lah polynomials and Lah symmetric functions
- The ground state energy of the massless spin-boson model
- Hypergraphs and a functional equation of Bouwkamp and de Bruijn
- Strong forms of linearization for Hopf monoids in species
- Prime graphs and exponential composition of species
- A bijective proof of infinite variated Good's inversion
- The Heisenberg product: from Hopf algebras and species to symmetric functions
- Renormalization automated by Hopf algebra
- Strong forms of self-duality for Hopf monoids in species
- Free integro-differential algebras and Gröbner-Shirshov bases.
- The growth rate of high-dimensional tree polycubes
- The Eulerian generating function of \(q\)-derangements
- Minor-obstructions for apex sub-unicyclic graphs
- scientific article; zbMATH DE number 4033765 (Why is no real title available?)
- Automatic average-case analysis of algorithms
- On the Cartier duality of certain finite group schemes of type \((p^n, p^n)\)
- Enumeration of point-determining graphs
- ECO species
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)
