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

Simple item page
dc.creatorMansour, T.
dc.date2002-02-01
dc.date.accessioned2026-07-07T04:46:15Z
dc.date.available2026-07-07T04:46:15Z
dc.descriptionIn 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 $τ\in S_k$ exactly once and avoid a subset $T\subseteq S_3$, $|T|\geq2$. The main body of the paper is divided into three sections corresponding to the cases $|T|=2,3$ and $|T|\geq4$.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0202007
dc.identifierhttp://arxiv.org/abs/math/0202007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63258
dc.subjectCombinatorics
dc.titlePermutations containing a pattern exactly once and avoiding at least two patterns of three letters
dc.typetext

Files

Collections

arXiv