arXiv (All)
open access
Linear recurrences for non-log-concave independence polynomials of trees
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these polynomials. As a consequence, we prove that the set of non
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Average Sizes of Ideals and Antichains in Some Infinite Families of Posets#1188257
- Tree-independence number of $P_5$-free graphs with no large bicliques#1035482
- Computing the Helly Number, Radon Number and Rank in Cycle Convexity#1119309
- Convergence and compactness of discrete aggregation trees#1070568
- Randomly perturbed digraphs also have bounded-degree spanning trees#206107
Record · ID 1389222
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive