2000 character limit reached
Universal equivalence of partially commutative metabelian Lie algebras
Published 3 Jul 2011 in math.RA and math.GR | (1107.0430v5)
Abstract: In this paper, we find a criterium for universal equivalence of partially commutative Lie algebras whose defining graphs are trees. Besides, we obtain bases for partially commutative metabelian Lie algebras.
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.