Advertisement

Theorem proving with group presentations: Examples and questions

  • Ursula Martin
Session 5B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)

Abstract

Let G be a group on generators A. We investigate C(G,A), the class of all t-complete rewrite systems for G over A, that is convergent inter-reduced rewrite systems for G which can be proved terminating with a total division ordering on A*. Given G, A and an element > of Tot(A), the total division orderings over A, there is a unique convergent inter-reduced rewrite system for G which can be proved terminating using >. C(G,A) induces a partition of Tot(A), where the complete system T corresponds to the set of all orderings which prove T terminating. We give a collection of examples which illustrate different phenomena which can occur, and indicate some of the natural questions which arise. In particular we investigate how these results extend to subgroups and quotients. [ Rewrite rules, algebra ]

Keywords

Normal Subgroup Word Problem Complete System Quotient Group Symbolic Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ronald V Book and Friedrich Otto, String-rewriting systems, Springer Verlag Texts and Monographs in Computer Science, New York 1993Google Scholar
  2. 2.
    W Bosma and J Cannon, Handbook of MAGMA functions, Department of Pure Mathematics, University of Sydney 1993Google Scholar
  3. 3.
    E A Cichon and P Lescanne, Polynomial Interpretations and the Complexity of Algorithms, in Proceedings of the 11th International Conference on Computer Aided Deduction, Lecture Notes in Computer Science 607, Springer Verlag, 1992Google Scholar
  4. 4.
    J. Conway et al, The Atlas of Finite Simple groups, Oxford University Press, 1987Google Scholar
  5. 5.
    N. Dershowitz, Termination of Rewriting, J. Symbolic Computation, 3 (1987) 69–116Google Scholar
  6. 6.
    N. Dershowitz, Orderings for term rewriting systems, Theoretical Computer Science 17 (1982) 279–301CrossRefGoogle Scholar
  7. 7.
    D. B. A. Epstein, D. F. Holt and S. E. Rees, The use of Knuth-Bendix methods to solve the word problem in automatic groups, J. Symbolic Computation 12 (1991) 397–414Google Scholar
  8. 8.
    D Faugere et al, Efficient computation of zero dimensional Grobner bases by change of ordering, J. Symbolic Computation 16 (1993) 329–344CrossRefGoogle Scholar
  9. 9.
    J R J Groves and G C Smith, Soluble Groups with a Finite Rewriting System, Proc. Edin. Math. Soc. 36 (1993), 283–288Google Scholar
  10. 10.
    J Hart and K Kunen, Single axioms for odd exponent groups, J. Automated Reasoning 14 (1995) 383–412CrossRefGoogle Scholar
  11. 11.
    S M Hermiller and John Meier, Tame combings, almost convexity and rewriting systems for groups, To appear, Math Z.Google Scholar
  12. 12.
    D. Knuth and P. Bendix, Simple Word Problems in Universal Algebras, in Computational Problems in Abstract Algebra, Pergamon Press 1970, ed J. Leech.Google Scholar
  13. 13.
    P Le Chenadec, Canonical forms in finitely presented algebras, Pitman, New York 1986Google Scholar
  14. 14.
    S Linton and D D Shand, Some group theoretic examples with completion theorem provers, J. Automated Reasoning, to appearGoogle Scholar
  15. 15.
    K Madlener and F Otto, About the descriptive power of certain classes of finite string rewriting systems, Theoretical Computer Science 67 (1989), 143–172CrossRefGoogle Scholar
  16. 16.
    K Madlener et al, On the problem of generating small convergent systems, J. Symbolic Computation 16 (1993) 167–188CrossRefGoogle Scholar
  17. 17.
    U. Martin, Linear interpretations by counting patterns, in Proceedings 5th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, Springer Verlag, 1993Google Scholar
  18. 18.
    Ursula Martin, On the diversity of orderings on strings, Fundamentae Informaticae, to appear.Google Scholar
  19. 19.
    Ursula Martin, Termination invariants for string rewriting systems, University of St Andrews Research Report CS/94/15Google Scholar
  20. 20.
    U Martin and M F K Lai, Some experiments with a completion theorem prover, J. Symbolic Computation (1992) 13, 81–100CrossRefGoogle Scholar
  21. 21.
    Ursula Martin and Elizabeth Scott, The order types of termination orderings on terms, strings and multisets, in Proceedings of the Eighth IEEE Conference on Logic in Computer Science, Montreal, 1993Google Scholar
  22. 22.
    T Mora and L Robbiano, The Groebner fan of an ideal, J. Symbolic Computation 6 (1988) 183–208Google Scholar
  23. 23.
    T Mora, Grobner bases for non-commutative polynomial rings, Proc AAECC 3, Lecture Notes in Computer Science 229, 413–421, Springer Verlag, 1986Google Scholar
  24. 24.
    D Plaisted, Equational reasoning and term rewriting systems, in Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, 274–367, 1993Google Scholar
  25. 25.
    M Schönert et al, GAP-Groups Algorithms and Programming, Lehrstuhl D für Mathematik, RWTH Aachen 1993Google Scholar
  26. 26.
    E. Scott, Division orderings given by matrices, Technical Report RHUL 1993Google Scholar
  27. 27.
    E. A. Scott, Weights for total division orderings on strings, Theoretical Computer Science 135 (1994) 345–359CrossRefGoogle Scholar
  28. 28.
    C C Sims, Computation with finitely presented groups, Cambridge University Press 1994Google Scholar
  29. 29.
    C Squier, Word problems and a homological finiteness condition for monoids, J. Pure and Applied Algebra 49 (1987), 13–22Google Scholar
  30. 30.
    J Steinbach, Simplification orderings, Fundamentae Informaticae, to appear.Google Scholar
  31. 31.
    Y Yu, Computer proofs in group theory, J. Automated Reasoning 6 (1990) 251–286CrossRefGoogle Scholar
  32. 32.
    H Zantema and A Geser, A complete characterisation of termination of 0p1q → 1r0s, Proceedings 6th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 914, Springer Verlag, 1995Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ursula Martin
    • 1
  1. 1.School of Mathematical and Computational SciencesUniversity of St AndrewsSt AndrewsScotland

Personalised recommendations