Title: | Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3 |
Author: |
|
Date: | 2017 |
Language: | English |
Scope: | 17.7.6 |
University/Institute: | Háskólinn í Reykjavík Reykjavik University Háskóli Íslands University of Iceland |
School: | Verkfræði- og náttúruvísindasvið (HÍ) School of Engineering and Natural Sciences (UI) Tölvunarfræðideild (HR) School of Computer Science (RU) |
Department: | Raunvísindastofnun (HÍ) Science Institute (UI) |
Series: | Journal of Integer Sequences;20 |
ISSN: | 1530-7638 |
Subject: | Tölvunarfræði; Stærðfræði |
URI: | https://hdl.handle.net/20.500.11815/532 |
Citation:Christian Bean , Anders Claesson , and Henning Ulfarsson. (2017). Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3, Journal of Integer Sequences, Vol. 20, article 17.7.6
|
|
Abstract:Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of permutations simultaneously avoiding a vincular and a covincular pattern, both of length 3, with at most one restriction. We see familiar sequences, such as the Catalan and Motzkin numbers, but also some previously unknown sequences which have close links to other combinatorial objects such as lattice paths and integer partitions. Where possible we include a generating function for the enumeration. One of the cases considered settles a conjecture by Pudwell (2010) on the Wilf-equivalence of barred patterns. We also give an alternative proof of the classic result that permutations avoiding 123 are counted by the Catalan numbers.
|