321-polygon-avoiding permutations and Chebyshev polynomials (Q1856067): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1336668 |
Changed an Item |
||
| Property / author | |||
| Property / author: Zvezdelina E. Stankova / rank | |||
Normal rank | |||
Revision as of 00:54, 23 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 321-polygon-avoiding permutations and Chebyshev polynomials |
scientific article |
Statements
321-polygon-avoiding permutations and Chebyshev polynomials (English)
0 references
13 May 2003
0 references
A 321-\(k\)-gon-avoiding permutation is a permutation that avoids 321 and four specific patterns. It is a class of examples of the symmetric group that provides simple formulas and descriptions. In this paper, an explicit expression for the generating function for the number of 321-\(k\)-gon-avoiding permutations is given, via Chebyshev polynomials.
0 references
number of polygon-avoiding permutations
0 references
linear recurrence
0 references
