Counting Successions in Permutations

DOI10.1002/SAPM197961173zbMATH Open0418.05005OpenAlexW2604875785MaRDI QIDQ3208663FDOQ3208663

Authors: 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

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

Cites Work

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

Cited In (6)

• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• Successions in words and compositions
• Counting permutations by the number of successions within cycles
• Counting permutations by successions and other figures
• On the combinatorics of derangements and related permutations
• The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach

This page was built for publication: Counting Successions in Permutations

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