Permutations containing a pattern exactly once and avoiding at least two patterns of three letters

T. Mansour

Permutations containing a pattern exactly once and avoiding at least two patterns of three letters

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

Abstract

In this paper, we find an explicit formulas, or recurrences, in terms of generating functions for the cardinalities of the sets S_n(T; τ) of all permutations in S_n that contain τ ∈ S_k exactly once and avoid a subset T ⊆ S₃ where |T| ≥ 2.

Original language	English
Pages (from-to)	213-222
Number of pages	10
Journal	Ars Combinatoria
Volume	72
State	Published - Jul 2004
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Cite this

@article{3182ac643c944a9daf71608ce5a9fb54,

title = "Permutations containing a pattern exactly once and avoiding at least two patterns of three letters",

abstract = "In this paper, we find an explicit formulas, or recurrences, in terms of generating functions for the cardinalities of the sets Sn(T; τ) of all permutations in Sn that contain τ ∈ Sk exactly once and avoid a subset T ⊆ S3 where |T| ≥ 2.",

author = "T. Mansour",

year = "2004",

month = jul,

language = "English",

volume = "72",

pages = "213--222",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Permutations containing a pattern exactly once and avoiding at least two patterns of three letters

AU - Mansour, T.

PY - 2004/7

Y1 - 2004/7

N2 - In this paper, we find an explicit formulas, or recurrences, in terms of generating functions for the cardinalities of the sets Sn(T; τ) of all permutations in Sn that contain τ ∈ Sk exactly once and avoid a subset T ⊆ S3 where |T| ≥ 2.

AB - In this paper, we find an explicit formulas, or recurrences, in terms of generating functions for the cardinalities of the sets Sn(T; τ) of all permutations in Sn that contain τ ∈ Sk exactly once and avoid a subset T ⊆ S3 where |T| ≥ 2.

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

M3 - Article

AN - SCOPUS:26844434741

SN - 0381-7032

VL - 72

SP - 213

EP - 222

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Permutations containing a pattern exactly once and avoiding at least two patterns of three letters

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this