Counting Successions in Permutations

DOI10.1002/sapm197961173zbMath0418.05005MaRDI QIDQ3208663

Stephen M. Tanny, James W. Reilly

Publication date: 1979

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

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

zbMATH Keywords

generating function; linear recurrence relation; counting successions in permutations; formal power series methods; general integer sequences; succession number

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A05: Permutations, words, matrices

11B37: Recurrences

11B39: Fibonacci and Lucas numbers and polynomials and generalizations

Related Items

Counting permutations by the number of successions within cycles, Counting permutations by successions and other figures, 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., Successions in words and compositions

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations and successions
• Circular permutations by number of rises and successions
• Über gewisse Umordnungen von Permutationen und ein zugehöriges Stabilitätskriterium. I
• Decomposition Based Generating Functions for Sequences
• Permutations without Rising or Falling $\omega$-Sequences
• Permutations by Number of Rises and Successions
• Permutations without 3-sequences
• Symbolic solution of certain problems in permutations