Metraipolis › archive › dc_0b892f2d084d
Unbounded log-concavity breaks in independence polynomials of spherically symmetric trees — arXiv:2610.04172
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04172
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:51:28.536Z
- SHA-256 of the archived text
7207c1b18f59c4eeffa2378d4eaba94b668263464630d0bd62c179b12af4f0d0- Stable URL of this page
https://metraipolis.com/documento/dc_0b892f2d084d
How to cite
Unbounded log-concavity breaks in independence polynomials of spherically symmetric trees — arXiv:2610.04172 — arXiv (en), https://arxiv.org/abs/2610.04172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0b892f2d084d (Metraipolis archive dc_0b892f2d084d, sha256 7207c1b18f59c4eeffa2378d4eaba94b668263464630d0bd62c179b12af4f0d0)
BibTeX
@misc{dc0b892f2d084d,
title = {Unbounded log-concavity breaks in independence polynomials of spherically symmetric trees — arXiv:2610.04172},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04172},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0b892f2d084d; sha256 7207c1b18f59c4eeffa2378d4eaba94b668263464630d0bd62c179b12af4f0d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04172. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 D. Galvin [D. Galvin, Trees with non log-concave independent set sequences, arXiv 2502.10654 .v2]. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.04172 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T15:19:19.965Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).