Efficient counting and asymptotics of $k$-noncrossing tangled diagrams.

Chen, William Y.C., et al. "Efficient counting and asymptotics of -noncrossing tangled diagrams.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R37, 8 p.-Research Paper R37, 8 p.. <http://eudml.org/doc/129762>.

@article{Chen2009,
author = {Chen, William Y.C., Qin, Jing, Reidys, Christian M., Zeilberger, Doron},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {noncrossing tangled diagrams; labeled graph; horizontal line; arcs; crossings; nestings; asymptotic formula},
language = {eng},
number = {1},
pages = {Research Paper R37, 8 p.-Research Paper R37, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Efficient counting and asymptotics of -noncrossing tangled diagrams.},
url = {http://eudml.org/doc/129762},
volume = {16},
year = {2009},
}

TY - JOUR
AU - Chen, William Y.C.
AU - Qin, Jing
AU - Reidys, Christian M.
AU - Zeilberger, Doron
TI - Efficient counting and asymptotics of -noncrossing tangled diagrams.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R37, 8 p.
EP - Research Paper R37, 8 p.
LA - eng
KW - noncrossing tangled diagrams; labeled graph; horizontal line; arcs; crossings; nestings; asymptotic formula
UR - http://eudml.org/doc/129762
ER -