OpenAlex ·

Unbounded log-concavity breaks in independence polynomials of spherically symmetric trees

César Bautista-Ramos

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.04172
Original
Read it at the publisher
Topics
Computational ComplexityCombinatorics

Abstract

Using a dioid algebraic structure, we show that there exist spherically symmetric trees $T(2^m 1^n)$ whose independence polynomials exhibit multiple breaks in log-concavity, a result established by estimating the asymptotic growth of the coefficients of these polynomials. Provided the parameter $n$ is a sufficiently large odd integer, the number of breaks is bounded below by the Jacobsthal numbers. This result affirmatively answers a question raised by F. Bencs [D. Galvin, Trees with non log-concave independent set sequences, arXiv 2502.10654.v2].

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics