The distribution of ascents of size d or more in compositions

zbMATH Open1193.68179MaRDI QIDQ3575441FDOQ3575441

Authors: Charlotte Brennan, Arnold Knopfmacher 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/638/0.html

Recommendations

• Ascents of size less than \(d\) in compositions
• The first ascent of size \(d\) or more in compositions
• scientific article; zbMATH DE number 2174610
• The Distribution of Ascents of Size d or More in Partitions of n
• scientific article; zbMATH DE number 6291261

zbMATH Keywords

compositionsgenerating functionsdistributionsascents

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75)

Cited In (11)

• The largest missing value in a composition of an integer
• Record statistics in a random composition
• Enumeration of compositions according to the sum of the values of the first letters of the occurrences of a 2-letter pattern
• A new decomposition of ascent sequences and Euler-Stirling statistics
• Title not available (Why is that?)
• Longest run of equal parts in a random integer composition
• Ascents of size less than \(d\) in compositions
• Greatest descents after any maxima in compositions
• The first ascent of size \(d\) or more in compositions
• Combinatorial parameters in bargraphs
• The Distribution of Ascents of Size d or More in Partitions of n

This page was built for publication: The distribution of ascents of size \(d\) or more in compositions

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