Proves Cheeger inequalities for persistent up p-Laplacians on complex inclusions, with reductions for pseudomanifolds and comparisons to graph cases.
Klivans and Sayan Mukherjee , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
citing papers explorer
-
Cheeger Inequalities for the Persistent Laplacian
Proves Cheeger inequalities for persistent up p-Laplacians on complex inclusions, with reductions for pseudomanifolds and comparisons to graph cases.
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.