• Corpus ID: 16492464

A direct encoding of Stoimenows matchings as ascent sequences

  title={A direct encoding of Stoimenows matchings as ascent sequences},
  author={Anders Claesson and Mark Dukes and Sergey Kitaev},
  journal={Australas. J Comb.},
In connection with Vassiliev's knot invariants, Stoimenow (1998) introduced certain matchings, also called regular linearized chord diagrams. Bousquet-Melou et al. (2008) gave a bijection from those matchings to unlabeled (2+2)-free posets; they also showed how to encode the posets as so called ascent sequences. In this paper we present a direct encoding of Stoimenow's matchings as ascent sequences. In doing so we give the rules for recursively constructing and deconstructing such matchings. 

Figures from this paper

A note on p-Ascent Sequences

Ascent sequences were introduced by Bousquet-Melou, Claesson, Dukes, and Kitaev in [1], who showed that ascent sequences of length n are in 1-to-1 correspondence with (2+2)-free posets of size n. In

An operator on ascent sequences

The bijection between M-sequences and ascent sequences is built and it is proved that the bijection is well-defined and the ascent sequences of the sum of two matrices are got.

Generalized ballot sequences are ascent sequences

  • M. Dukes
  • Mathematics
    Australas. J Comb.
  • 2016
This note proves the non-trivial fact that generalized ballot sequences are ascent sequences, and introduces a class of permutations that avoid a single length- three bivincular pattern.

Congruences for Taylor expansions of quantum modular forms

Recently, a beautiful paper of Andrews and Sellers has established linear congruences for the Fishburn numbers modulo an infinite set of primes. Since then, a number of authors have proven refined

Partitions and partial matchings avoiding neighbor patterns

Enumerating (2+2)-free posets by indistinguishable elements

A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if

p-Ascent Sequences

A sequence $(a_1, \ldots, a_n)$ of nonnegative integers is an {\em ascent sequence} if $a_0 =0$ and for all $i \geq 2$, $a_i$ is at most 1 plus the number of ascents in $(a_1, \ldots, a_{i-1})$.

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group

: This is an overview of the history of the combinatorics group that was born in Gothenburg, Sweden, in the late 1990s and then lived in Reykjav´ık, Iceland, and now in Glasgow, Scotland.



(2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations


We treat an enumeration problem of chord diagrams, which is shown to yield an upper bound for the dimension of the space of Vassiliev invariants for knots. We give an asymptotical estimate for this