The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: EKHAD / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2327859490 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1411.5052 / rank | |||
Normal rank | |||
Latest revision as of 13:24, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic |
scientific article |
Statements
The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (English)
0 references
13 June 2016
0 references
The authors generalize a result of \textit{W. Y. C. Chen} et al. [Eur. J. Comb. 36, 416--424 (2014; Zbl 1284.05034)]. From the authors' abstract: ``(W)e present an algorithm for finding\dots an algebraic equation for the ordinary generating function enumerating 123-avoiding words with exactly \(r\) occurrences of each of \(\{1,2,\dots,n\}\) for \textit{any} positive integer \(r\), thereby proving that they are \textit{algebraic}.''
0 references
pattern avoidance
0 references
words
0 references
algebraic generating functions
0 references
