Efficient counting and asymptotics of k-noncrossing tangled diagrams.
Chen, William Y.C. ; Qin, Jing ; Reidys, Christian M. ; Zeilberger, Doron
The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:129762 
@article{05541102,
     title = {Efficient counting and asymptotics of },
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {16},
     year = {2009},
     zbl = {1159.05027},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05541102}
}

Chen, William Y.C.; Qin, Jing; Reidys, Christian M.; Zeilberger, Doron. Efficient counting and asymptotics of . The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009) . http://gdmltest.u-ga.fr/item/05541102/