Permutations avoiding a set of patterns from S_3 and a pattern from S_4

Simple item page
dc.creatorMansour, T.
dc.date1999-09-02
dc.date.accessioned2026-07-07T05:30:38Z
dc.date.available2026-07-07T05:30:38Z
dc.descriptionIn this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.
dc.identifierhttps://arxiv.org/abs/math/9909019
dc.identifierhttp://arxiv.org/abs/math/9909019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79054
dc.subjectCombinatorics
dc.titlePermutations avoiding a set of patterns from S_3 and a pattern from S_4
dc.typetext

Files

Collections

arXiv