Log-concavity of rows of triangular arrays satisfying a certain super-recurrence
Umesh Shankar

TL;DR
This paper establishes sufficient conditions for the log-concavity of rows in triangular arrays generated by certain super-recurrences, unifying proofs for classical sequences and confirming a conjecture about generalized Lah numbers.
Contribution
It provides a unified framework for proving log-concavity of various combinatorial sequences arising from super-recurrences, including new results for generalized Lah numbers.
Findings
Sufficient conditions for log-concavity of array rows.
Application of lattice path interpretation and injections.
Introduction of a two-parameter generalization of Eulerian numbers.
Abstract
Recurrences of the form \begin{equation*} T(n,k) = (\alpha n+\beta k +\gamma) \ T(n-1,k) + (\alpha'n+\beta'k+\gamma')\ T(n-1,k-1)+\delta_{n,0}\delta_{k,0}. \end{equation*} show up as the recurrence for many well-studied combinatorial sequences such as the Stirling numbers of first and second kind, the Lah numbers, Eulerian numbers etc. Recently, many of these sequences have received generalisations that obey a recurrence of the form \begin{equation*} T(n,k) = (\alpha n+\beta k +\gamma)^l \ T(n-1,k) + (\alpha'n+\beta'k+\gamma')^l\ T(n-1,k-1)+\delta_{n,0}\delta_{k,0}. \end{equation*} where is a positive integer. Many of these generalised sequences also satisfy properties such as unimodality, log-concavity, gamma-nonnegativity, real-rootedness that the original sequences satisfy. In this article, we give sufficient conditions for rows of triangular arrays, arising from the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAntenna Design and Optimization · graph theory and CDMA systems · Cellular Automata and Applications
