Extends graph independence polynomials to 2-step nilpotent Lie algebras, provides bounds on independence numbers and abelian subalgebra dimensions, and adds a quantum-inspired metric version.
Karp, Reducibility among combinatorial problems , Complexity of computer computa- tions (Proc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Independence Polynomials of 2-step Nilpotent Lie Algebras
Extends graph independence polynomials to 2-step nilpotent Lie algebras, provides bounds on independence numbers and abelian subalgebra dimensions, and adds a quantum-inspired metric version.