The generating function Fr(x) that counts the involutions on n letters containing exactly r pairs of intersecting arcs in their graphical representation is studied. More precisely, an algorithm that computes the generating function Fr(x) for any given r ≥ 0 is presented. To derive the result for a given r, the algorithm performs certain routine checks on involutions of length 2r + 2 without fixed points. The algorithm is implemented in Maple and yields explicit formulas for 0 ≤ r ≤ 4.
Bibliographical notePublisher Copyright:
© 2022 the author.
- arc-pattern 3412
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics