Statistics on Linear Chord Diagrams

DOI10.23638/DMTCS-21-2-11MaRDI QIDQ6314541FDOQ6314541

Authors: Naiomi T. Cameron, Kendra Killpatrick 

Publication date: 24 February 2019

Abstract: Linear chord diagrams are partitions of $left[2night]$ into $n$ blocks of size two called chords. We refer to a block of the form $i,i+1$ as a short chord. In this paper, we study the distribution of the number of short chords on the set of linear chord diagrams, as a generalization of the Narayana distribution obtained when restricted to the set of noncrossing linear chord diagrams. We provide a combinatorial proof that this distribution is unimodal and has an expected value of one. We also study the number of pairs $(i,i+1)$ where $i$ is the minimal element of a chord and $i+1$ is the maximal element of a chord. We show that the distribution of this statistic on linear chord diagrams corresponds to the second-order Eulerian triangle and is log-concave.

This page was built for publication: Statistics on Linear Chord Diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314541)