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.
Higher dimensional discrete Cheeger inequalities
2 Pith papers cite this work, alongside 13 external citations. Polarity classification is still indexing.
2
Pith papers citing it
13
external citations · OpenAlex
years
2026 2representative citing papers
Any spectral diagnostic that depends only on singular values or the symmetric part of a degree-normalized attention matrix is invariant under transpose, so it cannot see the direction of information flow.
citing papers explorer
-
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.
-
Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics
Any spectral diagnostic that depends only on singular values or the symmetric part of a degree-normalized attention matrix is invariant under transpose, so it cannot see the direction of information flow.