scholarly journals Ascent Sequences Avoiding Pairs of Patterns

10.37236/4479 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Andrew M. Baxter ◽  
Lara K. Pudwell

Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrímsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdős-Szekeres Theorem to prove that any sufficiently long ascent sequence contains either many copies of the same number or a long increasing subsequence, with a precise bound.

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Mireille Bousquet-Mélou ◽  
Anders Claesson ◽  
Mark Dukes ◽  
Sergey Kitaev

International audience We present statistic-preserving bijections between four classes of combinatorial objects. Two of them, the class of unlabeled $(\textrm{2+2})$-free posets and a certain class of chord diagrams (or involutions), already appeared in the literature, but were apparently not known to be equinumerous. The third one is a new class of pattern avoiding permutations, and the fourth one consists of certain integer sequences called $\textit{ascent sequences}$. We also determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern $3\bar{1}52\bar{4}$, and enumerate those permutations, thus settling a conjecture of Pudwell. Nous présentons des bijections, transportant de nombreuses statistiques, entre quatre classes d'objets. Deux d'entre elles, la classe des EPO (ensembles partiellement ordonnés) sans motif $(\textrm{2+2})$ et une certaine classe d'involutions, sont déjà apparues dans la littérature. La troisième est une classe de permutations à motifs exclus, et la quatrième une classe de suites que nous appelons $\textit{suites à montées}$. Nous déterminons ensuite la série génératrice de ces classes, retrouvant ainsi un résultat prouvé par Zagier pour les involutions sus-mentionnées. La série obtenue n'est pas D-finie. Apparemment, le fait qu'elle compte aussi les EPO sans motif $(\textrm{2+2})$ est nouveau. Finalement, nous caractérisons les suites à montées qui correspondent aux permutations évitant le motif barré $3\bar{1}52\bar{4}$ et énumérons ces permutations, ce qui démontre une conjecture de Pudwell.


Filomat ◽  
2015 ◽  
Vol 29 (4) ◽  
pp. 703-712
Author(s):  
Toufik Mansour ◽  
Mark Shattuck

An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. Let Fn denote the Fibonacci sequence given by the recurrence Fn = Fn-1 + Fn-2 if n ? 2, with F0 = 0 and F1 = 1. In this paper, we draw connections between ascent sequences and the Fibonacci numbers by showing that several pattern-avoidance classes of ascent sequences are enumerated by either Fn+1 or F2n-1. We make use of both algebraic and combinatorial methods to establish our results. In one of the apparently more difficult cases, we make use of the kernel method to solve a functional equation and thus determine the distribution of some statistics on the avoidance class in question. In two other cases, we adapt the scanning-elements algorithm, a technique which has been used in the enumeration of certain classes of pattern-avoiding permutations, to the comparable problem concerning pattern-avoiding ascent sequences.


10.37236/713 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Paul Duncan ◽  
Einar Steingrímsson

Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to $(2+2)$-free posets and various other combinatorial structures. We study pattern avoidance in ascent sequences, giving several results for patterns of lengths up to 4, for Wilf equivalence and for growth rates. We establish bijective connections between pattern avoiding ascent sequences and various other combinatorial objects, in particular with set partitions. We also make a number of conjectures related to all of these aspects.


10.37236/1804 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Sergi Elizalde

We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two statistics. Some cases are generalized to patterns of arbitrary length. For avoidance of one single pattern we give partial results. We also describe the distribution of these statistics in involutions avoiding any subset of patterns of length 3. The main technique is to use bijections between pattern-avoiding permutations and certain kinds of Dyck paths, in such a way that the statistics in permutations that we study correspond to statistics on Dyck paths that are easy to enumerate.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Joel Brewster Lewis

International audience We give bijective proofs of pattern-avoidance results for a class of permutations generalizing alternating permutations. The bijections employed include a modified form of the RSK insertion algorithm and recursive bijections based on generating trees. As special cases, we show that the sets $A_{2n}(1234)$ and $A_{2n}(2143)$ are in bijection with standard Young tableaux of shape $\langle 3^n \rangle$. Alternating permutations may be viewed as the reading words of standard Young tableaux of a certain skew shape. In the last section of the paper, we study pattern avoidance in the reading words of standard Young tableaux of any skew shape. We show bijectively that the number of standard Young tableaux of shape $\lambda / \mu$ whose reading words avoid $213$ is a natural $\mu$-analogue of the Catalan numbers. Similar results for the patterns $132$, $231$ and $312$. Nous présentons des preuves bijectives de résultats pour une classe de permutations à motifs exclus qui généralisent les permutations alternantes. Les bijections utilisées reposent sur une modification de l'algorithme d'insertion "RSK" et des bijections récursives basées sur des arbres de génération. Comme cas particuliers, nous montrons que les ensembles $A_{2n}(1234)$ et $A_{2n}(2143)$ sont en bijection avec les tableaux standards de Young de la forme $\langle 3^n \rangle$. Une permutation alternante peut être considérée comme le mot de lecture de certain skew tableau. Dans la dernière section de l'article, nous étudions l'évitement des motifs dans les mots de lecture de skew tableaux généraux. Nous montrons bijectivement que le nombre de tableaux standards de forme $\lambda / \mu$ dont les mots de lecture évitent $213$ est un $\mu$-analogue naturel des nombres de Catalan. Des résultats analogues sont valables pour les motifs $132$, $231$ et $312$.


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Samuele Giraudo

International audience We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed animals, etc. We also retrieve some known operads: the magmatic operad, the commutative associative operad, and the diassociative operad.


10.37236/1173 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Joel Brewster Lewis

We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern $2143$.  We use a generating tree approach to construct a recursive bijection between the set $A_{2n}(2143)$ of alternating permutations of length $2n$ avoiding $2143$ and the set of standard Young tableaux of shape $\langle n, n, n\rangle$, and between the set $A_{2n + 1}(2143)$ of alternating permutations of length $2n + 1$ avoiding $2143$ and the set of shifted standard Young tableaux of shape $\langle n + 2, n + 1, n\rangle$.  We also give a number of conjectures and open questions on pattern avoidance in alternating permutations and generalizations thereof.


2010 ◽  
Vol 117 (7) ◽  
pp. 884-909 ◽  
Author(s):  
Mireille Bousquet-Mélou ◽  
Anders Claesson ◽  
Mark Dukes ◽  
Sergey Kitaev

Sign in / Sign up

Export Citation Format

Share Document