Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

David Callan; Toufik Mansour

doi:10.26493/2590-9770.1716.1d3

Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

David Callan, Toufik Mansour

Department of Mathematics

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

Abstract

We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.

Original language	English
Journal	Art of Discrete and Applied Mathematics
Volume	7
Issue number	2
DOIs	https://doi.org/10.26493/2590-9770.1716.1d3
State	Published - 2024

Bibliographical note

Publisher Copyright:
© 2024 University of Primorska. All rights reserved.

Keywords

Ascent sequences, Fibonacci numbers

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.26493/2590-9770.1716.1d3

Cite this

@article{af36a5fb29ab4cfd99a767a1c5e7e33a,

title = "Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers",

abstract = "We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.",

keywords = "Ascent sequences, Fibonacci numbers",

author = "David Callan and Toufik Mansour",

year = "2024",

doi = "10.26493/2590-9770.1716.1d3",

language = "English",

volume = "7",

journal = "Art of Discrete and Applied Mathematics",

issn = "2590-9770",

publisher = "University of Primorska",

number = "2",

}

TY - JOUR

T1 - Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

AU - Callan, David

AU - Mansour, Toufik

PY - 2024

Y1 - 2024

N2 - We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.

AB - We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.

KW - Ascent sequences, Fibonacci numbers

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

U2 - 10.26493/2590-9770.1716.1d3

DO - 10.26493/2590-9770.1716.1d3

M3 - Article

AN - SCOPUS:85206487756

SN - 2590-9770

VL - 7

JO - Art of Discrete and Applied Mathematics

JF - Art of Discrete and Applied Mathematics

IS - 2

ER -

Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this