2000/10/04 by Toufik Mansour, T. Mansour, Mansour, T. +3
Computer Science · Mathematics · #05A05 #05A15 #30B70 #42C05 #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Statistical Distribution Estimation and Applications #math.CO #msc:05A05 #msc:05A15 #msc:30B70 #msc:42C05
paper · pdf · doi:10.48550/arxiv.math/0010047
10 pages
openalex publication_date 2000/10/04 · arxiv created 2000/11/07 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.