arXiv Analytics

Sign in

arXiv:2010.06550 [math.CO]AbstractReferencesReviewsResources

Connected Chord Diagrams and the Combinatorics of Asymptotic Expansions

Ali Assem Mahmoud, Karen Yeats

Published 2020-10-13Version 1

In this article we study an asymptotic expansion for $C_n$, the number of connected chord diagrams on $n$ chords. The expansion is obtained in earlier work by means of alien derivatives applied to the generating series of connected chord diagrams; we seek a combinatorial interpretation. The main outcome presented here is a new combinatorial interpretation for entry \href{https://oeis.org/A088221}{A088221} of the OEIS. We will show that \href{https://oeis.org/A088221}{A088221} counts pairs of connected chord diagrams (allowing empty diagrams). This gives a combinatorial interpretation for the part of the closed form of the asymptotic expansion of $C_n$.

Related articles: Most relevant | Search more
arXiv:math/0606346 [math.CO] (Published 2006-06-14, updated 2007-05-18)
On the combinatorics of hypergeometric functions
arXiv:2009.12688 [math.CO] (Published 2020-09-26)
An Asymptotic Expansion for the Number of 2-Connected Chord Diagrams
arXiv:1406.3162 [math.CO] (Published 2014-06-12, updated 2014-06-24)
A combinatorial interpretation of the $κ^{\star}_{g}(n)$ coefficients