Abstract
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.
| Original language | American English |
|---|---|
| Pages (from-to) | 64-67 |
| Number of pages | 4 |
| Journal | Discrete Mathematics Letters |
| Volume | 10 |
| DOIs | |
| State | Published - 2022 |
Keywords
- arc-pattern 3412
- involution
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver