Table of Contents
Fetching ...

The Commuting Graphs of Certain Solvable Lie Algebras

Hieu V. Ha, Vu A. Le, Tuan A. Nguyen, Tuyen T. M. Nguyen, Hoa D. Quang

TL;DR

The paper analyzes commuting graphs Γ(ℒ) of solvable Lie algebras, focusing on dimensions up to 4. It proves that under specific conditions on the derived algebra and center, Γ(ℒ) is disconnected with a precise partition into complete components, and it determines exact component counts over finite fields. Using known classifications, it explicitly describes Γ(ℒ) for all 3D noncommutative solvable algebras and all 4D cases, revealing that components are typically complete, windmill, or their unions. The results yield a complete catalog of low-dimensional solvable Lie-algebra commuting graphs and clarify how algebraic structure governs graph connectivity.

Abstract

Let $Z(\cal L)$ be the center of a Lie algebra $\cal L$ with Lie bracket $[\cdot, \cdot]$. %We then define The commuting graph of $\cal L$ is then defined by the simple undirected graph $Γ({\cal L})=(V_{\cal L},E_{\cal L})$ in which the vertex set is $V_{\mathcal L}=\mathcal L \setminus Z(\mathcal L)$ and the set of edges $E_{\cal L}=\left\{ \{x,y\} \mid [x,y] =0 \right\}$. The main purpose of this paper is to accurately describe the connected components of the commuting graph of solvable Lie algebras of dimension at most 4.

The Commuting Graphs of Certain Solvable Lie Algebras

TL;DR

The paper analyzes commuting graphs Γ(ℒ) of solvable Lie algebras, focusing on dimensions up to 4. It proves that under specific conditions on the derived algebra and center, Γ(ℒ) is disconnected with a precise partition into complete components, and it determines exact component counts over finite fields. Using known classifications, it explicitly describes Γ(ℒ) for all 3D noncommutative solvable algebras and all 4D cases, revealing that components are typically complete, windmill, or their unions. The results yield a complete catalog of low-dimensional solvable Lie-algebra commuting graphs and clarify how algebraic structure governs graph connectivity.

Abstract

Let be the center of a Lie algebra with Lie bracket . %We then define The commuting graph of is then defined by the simple undirected graph in which the vertex set is and the set of edges . The main purpose of this paper is to accurately describe the connected components of the commuting graph of solvable Lie algebras of dimension at most 4.

Paper Structure

This paper contains 5 sections, 8 theorems, 26 equations, 4 tables.

Key Result

Lemma 2

Let $\Gamma(\mathcal{L})$ be the commuting graph of a noncommutative Lie algebra $\cal L$ over a field $\mathbb F$. If $C_{\mathcal{L}}$ is a connected component of $\Gamma(\mathcal{L})$ then $\lambda x+ z \in C_{\mathcal{L}}$ for every $\lambda \in \mathbb F^*$, $x \in C_{\mathcal{L}}$, and $z \in

Theorems & Definitions (19)

  • Definition 1
  • Lemma 2
  • Corollary 3
  • Example 4
  • Theorem 5
  • proof
  • Corollary 6
  • proof
  • Lemma 7
  • proof
  • ...and 9 more