Permutations without 3-sequences

DOI10.1090/S0002-9904-1945-08439-0zbMath0060.02902MaRDI QIDQ5834383

John Riordan

Publication date: 1945

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

zbMATH Keywords

combinatorics

Related Items (16)

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

Cites Work

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

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