Conjecture for Stirling cycle numbers of all orders

From papers

Let C(r)C^{(r)} be the Stirling cycle triangle of order rr, let

Cˇ(r)=(C(r))rev\widecheck{C}^{(r)}=\left(C^{(r)}\right)^{\rm rev}

be the triangle formed by reversing the rows of C(r)C^{(r)}, and let cr,n(x)c_{r,n}(x) be its row-generating polynomials. A sequence of polynomials is coefficientwise Hankel-totally positive in xx when every minor of its Hankel matrix has coefficients that are nonnegative in xx. Conjecture for Stirling cycle numbers of all orders. The following are true: (a) C(r)C^{(r)} is totally positive for all r1r\geq 1. (b) Cˇ(r)\widecheck{C}^{(r)} is totally positive for r=1,2r=1,2 and is not totally positive when r3r\geq 3. (c) The polynomials cr,n(x)c_{r,n}(x) are negative-real-rooted for r=1,2r=1,2 and have non-real complex zeros for r3r\geq 3 and n3n\geq 3. Also, the row sequences of C(r)C^{(r)} are log-concave for 1r51\leq r\leq 5. (d) The sequence (cr,n(x))n0(c_{r,n}(x))_{n\geq 0} is coefficientwise Hankel-totally positive in xx for all r1r\geq 1. These assertions refine the known low-order relationship between Stirling cycle triangles and Eulerian-type triangles; the cases r3r\geq 3 include both failures of row-reversed total positivity and non-real-rootedness, while the total positivity of C(r)C^{(r)} and the Hankel property are asserted for every order.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Bishal Deb and Alan D. Sokal, “Higher-order Stirling cycle and subset triangles: Total positivity, continued fractions and real-rootedness”, arXiv:2507.18959 (2025).

Solutions 0

No solutions have been posted yet.