The distribution of run lengths in integer compositions
zbMATH Open1236.05014MaRDI QIDQ648416FDOQ648416
Authors: Herbert S. Wilf 
Publication date: 22 November 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i2p23.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Variations on a generating-function theme: enumerating compositions with parts avoiding an arithmetic sequence
- Avoiding substrings in compositons
- scientific article; zbMATH DE number 3557797
- scientific article; zbMATH DE number 2170412
- Avoiding patterns of length three in compositions and multiset permutations
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics on words (68R15)
Cited In (9)
- Variations on a generating-function theme: enumerating compositions with parts avoiding an arithmetic sequence
- The Asymptotic Distribution of Runs of Consecutive Elements
- Title not available (Why is that?)
- Fixed points in compositions and words
- Longest run of equal parts in a random integer composition
- Distinctness of compositions of an integer: A probabilistic analysis
- Forbidden substrings on weighted alphabets
- Title not available (Why is that?)
- Maximal runs of strictly composite integers
This page was built for publication: The distribution of run lengths in integer compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648416)
