Article thumbnail


By William Y. C. Chen, Jing Qin, Christian and M. Reidys


Abstract. 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 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. 1

OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.