arXiv (OAI Expanded)
open access
Improved Bounds for the Bilu--Linial Conjecture via Spectral Recovery from Mixed Determinantal Polynomials
The Bilu--Linial conjecture asks whether every finite $d$-regular graph with $d \geq 2$ admits an edge signing $σ$ whose signed adjacency matrix $A_σ$ has spectral radius at most $2\sqrt{d-1}$. We prove that every signing meeting the mixed-root condition $r_{A_σ}\leq\sqrt{2(d-1)}$ satisfies \[ ρ(A
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
- A Truncated Singular-Value Bound for Spectral Variation of Normal Matrices#986950
- On the Brouwer-type Conjecture for Signless Laplacian Eigenvalues of Graphs#1106054
- Maximization of the first Laplace eigenvalue of a finite graph II#971672
- 47 U.S.C. § 925 — Distribution of frequencies by Commission#597796
- A Polynomial-Time Strict-Sub-One-Third Approximation Theorem for Bimatrix Games#1119836
Record · ID 1109686
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