Search arXivSearch

arXiv · 2604.14391

Log-Concavity and Infinite Log-Concavity of Linear Recurrent Sequences with Linear Coefficients via Companion Matrix Methods

Abstract

We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in companion-matrix form $\mathbf{v}_{n+1} = M_n\,\mathbf{v}_n$ with $M_n = nA + B$, we show that the log-concave operator value $\mathcal{L}(a_n) = b_n \coloneqq a_n^2 - a_{n+1}a_{n-1}$ is a quadratic form in the state vector $\mathbf{v}_n$, and identify the matrix $Q_n = Q^{(0)} + nQ^{(1)}$ whose positive semi-definiteness gives a sufficient condition for log-concavity. For the class of second-order recurrences with constant coefficients, we prove a tight (necessary and sufficient) criterion for the sequence to be $\infty$-log-concave, a consequence of the fact that $\mathcal{L}(a_n)$ is itself a geometric sequence so that $\mathcal{L}^2(a_n) = 0$ identically. We obtain analogous tight criteria for sequences fixed by $\mathcal{L}$, and for P-recursive sequences satisfying a dominant-root asymptotic behaviour. We leave some further insight in case this criteria break down in full generality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Piero Giacomelli. 2026-04-15. Log-Concavity and Infinite Log-Concavity of Linear Recurrent Sequences with Linear Coefficients via Companion Matrix Methods. https://arxiv.org/abs/2604.14391

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

KEEP EXPLORING

Related papers

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

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