Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Pattern avoidance in ascent sequences

Duncan, Paul and Steingrimsson, Einar (2011) Pattern avoidance in ascent sequences. The Electronic Journal of Combinatorics, 18 (1). ISSN 1077-8926

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

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.

Item type: Article
ID code: 40780
Keywords: ascent sequences, pattern avoidance, nonnegative integers, Electronic computers. Computer science, Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
Depositing user: Pure Administrator
Date Deposited: 08 Aug 2012 13:54
Last modified: 05 Sep 2014 17:15
URI: http://strathprints.strath.ac.uk/id/eprint/40780

Actions (login required)

View Item