Successions in words and compositions
From MaRDI portal
Publication:1928592
DOI10.1007/s00026-012-0131-zzbMath1256.05006OpenAlexW2143292512MaRDI QIDQ1928592
Arnold Knopfmacher, Augustine O. Munagi, Stephan G. Wagner
Publication date: 3 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-012-0131-z
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Related Items (10)
A statistic related to trees and words on a finite alphabet ⋮ Set partitions and parity successions ⋮ Set partitions with circular successions ⋮ Counting permutations by simsun successions ⋮ Counting inversion sequences by parity successions and runs ⋮ Counting permutations by the number of successions within cycles ⋮ Parity successions in set partitions ⋮ Parity-alternating permutations and successions ⋮ Unnamed Item ⋮ A simple sorting algorithm for compositions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The distribution of subword counts is usually normal
- Extended set partitions with successions
- Successions in integer partitions
- String overlaps, pattern matching, and nontransitive games
- Counting permutations by successions and other figures
- Permutations and successions
- Circular permutations by number of rises and successions
- On convergence rates in the central limit theorems for combinatorial structures
- Set partitions with successions and separations
- Counting Successions in Permutations
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Permutations without 3-sequences
- Solution of the “Problème des ménages”
- A Note on the Theory of Moment Generating Functions
This page was built for publication: Successions in words and compositions
