Non-associative gröbner bases, finitely-presented lie rings and the engel condition

ABSTRACT

We give an algorithm for constructing a basis and a multiplication table of a finite-dimensional finitely-presented Liering. We apply this to construct the biggest t generator Lie rings that satisfy the n-Engel condition, for (t,n) = (t,2), (2,3), (3,3), (2,4).

REFERENCES

• 1: William W. Adams and Philippe Loustaunau. An introduction to Gröbner bases, volume 3 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 1994.
• 2: The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.4, 2004. (http://www.gap-system.org).
• 3: Lothar Gerritzen. Tree polynomials and non-associative Gröbner bases. J. Symbolic Comput., 41(3-4):297--316, 2006.
• 4: W. A. de Graaf. Lie Algebras: Theory and Algorithms, volume 56 of North-Holland Mathematical Library. Elsevier Science, 2000.
• 5: W. A. de Graaf , J. Wisliceny, Constructing bases of finitely presented Lie algebras using Gröbner bases in free algebras, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.37-43, July 28-31, 1999, Vancouver, British Columbia, Canada [doi>10.1145/309831.309853]
• 6: George Havas , M. F. Newman , M. R. Vaughan-Lee, A nilpotent quotient algorithm for graded Lie rings, Journal of Symbolic Computation, v.9 n.5-6, p.653-664, May/June 1990 [doi>10.1016/S0747-7171(08)80080-6]
• 7: P. J. Higgins. Lie rings satisfying the Engel condition. Proc. Cambridge Philos. Soc., 50:8--15, 1954.
• 8: B. Huppert and N. Blackburn. Finite Groups II. Springer Verlag, New York, Heidelberg, Berlin, 1982.
• 9: A. I. Kostrikin. Around Burnside, volume 20 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) {Results in Mathematics and Related Areas (3)}. Springer-Verlag, Berlin, 1990. Translated from the Russian and with a preface by James Wiegold.
• 10: M. A. A. van Leeuwen and M. Roelofs. Termination for a class of algorithms for constructing algebras given by generators and relations. J. Pure Appl. Algebra, 117/118:431--445, 1997.
• 11: M. F. Newman, E. A. O'Brien, and M. R. Vaughan-Lee. Groups and nilpotent Lie rings whose order is the sixth power of a prime. J. Algebra, 278(1):383--401, 2004.
• 12: E. A. O'Brien and M. R. Vaughan-Lee. The groups with order p7 for odd prime p. J. Algebra, 292(1):243--258, 2005.
• 13: Saeed Rajaee. Non-associative Gröbner bases. J. Symbolic Comput., 41(8):887--904, 2006.
• 14: C. Schneider. Computing nilpotent quotients in finitely presented Lie rings. Discrete Math. Theor. Comput. Sci., 1(1):1--16 (electronic), 1997.
• 15: C. C. Sims. Computation with Finitely Presented Groups. Cambridge University Press, Cambridge, 1994.
• 16: Gunnar Traustason. Engel Lie-algebras. Quart. J. Math. Oxford Ser. (2), 44(175):355--384, 1993.
• 17: Gunnar Traustason. A polynomial upper bound for the nilpotency classes of Engel-3 Lie algebras over a field of characteristic 2. J. London Math. Soc. (2), 51(3):453--460, 1995.
• 18: M. R. Vaughan-Lee. On Zel'manov's solution of the restricted Burnside problem. J. Group Theory, 1(1):65--94, 1998.
• 19: M. R. Vaughan-Lee. Lie methods in group theory. In Groups St. Andrews 2001 in Oxford. Vol. II, volume 305 of London Math. Soc. Lecture Note Ser., pages 547--0585. Cambridge Univ. Press, Cambridge, 2003.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis

General Terms:
Algorithms

Keywords:
engel condition, gröbner basis, lie ring