Some results on a class of polynomials related to convolutions of the Catalan sequence (Q2454097)

This paper investigates the combinatorial aspects of the monic polynomials \[ S_n(x)= \sum_{i=0}^{n}\frac{2i+2}{n+2+i} \binom{2n+1}{n-i} x^i, n \geq 0 , \] whose coefficients were proved, by the same authors [Mediterr. J. Math. 10, No. 4, 1609--1630 (2013; Zbl 1279.33014); erratum ibid. 10, No. 4, 1613 (2013)], to be the \(k\)-fold convolutions of the Catalan numbers sequence for \(k\) even. Here the authors study new properties of \(S_n(x)\), establishing the irreducibility of some of their infinite subsets and obtaining a generating function of the Catalan number sequence (and all its convolutions) in terms of a simple rational function in two variables. The paper is organized as follows. The \textit{Introduction} explains the main achievements and the principal tools in the paper. The authors invite to deepen the knowledge of the Catalan numbers through the works of \textit{P. Hilton} and \textit{J. Pedersen} [Math. Intell. 13, No. 2, 64--75 (1991; Zbl 0767.05010)] and \textit{R. P. Stanley} [Enumerative combinatorics. Volume 2. Cambridge: Cambridge University Press (1999; Zbl 0928.05001)]. Section 2 establishes that all the polynomials \(S_n(x)\) have no multiple roots and, furthermore, \(S_n(x)\) of even degree have no real roots whereas those of odd degree have exactly one root. In the proof, the authors employ a result due to \textit{J. J. Sylvester} [The Collected Mathematical Papers. Volume I: (1837--1853). Cambridge: At the University Press (1904; JFM 35.0020.01)] about signature and rank of the Bezoutian matrices associated to the roots of monic polynomials via the Newton's symmetric functions, together with other known matrix rules such as the \textit{good property}, the \textit{Laplace expansion} and the theorems of Jacobi and Frobenius illustrated, e.g., in [\textit{F. R. Gantmakher}, The theory of matrices. (in Russian). Moscow: Gosudarstv. Izdat. Tekhn.-Teor. Lit. (1953; Zbl 0050.24804)]. Section 3 recalls the works of \textit{V. V. Prasolov} [Polynomials. Berlin: Springer (2004; Zbl 1063.12001)] and \textit{J. H. Wahab} [Duke Math. J. 19, 165--176 (1952; Zbl 0049.29602)] to remark the importance of a theorem, from \textit{G. Dumas} [J. Math. Pures Appl. (6) 2, 191--258 (1906; JFM 37.0096.01)], used to explore the irreducibility of \(S_n(x)\). Section 4 applies Eisenstein's criterion described by \textit{H. L. Dorwart} [Am. Math. Mon. 42, 369--381 (1935; Zbl 0011.38801)] and a theorem of \textit{J. W. L. Glaisher} [Q. J. Math. 30, 150--156 (1899; JFM 29.0152.03)] in order to prove the irreducibility, over the integers, of the polynomials \(S_n(x)\) when \(n=2^r-1\) with \(r \geq 1\) or \(n\) is even with \(2n+1\) prime. Section 5 collects some evidence excluding the rationality of the unique real roots of the odd degree polynomials \(S_n(x)\) which would prove their irreducibility. Moreover, the authors conjecture that \(p\) is an odd prime if and only if \(S_p(x)=x^p+(p-1)x^{p-2}+2 \pmod p\) and they notice that, according to \textit{R. Church} [Ann. Math. (2) 36, 198--209 (1935; Zbl 0011.00501)], such polynomial is not reducible for \(p=5\).