arXiv (All)
open access
Low discrepancy and spectral gap for directed hypergraphs via spectral regularity lemma for tensors
We show that low discrepancy is equivalent to spectral gap for directed $k$-uniform hypergraphs. For undirected hypergraphs this recovers a theorem of Lenz and Mubayi, with a considerably shorter proof. At the heart of our argument is a Frieze--Kannan type spectral regularity lemma for hypergraphs b
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
- Arbitrary Spectral Edge of Regular Graphs#785043
- Arbitrary Spectral Edge of Regular Graphs#783453
- Some results for range of random walk on graph with spectral dimension two#139035
- Edge co-occurrence regularization for node classification#403861
- Microlocal analysis and spectral gap for complex hyperbolic manifolds#1076509
Record · ID 1142217
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