Lorentzian polynomials and the independence sequences of graphs
Bulletin of the London Mathematical Society · 2025-04 · 57 (4) · 1305-1323
DOI: 10.1112/blms.70031 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 25.02.2025. Verfasst von Amire Bendjeddou und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 26 Literaturangaben.
Abstract (Originalsprache)
We study the multivariate independence polynomials of graphs and the log‐concavity of the coefficients of their univariate restrictions. Let be the operator defined on simple and undirected graphs which replaces each edge with a caterpillar of size 4. We prove that all graphs in the image of are what we call pre‐Lorentzian, that is, their multivariate independence polynomial becomes Lorentzian after appropriate manipulations. In particular, as pre‐Lorentzian graphs have log‐concave (and therefore unimodal) independence sequences, our result makes progress on a conjecture of Alavi, Malde, Schwenk and Erdős which asks if the independence sequence of trees or forests is unimodal.
Zitieren
APA
Bendjeddou, A., & Hardiman, L. (2025). Lorentzian polynomials and the independence sequences of graphs. Bulletin of the London Mathematical Society, 57(4), 1305-1323. https://doi.org/10.1112/blms.70031
Vancouver
Bendjeddou A, Hardiman L. Lorentzian polynomials and the independence sequences of graphs. Bulletin of the London Mathematical Society. 2025;57(4):1305-1323. doi:10.1112/blms.70031
BibTeX
@article{Bendjeddou2025,
author = {Bendjeddou, Amire and Hardiman, Leonard},
title = {Lorentzian polynomials and the independence sequences of graphs},
journal = {Bulletin of the London Mathematical Society},
year = {2025},
volume = {57},
number = {4},
pages = {1305--1323},
doi = {10.1112/blms.70031}
}
EUVIMED