Complete positive group presentations

By Patrick Dehornoy. 2001

61 citations recorded by the source corpus.

Abstract A combinatorial property of positive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show how to directly read several properties of the associated monoid and group from a complete presentation: cancellativity or existence of common multiples in the case of the monoid, or isoperimetric inequality in the case of the group. In particular, we obtain a new criterion for recognizing that a monoid embeds in a group of fractions. Typical presentations eligible for the current approach are the standard presentations of the Artin–Tits groups and the Heisenberg group.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/2187ecc52555ee101553a3922a6bbd766ef3bc7e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Eric Jespers
  2. Jan Okninski
  3. Xin Li

In Geometry and Topology

  1. Jan Okninski
  2. Eric Jespers
  3. Xin Li
  4. Leandro Vendramin
  5. D. Bachiller
  6. Agata Smoktunowicz
  7. Ferran Cedó
  8. Tatiana Gateva-Ivanova

Citations in the corpus