EUVIMEDEUVIMED entdecken
Crossref

Counting staircases in integer compositions

Aubrey Blecher, Toufik Mansour

Online Journal of Analytic Combinatorics · 2016

DOI: 10.61091/ojac-1107 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Online Journal of Analytic Combinatorics, 2016. Verfasst von Aubrey Blecher und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The main theorem establishes the generating function \(F\) which counts the number of times the staircase \(1 + 2 + 3 + \cdots + m^+\) fits inside an integer composition of \(n\). \[ F = \frac{k_m - \frac{q x^m y}{1-x} k_{m-1}}{(1-q)x^{\binom{m+1}{2}} \left( \frac{y}{1-x} \right)^m + \frac{1-x-xy}{1-x} \left( k_m - \frac{q x^m y}{1-x} k_{m-1} \right)}. \] where \[ k_m = \sum_{j=0}^{m-1} x^{mj - \binom{j}{2}} \left( \frac{y}{1-x} \right)^j. \] Here \(x\) and \(y\) respectively track the composition size and number of parts, whilst \(q\) tracks the number of such staircases contained.

Zitieren

APA

Blecher, A., & Mansour, T. (2016). Counting staircases in integer compositions. Online Journal of Analytic Combinatorics. https://doi.org/10.61091/ojac-1107

Vancouver

Blecher A, Mansour T. Counting staircases in integer compositions. Online Journal of Analytic Combinatorics. 2016. doi:10.61091/ojac-1107

BibTeX
@article{Blecher2016,
  author = {Blecher, Aubrey and Mansour, Toufik},
  title = {Counting staircases in integer compositions},
  journal = {Online Journal of Analytic Combinatorics},
  year = {2016},
  doi = {10.61091/ojac-1107}
}
Kostenlos starten →