The nilpotent graph of a finite0-dimensional Lie algebra
David Towers, Ismael Gutierrez, and Luis Fernandez

TL;DR
This paper introduces the nilpotent graph of a finite-dimensional Lie algebra, exploring its properties, structure, and computational aspects, with specific examples and open problems in algebraic graph theory.
Contribution
It defines the nilpotent graph for Lie algebras, characterizes its properties, and provides explicit computations and algorithms, advancing the understanding of algebraic structures through graph theory.
Findings
The nilpotent graph decomposes into components under direct sums.
The graph's connectivity relates to strongly self-centralizing subalgebras.
Explicit structure of the nilpotent graph for (2, \u1EF3_q) is provided.
Abstract
Let be a finite-dimensional Lie algebra over a field . In This paper we introduce the \emph{nilpotent graph} as the graph whose vertices are the elements of , where \[\nil(L) = \{x \in L \mid \langle x, y \rangle \text{ is nilpotent for all } y \in L\},\] and where two vertices are adjacent if the Lie subalgebra they generate is nilpotent. We give some characterizations of and its connection with the hypercenter , for example, they are equal when has characteristic zero. We prove that the nilpotentizer behaves well under direct sums, allowing a decomposition of between components. The paper also investigates the structural and combinatorial properties of , including the conditions under which the graph is connected. We characterize the existence of strongly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · Advanced Topics in Algebra
