Efficient counting and asymptotics of \(k\)-noncrossing tangled diagrams

zbMath1159.05027arXiv0802.3491MaRDI QIDQ1010947

Doron Zeilberger, Jing Qin, Christian M. Reidys, William Y. C. Chen

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.3491

zbMATH Keywords

asymptotic formulaarcslabeled graphcrossingsnestingshorizontal linenoncrossing tangled diagrams

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Asymptotics for the number of walks in a Weyl chamber of typeB

Uses Software

• TANGLE

This page was built for publication: Efficient counting and asymptotics of \(k\)-noncrossing tangled diagrams