2000 character limit reached
Abelian Factor in 2-step Nilpotent Lie Algebras Constructed from Graphs
Published 19 Aug 2022 in math.DG | (2208.09541v2)
Abstract: We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian factor in these Lie algebras. Furthermore, we explicitly compute the abelian factor of the 2-step nilpotent Lie algebras associated with some families of graphs such as star graphs, cycles, Schreier graphs, and properly edge-colored graphs. We also study the singularity properties of these Lie algebras in certain cases.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.