Permanental energy of any m-edge graph is at least 2√m, with equality if and only if the graph is a star plus isolated vertices.
Bunch and John E
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Systematic study of direct and iterative triangular matrix inversion algorithms for Delta-Rule linear transformers, with focus on numerical stability, hardware efficiency, and benchmarks showing 4.3x NPU speedup over SGLang.
citing papers explorer
-
Permanental Energy of Graphs
Permanental energy of any m-edge graph is at least 2√m, with equality if and only if the graph is a star plus isolated vertices.
-
Fast and Stable Triangular Inversion for Delta-Rule Linear Transformers
Systematic study of direct and iterative triangular matrix inversion algorithms for Delta-Rule linear transformers, with focus on numerical stability, hardware efficiency, and benchmarks showing 4.3x NPU speedup over SGLang.