Five classes of pattern avoiding inversion sequences under one roof: generating trees

Toufik Mansour

doi:10.1080/10236198.2023.2253327

Five classes of pattern avoiding inversion sequences under one roof: generating trees

Toufik Mansour

Department of Mathematics

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

Abstract

An inversion sequence of length n is a word (Formula presented.) which satisfies for each (Formula presented.) the inequalities (Formula presented.). In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, (Formula presented.), (Formula presented.), 0123, or 0321.

Original language	English
Pages (from-to)	748-762
Number of pages	15
Journal	Journal of Difference Equations and Applications
Volume	29
Issue number	7
DOIs	https://doi.org/10.1080/10236198.2023.2253327
State	Published - 2023

Bibliographical note

Publisher Copyright:
© 2023 Informa UK Limited, trading as Taylor & Francis Group.

Keywords

Inversion sequences
generating trees
kernel method
pattern avoidance

ASJC Scopus subject areas

Analysis
Algebra and Number Theory
Applied Mathematics

Access to Document

10.1080/10236198.2023.2253327

Cite this

@article{4efe8f85f6bd46659c7728e50b05d396,

title = "Five classes of pattern avoiding inversion sequences under one roof: generating trees",

abstract = "An inversion sequence of length n is a word (Formula presented.) which satisfies for each (Formula presented.) the inequalities (Formula presented.). In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, (Formula presented.), (Formula presented.), 0123, or 0321.",

keywords = "Inversion sequences, generating trees, kernel method, pattern avoidance",

author = "Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2023 Informa UK Limited, trading as Taylor & Francis Group.",

year = "2023",

doi = "10.1080/10236198.2023.2253327",

language = "English",

volume = "29",

pages = "748--762",

journal = "Journal of Difference Equations and Applications",

issn = "1023-6198",

publisher = "Taylor and Francis Ltd.",

number = "7",

}

TY - JOUR

T1 - Five classes of pattern avoiding inversion sequences under one roof

T2 - generating trees

AU - Mansour, Toufik

PY - 2023

Y1 - 2023

N2 - An inversion sequence of length n is a word (Formula presented.) which satisfies for each (Formula presented.) the inequalities (Formula presented.). In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, (Formula presented.), (Formula presented.), 0123, or 0321.

AB - An inversion sequence of length n is a word (Formula presented.) which satisfies for each (Formula presented.) the inequalities (Formula presented.). In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, (Formula presented.), (Formula presented.), 0123, or 0321.

KW - Inversion sequences

KW - generating trees

KW - kernel method

KW - pattern avoidance

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

U2 - 10.1080/10236198.2023.2253327

DO - 10.1080/10236198.2023.2253327

M3 - Article

AN - SCOPUS:85169596974

SN - 1023-6198

VL - 29

SP - 748

EP - 762

JO - Journal of Difference Equations and Applications

JF - Journal of Difference Equations and Applications

IS - 7

ER -

Five classes of pattern avoiding inversion sequences under one roof: generating trees

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this