2 papers
math.RA2026
Independence Polynomials of 2-step Nilpotent Lie Algebras
Marco Aldi, Thor Gabrielsen, Daniele Grandini +2
Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently com…
math.CO2025
An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Marco Aldi, Thor Gabrielsen, Daniele Grandini +2
We introduce a lower bound for the independence number of an arbitrary -uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.