Permutations without Rising or Falling \omega-Sequences

DOI10.1214/AOMS/1177698793MaRDI QIDQ5532560zbMATH OpenOpenAlexFDO

Authors Morton Abramson, W. O. J. Moser

Publication date 1967

Published in Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoms/1177698793

zbMATH Keywords

combinatorics

Cited in

(11)

• The combinatorial interpretation of the Jacobi identity from Lie algebras
• A note on permutations without runs of given length
• The distribution of increasing l-sequences in random permutations: A Markov chain approach
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• From Hertzsprung's problem to pattern-rewriting systems
• Counting Successions in Permutations
• 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
• Distributions of successions of arbitrary multisets
• Counting king permutations on the cylinder

This page was built for publication: Permutations without Rising or Falling $\omega$-Sequences

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