Search arXivSearch

arXiv · 2603.14204

Linear recurrences for non-log-concave independence polynomials of trees

Abstract

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these polynomials. As a consequence, we prove that the set of non-isolated limit points of their zeros lies on the circle $|z+1/3|=1/3$ in the complex plane. Building on these recurrences, we also exhibit infinite families of trees whose independence polynomials break log-concavity at one, two, and three consecutive indices, as well as finite families that break log-concavity at four and five consecutive indices. Our approach suggests that arbitrarily many consecutive breaks may be achievable, offering further insight into a question posed by Galvin [D. Galvin, Trees with non log-concave independent set sequences, arXiv:2502.10654v1, 2025].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

César Bautista-Ramos, Carlos Guillén-Galván, Paulino Gómez-Salgado. 2026-03-15. Linear recurrences for non-log-concave independence polynomials of trees. https://arxiv.org/abs/2603.14204

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO