Enumeration of non-crossing pairings on bit strings

  • Authors:

  • Todd Kemp;Karl Mahlburg;Amarpreet Rattan;Clifford Smyth

  • Affiliations:

  • Department of Mathematics, UCSD, 9500 Gilman Drive, La Jolla, CA 92093-0112, United States;Department of Mathematics, Princeton University, Washington Rd, Princeton, NJ 08540, United States;Department of Mathematics, University of Bristol, University Walk, Bristol, BS8 1TW, UK;Mathematics and Statistics Department, University of North Carolina Greensboro, 116 Petty Building, Greensboro, NC 27402, United States

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A non-crossing pairing on a bit string is a matching of 1s and 0s in the string with the property that the pairing diagram has no crossings. For an arbitrary bit-string w=1^p^"^10^q^"^1...1^p^"^r0^q^"^r, let @f(w) be the number of such pairings. This enumeration problem arises when calculating moments in the theory of random matrices and free probability, and we are interested in determining useful formulas and asymptotic estimates for @f(w). Our main results include explicit formulas in the ''symmetric'' case where each p"i=q"i, as well as upper and lower bounds for @f(w) that are uniform across all words of fixed length and fixed r. In addition, we offer more refined conjectural expressions for the upper bounds. Our proofs follow from the construction of combinatorial mappings from the set of non-crossing pairings into certain generalized ''Catalan'' structures that include labeled trees and lattice paths.