Involutions containing exactly r pairs of intersecting arcs

Toufik Mansour

doi:10.47443/dml.2022.046

Involutions containing exactly r pairs of intersecting arcs

Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The generating function F_r(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 F_r(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	English
Pages (from-to)	64-67
Number of pages	4
Journal	Discrete Mathematics Letters
Volume	10
DOIs	https://doi.org/10.47443/dml.2022.046
State	Published - 2022

Bibliographical note

Publisher Copyright:
© 2022 the author.

Keywords

arc-pattern 3412
involution

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.47443/dml.2022.046

Cite this

@article{a3ef8a19cdf54b558a6a312c0a180f8a,

title = "Involutions containing exactly r pairs of intersecting arcs",

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.",

keywords = "arc-pattern 3412, involution",

author = "Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2022 the author.",

year = "2022",

doi = "10.47443/dml.2022.046",

language = "English",

volume = "10",

pages = "64--67",

journal = "Discrete Mathematics Letters",

issn = "2664-2557",

publisher = "Shahin Digital Publisher",

}

TY - JOUR

T1 - Involutions containing exactly r pairs of intersecting arcs

AU - Mansour, Toufik

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

KW - arc-pattern 3412

KW - involution

UR - http://www.scopus.com/inward/record.url?scp=85137122662&partnerID=8YFLogxK

U2 - 10.47443/dml.2022.046

DO - 10.47443/dml.2022.046

M3 - Article

AN - SCOPUS:85137122662

SN - 2664-2557

VL - 10

SP - 64

EP - 67

JO - Discrete Mathematics Letters

JF - Discrete Mathematics Letters

ER -

Involutions containing exactly r pairs of intersecting arcs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this