On the asymptotic behavior of unimodal rank generating functions (Q892346): Difference between revisions

An integer sequence is unimodal if there is a peak in the sequence. Let \(u(n)\) denote the number of unimodal sequences of the form \[ a_1\leq a_2\leq\cdots\leq a_r\leq \bar{c}\geq b_1\geq b_2\geq\cdots\geq b_s \tag{*} \] with weight \(n=c+\sum_{j=1}^ra_j+\sum_{j=1}^sb_j\). In this context, we define the rank of such unimodal sequence to be \(s-r\), and we assume that the rank of the empty sequence is \(0\). Let \(v(n)\) denote the number of unimodal sequences of the form \((*)\), where \(\sum_jb_j\) is a partition into parts at most \(c - k\) and \(k\) is the size of the Durfee square of the partition \(\sum_ja_j\). Let \(w(n)\) denote the number of unimodal sequences of the form \[ a_1\leq a_2\leq\cdots\leq a_r\leq \bar{c}\geq b_1\geq b_2\geq\cdots\geq b_s \] with weight \(n=2c+\sum_{j=1}^ra_j+\sum_{j=1}^sb_j\). Let \(u (m, n)\), \(v (m, n)\) and \(w(m,n)\) denote the number of sequences counted by \(u(n)\), \(v (n)\) and \(w(n)\) with rank \(m\), respectively. Let \(\nu(n)\) denote the number of unimodal sequences of the form (*) where \(c\) has to be odd, \(\sum_ja_j\) is a partition without repeated even parts, and \(\sum_jb_j\) is an overpartition into odd parts whose largest part is not \(c\). Define the rank of a sequence counted by \(\nu(n)\) to be the number of odd non-overlined parts in \(\sum_jb_j\) minus the number of odd parts in \(\sum_ja_j\), where we assume that the empty sequence has rank \(0\). Let \(\nu(m, n)\) denote the number of sequences counted by \(\nu(n)\) with rank \(m\). This paper shows that for non-negative integers \(m\) and \(j\) with \(m > j\), the following inequalities \(u(j, n) > u(m, n)\), \(w(j, n) > w(m, n)\), \(v(j, n) > v(m, n)\), \(\nu(j, n) > \nu(m, n)\) hold for all sufficiently large integers \(n\).