A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems

DOI10.1002/SAPM1979612141zbMath0455.05008OpenAlexW2605967899MaRDI QIDQ3903006

David M. Jackson, Ian P. Goulden

Publication date: 1979

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1979612141

zbMATH Keywords

permutationsgenerating functionsincidence matricesenumeration of sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)

Related Items (9)

The enumeration of sequences with respect to structures on a bipartition ⋮ Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences ⋮ Algebraic methods for permutations with prescribed patterns ⋮ A combinatorial application of matrix Riccati equations and their q- analogue ⋮ A Logarithmic Connection for Circular Permutation Enumeration ⋮ Random permutations on a set with a binary relation ⋮ A Matrix for Counting Paths in Acyclic Colored Digraphs ⋮ An umbral relation between pattern and commutation in strings ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on product-weighted lead codes
• The number of increases in a random permutation
• On Eulerian circuits and words with prescribed adjacency patterns
• Generating functions for certain types of permutations
• On elementary calculus and the Good formula
• Generating functions and generalized alternating subsets
• A note on permutations with fixed pattern
• Enumeration of pairs of permutations
• Binomial posets, Möbius inversion, and permutation enumeration
• Permutations and successions
• The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model
• Enumeration of pairs of sequences by rises, falls and levels
• The unification of certain enumeration problems for sequences
• The enumeration of generalised alternating subsets with congruences
• Enumeration of permutations and sequences with restrictions
• Über gewisse Potenzreihen mit lauter positiven Koeffizienten
• Graphs, quasisymmetry and permutations with restricted positions
• Permutations and sequences
• Addition theorems for sets of integers
• Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
• Combinatorial problems of commutation and rearrangements
• Théorie géométrique des polynômes eulériens
• Sequences with adjacent elements unequal
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
• Enumeration of up-down sequences
• Up-down sequences
• Enumeration of rises and falls by position
• Über gewisse Umordnungen von Permutationen und ein zugehöriges Stabilitätskriterium. I
• Exact Markov Probabilities from Oriented Linear Graphs
• Permutations and sequences with repetitions by number of increases
• Permutation Problems and Special Functions
• The Theory of Compositions (I): the Ordered Factorizations of n and a Conjecture of C. Long
• Derangements and Laguerre polynomials
• Laguerre polynomials and derangements
• Decomposition Based Generating Functions for Sequences
• An Application of a Generalization of Terquem's Problem
• An exposá of the mullin-rota theory of polynomials of binomial type
• A Combinatorial Problem Connected with Differential Equations
• Restricted Choices
• Permutations without Rising or Falling $\omega$-Sequences
• Permutations by Number of Rises and Successions
• A mechanical counting method and combinatorial applications
• The Use of S-Functions in Combinatorial Analysis
• Enumeration of combinations with restricted differences and cospan
• Generalizations of Terquem's problem
• On a Problem in Partial Difference Equations
• Simon Newcomb’s Problem
• Dissection of Generating Functions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Permutations without 3-sequences
• Solution of the “Problème des ménages”
• Symbolic solution of certain problems in permutations

This page was built for publication: A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems