OpenAlex ·
Unimodality of Independence Polynomials for Sufficiently Large Forests
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.20961
- Original
- Read it at the publisher
- Topics
Abstract
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.
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.
More in Computational Complexity
Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis
Exponentially Larger Deletion-Correcting Codes and Constant-List-Decodable Insertion-Deletion Codes
Improved Algorithms for Beck--Fiala with Bounded Sets
Induced packing treewidth II. Excluding a clique or a biclique
Sharp spectral norm concentration of sparse random tensors
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.