A direct encoding of Stoimenow's matchings as ascent sequences

Details A direct encoding of Stoimenow's matchings as ascent sequences A direct encoding of Stoimenow's matchings as ascent sequences

2009-10-08

arxiv.org/abs/0910.1619v1

Mathematics

Combinatorics

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A direct encoding of Stoimenow's matchings as ascent sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A direct encoding of Stoimenow's matchings as ascent sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A direct encoding of Stoimenow's matchings as ascent sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50491