We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of vertex-induced subtrees for a particular class of trees. The number of such trees whose poset of vertex-induced subgraphs containing the root is not rank unimodal is determined for a fixed number of vertices $i$.
Bounds on Kronecker and $q$-binomial coefficients
On some series involving the binomial coefficients $\binom{3n}{n}$
There are only a finite number of excluded minors for the class of bicircular matroids
![QR code for arXiv:1810.08235 [math.CO]](http://oss.arxitics.com/images/favicon.svg)