Crossings and nestings in tangled diagrams (Q1010810): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0710.4053 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:33, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Crossings and nestings in tangled diagrams |
scientific article |
Statements
Crossings and nestings in tangled diagrams (English)
0 references
7 April 2009
0 references
Summary: A tangled diagram on \([n]=\{1,\dots,n\}\) is a labeled graph for which each vertex has degree at most two. The vertices are arranged in increasing order on a horizontal line and the arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Generalizing the construction of Chen et al., we give a bijection between generalized vacillating tableaux with less than \(k\) rows and \(k\)-noncrossing tangled diagrams. We show that the numbers of \(k\)-noncrossing and \(k\)-nonnesting tangled diagrams are equal and we enumerate \(k\)-noncrossing tangled diagrams. Finally, we show that braids, a special class of tangled diagrams, facilitate a bijection between 2-regular \(k\)-noncrossing partitions and \(k\)-noncrossing enhanced partitions.
0 references
tangled diagram
0 references
labeled graph
0 references
vacillating tableaux
0 references