Metraipolis › archive › dc_eed6e7f44aab

Unimodality of Independence Polynomials for Sufficiently Large Forests — arXiv:2609.20961

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20961
License (as archived)
CC0-1.0
Archived
2026-10-10T02:07:21.798Z
SHA-256 of the archived text
25a0d9edc0938eda1a454c8e6f7aba39ef1b1e0c9e047237f2760864afff009c
Stable URL of this page
https://metraipolis.com/documento/dc_eed6e7f44aab

How to cite

Unimodality of Independence Polynomials for Sufficiently Large Forests — arXiv:2609.20961 — arXiv (en), https://arxiv.org/abs/2609.20961 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eed6e7f44aab (Metraipolis archive dc_eed6e7f44aab, sha256 25a0d9edc0938eda1a454c8e6f7aba39ef1b1e0c9e047237f2760864afff009c)
BibTeX
@misc{dceed6e7f44aab,
  title = {Unimodality of Independence Polynomials for Sufficiently Large Forests — arXiv:2609.20961},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20961},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eed6e7f44aab; sha256 25a0d9edc0938eda1a454c8e6f7aba39ef1b1e0c9e047237f2760864afff009c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20961. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that the independence sequence of every sufficiently large forest is unimodal. The result follows from establishing log-concavity on a central interval of the sequence, along with monotonicity of the initial and final segments. The main analytic step is a central limit theorem for the size of a random independent set sampled with the hard-core model, uniform over all forests and over an interval of positive fugacities.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.PR).
Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.20961 — 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-10T01:47:50.216Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).