On avoiding 1233

Toufik Mansour; Mark Shattuck

doi:10.26493/2590-9770.1377.8e9

On avoiding 1233

Toufik Mansour, Mark Shattuck

Department of Mathematics

University of Haifa

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

Abstract

In this paper, we establish a recurrence relation for finding the generating function for the number of k-ary words of length n that avoid 1233 for arbitrary k. Comparable generating function formulas may also be found counting words where a single permutation pattern of length three is avoided in addition to 1233.

Original language	American English
Journal	Art of Discrete and Applied Mathematics
Volume	5
Issue number	1
DOIs	https://doi.org/10.26493/2590-9770.1377.8e9
State	Published - 2021

Keywords

Avoiding 1233
Kernel method
k-ary words

All Science Journal Classification (ASJC) codes

Applied Mathematics
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.26493/2590-9770.1377.8e9

Cite this

@article{7e94fe44cc6347a39af70870e9156a6a,

title = "On avoiding 1233",

abstract = "In this paper, we establish a recurrence relation for finding the generating function for the number of k-ary words of length n that avoid 1233 for arbitrary k. Comparable generating function formulas may also be found counting words where a single permutation pattern of length three is avoided in addition to 1233.",

keywords = "Avoiding 1233, Kernel method, k-ary words",

author = "Toufik Mansour and Mark Shattuck",

note = "Publisher Copyright: {\textcopyright} 2021 University of Primorska.",

year = "2021",

doi = "10.26493/2590-9770.1377.8e9",

language = "American English",

volume = "5",

journal = "Art of Discrete and Applied Mathematics",

issn = "2590-9770",

publisher = "University of Primorska",

number = "1",

}

TY - JOUR

T1 - On avoiding 1233

AU - Mansour, Toufik

AU - Shattuck, Mark

PY - 2021

Y1 - 2021

N2 - In this paper, we establish a recurrence relation for finding the generating function for the number of k-ary words of length n that avoid 1233 for arbitrary k. Comparable generating function formulas may also be found counting words where a single permutation pattern of length three is avoided in addition to 1233.

AB - In this paper, we establish a recurrence relation for finding the generating function for the number of k-ary words of length n that avoid 1233 for arbitrary k. Comparable generating function formulas may also be found counting words where a single permutation pattern of length three is avoided in addition to 1233.

KW - Avoiding 1233

KW - Kernel method

KW - k-ary words

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

U2 - 10.26493/2590-9770.1377.8e9

DO - 10.26493/2590-9770.1377.8e9

M3 - Article

SN - 2590-9770

VL - 5

JO - Art of Discrete and Applied Mathematics

JF - Art of Discrete and Applied Mathematics

IS - 1

ER -

On avoiding 1233

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this