Nilpotent Lie algebras of nilpotence class at most three via graphs
math.CO, math.DG
Submitted: 2026-10-25
Updated: 2026-10-25
Comments: 17 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: In this work, we associate with each finite simple graph G a nilpotent Lie algebra n G of class at most three, whose underlying vector space has a basis indexed by the vertices, edges…
Abstract
In this work, we associate with each finite simple graph G a nilpotent Lie algebra n G of class at most three, whose underlying vector space has a basis indexed by the vertices, edges, and paths of length two of G. Its nilpotency class is exactly three if and only if G contains a path of length two. We compute the dimensions of its lower central series and describe its center. Over fields of characteristic different from two, we prove that two such Lie algebras are isomorphic if and only if their underlying graphs are isomorphic. We also give an algebraic description using quotients involving exterior and symmetric squares. Finally, we study balanced blow-ups and prove that n G is a retract of n G(m).
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality