Permutations Containing and Avoiding 123 and 132 Patterns

Simple item page
dc.creatorRobertson, Aaron
dc.date1999-03-29
dc.date.accessioned2026-07-07T05:28:31Z
dc.date.available2026-07-07T05:28:31Z
dc.descriptionWe prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern. Finally, we show that the number of permutations which contain exactly one 123-pattern and exactly one 132-pattern is (n-3)(n-4)2^(n-5).
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/9903169
dc.identifierhttp://arxiv.org/abs/math/9903169
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78287
dc.subjectCombinatorics
dc.subject05A15
dc.titlePermutations Containing and Avoiding 123 and 132 Patterns
dc.typetext

Files

Collections

arXiv