Independence Polynomials of 2-step Nilpotent Lie Algebras

arXiv:2504.19836 · math.RA, math.CO, quant-ph · Submitted 2025-04-28 · Read on arXiv

math.RA, math.CO, quant-ph

Submitted: 2025-04-28

Updated: 2026-05-12

Terminology

• Hypergraph — 10× in this paper · explained in 2 episodes
• Generalization — 8× in this paper · explained in 13 episodes
• Adjacency Matrix — 2× in this paper · explained in 1 episode
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

Related papers

• On the positive semidefinteness of a class of Hermitian Cauchy-like matrices
• Polynomial Algorithms for Simultaneous Unitary Similarity and Equivalence