Unimodality of the Rank on Strongly Unimodal Sequences

TL;DR

This paper proves the strong unimodality of a sequence counting strongly unimodal sequences with fixed sum, providing evidence for a conjecture and offering new combinatorial interpretations and bounds for related partition statistics.

Contribution

It establishes the strong unimodality of the sequence u(m,n), supporting a conjecture, and introduces a new combinatorial interpretation of ospt(n).

Findings

Proves u(m,n)>u(m+1,n) for specified conditions.

Provides a new combinatorial interpretation of ospt(n).

Derives a lower bound and asymptotic formula for ospt(n).

Abstract

Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and $\sum_{i=1}^{\ell} a_i=n$. Bringmann, Jennings-Shaffer, Mahlburg and Rhoades conjectured that $\{u(m,n)\}_m$ is strongly log-concave for any fixed $n$. Motivated by this conjecture, in this paper we prove the strongly unimodality of $\{u(m,n)\}_m$, that is $u(m,n)>u(m+1,n)$ for $m\ge 0$ and $n\ge \max\{6,{m+2\choose 2}\}$. This result gives supportive evidence for the above conjecture. Moreover, we find a combinatorial interpretation of $u(m,n)$, which leads to a new combinatorial interpretation of ${\rm ospt}(n)$. Furthermore, using this new combinatorial interpretation, a lower bound and an asymptotic formula on ${\rm ospt}(n)$ will be presented.