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

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)213-222
Number of pages10
JournalArs Combinatoria
Volume72
StatePublished - Jul 2004
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Permutations containing a pattern exactly once and avoiding at least two patterns of three letters'. Together they form a unique fingerprint.

Cite this