Counting Successions in Permutations

DOI10.1002/sapm197961173zbMath0418.05005OpenAlexW2604875785MaRDI QIDQ3208663

James W. Reilly, Stephen M. Tanny

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 functionlinear recurrence relationcounting successions in permutationsformal power series methodsgeneral integer sequencessuccession number

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (6)

On the combinatorics of derangements and related permutations ⋮ Successions in words and compositions ⋮ 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.

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

This page was built for publication: Counting Successions in Permutations