Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Universal Equivalence of Partially Commutative Metabelian Lie Algebras

Published 24 May 2013 in math.RA | (1305.5805v1)

Abstract: In this paper, we consider partially commutative metabelian Lie algebras whose defining graphs are cycles. We show that such algebras are universally equivalent iff the corresponding cycles have the same length. Moreover, we give an example showing that the class of partially commutative metabelian Lie algebras such that their defining graphs are trees is not separable by universal theory in the class of all partially commutative metabelian Lie algebras.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.