Crossings and nesting in tangled-diagrams

Details Crossings and nesting in tangled-diagrams Crossings and nesting in tangled-diagrams

2007-10-22

arxiv.org/abs/0710.4053v2

Mathematics

Combinatorics

13 pages

Scientific paper

A tangled-diagram over $[n]=\{1,...,n\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Generalizing the construction of Chen {\it et.al.} we prove a bijection between generalized vacillating tableaux with less than $k$ rows and $k$-noncrossing tangled-diagrams and study their crossings and nestings. We show that the number of $k$-noncrossing and $k$-nonnesting tangled-diagrams are equal and enumerate tangled-diagrams.

Affiliated with

Also associated with

No associations

Rating

Crossings and nesting in tangled-diagrams 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 Crossings and nesting in tangled-diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Crossings and nesting in tangled-diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358222