Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.12467

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

Umesh Shankar
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recurrences of the form \begin{equation*} T(n,k) = (αn+βk +γ) \ T(n-1,k) + (α'n+β'k+γ')\ T(n-1,k-1)+δ_{n,0}δ_{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) = (αn+βk +γ)^l \ T(n-1,k) + (α'n+β'k+γ')^l\ T(n-1,k-1)+δ_{n,0}δ_{k,0}. \end{equation*} where $l$ 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 recurrence stated above, to be log-concave. We show that our sufficient condition is satisfied by many of the classical examples, thereby giving a new unified approach to proving their log-concavity. This sufficient condition also confirms a conjecture of Tankosic about the log-concavity of generalised Lah numbers. Our main technique will be to interpret the triangular array $(T(n,k))$ as weighted lattice paths and produce an injection that is increasing in weight. Finally, we introduce a two-parameter generalisation of the Eulerian numbers analogous to the generalised Stirling and Lah counterparts. We prove that this sequence is palindromic and make some remarks about their gamma-nonnegativity and real-rootedness.

Explore related subjects

math.COmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Umesh Shankar. 2025-08-17. Log-concavity of rows of triangular arrays satisfying a certain super-recurrence. https://arxiv.org/abs/2508.12467

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗