38 citations · 125 across the 18 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009
Enumeration of non-crossing pairings on bit strings
Todd Kemp, Karl Mahlburg, Amarpreet Rattan +1
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1}…
math.NT2009★ 38 cited
Asymptotics for rank and crank moments
K. Bringmann, K. Mahlburg, R. Rhoades
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harm…