Non-p-recursiveness of Numbers of Matchings or Linear Chord Diagrams with Many Crossings

Abstract

The number conn counts matchings X on {1, 2, . . . , 2n}, which are partitions into n two-element blocks, such that the crossing graph of X is connected. Similarly, cron counts matchings whose crossing graph has no isolated vertex. (If it has no edge, Catalan numbers arise.) We apply generating functions techniques and prove, using a more generally… (More)

Topics

  • Presentations referencing similar topics