scientific article; zbMATH DE number 3344587

DOI10.1512/iumj.1971.20.20060zbMath0217.01803OpenAlexW4248603327MaRDI QIDQ5620608

Edward A. Bender, Jay R. Goldman

Publication date: 1971

Published in: Indiana University Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1512/iumj.1971.20.20060

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15)

Related Items (43)

An undecidable problem in finite combinatorics ⋮ Some canonical sequences of integers ⋮ Une combinatoire du pléthysme. (Combinatorics of plethysm) ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ Some methods for computing component distribution probabilities in relational structures ⋮ A combinatorial proof of the multivariable Lagrange inversion formula ⋮ Decomposable functors and the exponential principle ⋮ Generalized Stirling and Lah numbers ⋮ On algebraic structures underlying the Poisson process ⋮ On the largest part size of low‐rank combinatorial assemblies ⋮ Operatorenkalkül über freien Monoiden I: Strukturen ⋮ The Tutte-Grothendieck group of an alphabetic rewriting system ⋮ Random variables related to a class of ordered structures ⋮ A \(q\)-analog of the exponential formula ⋮ Dissection of Generating Functions ⋮ Une théorie combinatoire des séries formelles ⋮ Automatic average-case analysis of algorithms ⋮ On the effective content of asymptotic verifications of Edgeworth's Conjecture ⋮ Computation of the expected number of leaves in a tree having a given automorphism, and related topics ⋮ Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories ⋮ Acyclic orientations of graphs. (Reprint) ⋮ A \(q\)-analog of the exponential formula. (Reprint) ⋮ The Eulerian generating function of \(q\)-derangements ⋮ Taxonomic classes of sets ⋮ Exponential Structures ⋮ The Combinatorics of Polynomial Sequences ⋮ A combinational proof of the Mehler formula ⋮ Formal languages and enumeration ⋮ Incidence algebra antipodes and Lagrange inversion in one and several variables ⋮ A pentagonal number sieve ⋮ Counting Witt rings ⋮ Depth-first search as a combinatorial correspondence ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments ⋮ Asymptotic expansions for the coefficients of analytic generating functions ⋮ Partition identities ⋮ Acyclic orientations of graphs ⋮ Sieve equivalence in generalized partition theory ⋮ Enumeration of connected invariant graphs ⋮ The asymptotic number of irreducible partitions ⋮ The enumeration of irreducible combinatorial objects ⋮ Covering algebras and \(q\)-binomial generating functions

This page was built for publication: