Permutations without 3-sequences

DOI10.1090/S0002-9904-1945-08439-0MaRDI QIDQ5834383zbMATH OpenFDO

Authors John Riordan

Publication date 1945

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1945-08439-0

zbMATH Keywords

combinatorics

Cites work

• Additive Partition Functions and a Class of Statistical Hypotheses
• Solution of the “Problème des ménages”
• Symbolic solution of certain problems in permutations

Cited in

(17)

• 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
• Set partitions with circular successions
• From Hertzsprung's problem to pattern-rewriting systems
• Where the monotone pattern (mostly) rules
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• Counting Successions in Permutations
• Some stochastic processes in a random permutation
• Counting permutations by simsun successions
• Parity-alternating permutations and successions
• A note on permutations without runs of given length
• Successions in words and compositions
• On the joint distributions of succession and Eulerian statistics
• Distributions of successions of arbitrary multisets
• Counting permutations by the number of successions within cycles
• The distribution of increasing l-sequences in random permutations: A Markov chain approach

This page was built for publication: Permutations without 3-sequences

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