Pattern Avoidance in Weak Ascent Sequences

Beáta Bényi; Toufik Mansour; José L. Ramírez

doi:10.46298/dmtcs.12273

Pattern Avoidance in Weak Ascent Sequences

Beáta Bényi, Toufik Mansour, José L. Ramírez

Department of Mathematics

University of Haifa

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

Abstract

In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingrímsson (2011) for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns 001, 011, 012, 021, and 102. Additionally, we establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and plane trees.

Original language	American English
Article number	2
Journal	DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
Volume	26
Issue number	1
DOIs	https://doi.org/10.46298/dmtcs.12273
State	Published - 2024

Keywords

generating function
pattern avoidance
weak ascent sequence

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.46298/dmtcs.12273

Cite this

@article{5eab4741212d495899df15c3484161c3,

title = "Pattern Avoidance in Weak Ascent Sequences",

abstract = "In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr{\'i}msson (2011) for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns 001, 011, 012, 021, and 102. Additionally, we establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and plane trees.",

keywords = "generating function, pattern avoidance, weak ascent sequence",

author = "Be{\'a}ta B{\'e}nyi and Toufik Mansour and Ram{\'i}rez, {Jos{\'e} L.}",

note = "Publisher Copyright: {\textcopyright} 2024 by the author(s)",

year = "2024",

doi = "10.46298/dmtcs.12273",

language = "American English",

volume = "26",

journal = "DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE",

issn = "1462-7264",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "1",

}

TY - JOUR

T1 - Pattern Avoidance in Weak Ascent Sequences

AU - Bényi, Beáta

AU - Mansour, Toufik

AU - Ramírez, José L.

PY - 2024

Y1 - 2024

N2 - In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingrímsson (2011) for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns 001, 011, 012, 021, and 102. Additionally, we establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and plane trees.

AB - In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingrímsson (2011) for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns 001, 011, 012, 021, and 102. Additionally, we establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and plane trees.

KW - generating function

KW - pattern avoidance

KW - weak ascent sequence

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

U2 - 10.46298/dmtcs.12273

DO - 10.46298/dmtcs.12273

M3 - Article

SN - 1462-7264

VL - 26

JO - DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

JF - DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

IS - 1

M1 - 2

ER -

Pattern Avoidance in Weak Ascent Sequences

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this