12 citations · 30 across the 13 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.RA2025
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
Let be fixed. We study the integer lower bound obtained by inverting the classical counting inequality for Turán systems. For a -uniform hypergraph with ve…