A Formal Calculus for the Enumerative System of Sequences-III. Further Developments

DOI10.1002/SAPM1980622113MaRDI QIDQ3903008zbMATH OpenOpenAlexFDO

Authors David M. Jackson, I. P. Goulden

Publication date 1980

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

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

zbMATH Keywords

enumeration of sequencesfirst order non-linear differential equationsgenerating functionsincidence matricespermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Nonlinear ordinary differential equations and systems (34A34)

Cites work

• A Combinatorial Problem Connected with Differential Equations
• A mechanical counting method and combinatorial applications
• A note on permutations with fixed pattern
• Addition theorems for sets of integers
• An Application of a Generalization of Terquem's Problem
• An exposá of the mullin-rota theory of polynomials of binomial type
• Binomial posets, Möbius inversion, and permutation enumeration
• Decomposition Based Generating Functions for Sequences
• Derangements and Laguerre polynomials
• Dissection of Generating Functions
• Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
• Enumeration of combinations with restricted differences and cospan
• Enumeration of pairs of permutations
• Enumeration of pairs of sequences by rises, falls and levels
• Enumeration of permutations and sequences with restrictions
• Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
• Enumeration of rises and falls by position
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Enumeration of up-down sequences
• Exact Markov Probabilities from Oriented Linear Graphs
• Generalizations of Terquem's problem
• Generating functions and generalized alternating subsets
• Generating functions for certain types of permutations
• Graphs, quasisymmetry and permutations with restricted positions
• scientific article; zbMATH DE number 3116602 (Why is no real title available?)
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3176891 (Why is no real title available?)
• scientific article; zbMATH DE number 3672306 (Why is no real title available?)
• scientific article; zbMATH DE number 3510313 (Why is no real title available?)
• scientific article; zbMATH DE number 3433888 (Why is no real title available?)
• scientific article; zbMATH DE number 3219337 (Why is no real title available?)
• scientific article; zbMATH DE number 3230025 (Why is no real title available?)
• scientific article; zbMATH DE number 3263280 (Why is no real title available?)
• scientific article; zbMATH DE number 3289183 (Why is no real title available?)
• scientific article; zbMATH DE number 3322983 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• scientific article; zbMATH DE number 3197118 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• Laguerre polynomials and derangements
• On a Problem in Partial Difference Equations
• On elementary calculus and the Good formula
• On Eulerian circuits and words with prescribed adjacency patterns
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• On the Foundations of Combinatorial Theory. VII: Symmetric Functions through the Theory of Distribution and Occupancy
• Permutation Problems and Special Functions
• Permutations and sequences
• Permutations and sequences with repetitions by number of increases
• Permutations and successions
• Permutations by Number of Rises and Successions
• Permutations without 3-sequences
• Permutations without Rising or Falling \omega-Sequences
• Proceedings of the Forty-third Southeastern International Conference on Combinatorics, Graph theory and Computing
• Restricted Choices
• Sequence Enumeration and the de Bruijn-Van Aardenne Ehrenfest-Smith-Tutte Theorem
• Sequences with adjacent elements unequal
• Simon Newcomb’s Problem
• Solution of the “Problème des ménages”
• Some results on product-weighted lead codes
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Symbolic solution of certain problems in permutations
• The enumeration of generalised alternating subsets with congruences
• The number of increases in a random permutation
• The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model
• The unification of certain enumeration problems for sequences
• The Use of S-Functions in Combinatorial Analysis
• Up-down sequences
• Über gewisse Potenzreihen mit lauter positiven Koeffizienten
• Über gewisse Umordnungen von Permutationen und ein zugehöriges Stabilitätskriterium. I

Cited in

(4)

• An algebraic theory of sequence enumeration
• Sequence enumeration
• Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
• A Logarithmic Connection for Circular Permutation Enumeration

This page was built for publication: A Formal Calculus for the Enumerative System of Sequences-III. Further Developments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903008)