Recurrence relations in counting the pattern 13-2 in flattened permutations

Toufik Mansour; David G.L. Wang

doi:10.1080/10236198.2014.977273

Recurrence relations in counting the pattern 13-2 in flattened permutations

Toufik Mansour, David G.L. Wang^*

^*Corresponding author for this work

School of Mathematics and Statistics

University of Haifa

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

2 Citations (Scopus)

Abstract

We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.

Original language	English
Pages (from-to)	16-36
Number of pages	21
Journal	Journal of Difference Equations and Applications
Volume	21
Issue number	1
DOIs	https://doi.org/10.1080/10236198.2014.977273
Publication status	Published - 2 Jan 2015

Keywords

generating function
pattern counting
permutation
recurrence relation

Access to Document

10.1080/10236198.2014.977273

Cite this

@article{132dbcc65625420f81bef82a68a39b93,

title = "Recurrence relations in counting the pattern 13-2 in flattened permutations",

abstract = "We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.",

keywords = "generating function, pattern counting, permutation, recurrence relation",

author = "Toufik Mansour and Wang, {David G.L.}",

note = "Publisher Copyright: {\textcopyright} 2014, {\textcopyright} 2014 Taylor & Francis.",

year = "2015",

month = jan,

day = "2",

doi = "10.1080/10236198.2014.977273",

language = "English",

volume = "21",

pages = "16--36",

journal = "Journal of Difference Equations and Applications",

issn = "1023-6198",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - Recurrence relations in counting the pattern 13-2 in flattened permutations

AU - Mansour, Toufik

AU - Wang, David G.L.

PY - 2015/1/2

Y1 - 2015/1/2

N2 - We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.

AB - We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.

KW - generating function

KW - pattern counting

KW - permutation

KW - recurrence relation

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

U2 - 10.1080/10236198.2014.977273

DO - 10.1080/10236198.2014.977273

M3 - Article

AN - SCOPUS:84949115059

SN - 1023-6198

VL - 21

SP - 16

EP - 36

JO - Journal of Difference Equations and Applications

JF - Journal of Difference Equations and Applications

IS - 1

ER -

Recurrence relations in counting the pattern 13-2 in flattened permutations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this