A direct encoding of Stoimenow's matchings as ascent sequences
Combinatorics
2009-10-12 v1
Abstract
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.
Cite
@article{arxiv.0910.1619,
title = {A direct encoding of Stoimenow's matchings as ascent sequences},
author = {Anders Claesson and Mark Dukes and Sergey Kitaev},
journal= {arXiv preprint arXiv:0910.1619},
year = {2009}
}
Comments
11 pages