Restricted 132-Involutions and Chebyshev Polynomials
| dc.creator | Guibert, O. | |
| dc.creator | Mansour, T. | |
| dc.date | 2002-01-15 | |
| dc.date.accessioned | 2026-07-07T04:45:52Z | |
| dc.date.available | 2026-07-07T04:45:52Z | |
| dc.description | We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $τ$ on $k$ letters. In several interesting cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind. In particular, we establish that involutions avoiding both 132 and $12... k$ have the same enumerative formula according to the length than involutions avoiding both 132 and any {\em double-wedge pattern} possibly followed by fixed points of total length $k$. Many results are also shown with a combinatorial point of view. | |
| dc.description | 18 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0201136 | |
| dc.identifier | http://arxiv.org/abs/math/0201136 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63119 | |
| dc.subject | Combinatorics | |
| dc.title | Restricted 132-Involutions and Chebyshev Polynomials | |
| dc.type | text |