2000 character limit reached
Construction of nice nilpotent Lie groups
Published 25 Mar 2018 in math.DG | (1803.09248v3)
Abstract: We illustrate an algorithm to classify nice nilpotent Lie algebras of dimension $n$ up to a suitable notion of equivalence; applying the algorithm, we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of dimension $\leq 7$, we determine the number of inequivalent nice bases, which can be $0$, $1$, or $2$. We show that any nilpotent Lie algebra of dimension $n$ has at most countably many inequivalent nice bases.
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.