vix.ing · top · new · best · stats · spec

The fine structure of 321 avoiding involutions

2010/10/28 by Piera Manara, Manara, Piera, Claudio Perelli Cippo +1
Mathematics · #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algebraic number #Artificial intelligence #Class (philosophy) #Combinatorics #Combinatorics (math.CO) #Computer science #FOS: Mathematics #Graphics #Interpretation (philosophy) #Mathematical analysis #Mathematics #Pure mathematics #Set (abstract data type) #Simple (philosophy) #math.CO

paper · pdf · doi:10.48550/arxiv.1010.5919

19 pages including 8 figures

arxiv created 2010/10/28 · openalex publication_date 2010/10/28 · arxiv updated 2010/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the algebraic generating functions of the involutions that are expansions of 12, of those expansions of 21, of the simple ones and of their expansions. The graphics of the simple involutions are caracterized. Being the simple involutions avoiding 321 counted by Riordan's numbers, a combinatoric interpretation of the results is illustrated through a class of Motzkin paths. Another interpretation is given through Dyck paths.

Related