The Experts below are selected from a list of 1902 Experts worldwide ranked by ideXlab platform

A. Ivanov - One of the best experts on this subject based on the ideXlab platform.

  • Generating sets consisting of pairwise Conjugate Elements
    International Journal of Algebra and Computation, 2017
    Co-Authors: A. Ivanov
    Abstract:

    We consider groups [Formula: see text] which have generating sets consisting of pairwise Conjugate Elements. We introduce a natural condition on such sets, namely path-connectedness, which has strong consequences when [Formula: see text] acts on a real tree. The main result of the paper states that the group of type-preserving automorphisms of a regular simplicial tree has a generating set with this property.

  • Generating sets consisting of pairwise Conjugate Elements
    International Journal of Algebra and Computation, 2017
    Co-Authors: A. Ivanov
    Abstract:

    We consider groups G which have generating sets consisting of pairwise Conjugate Elements. We introduce a natural condition on such sets, namely path-connectedness, which has strong consequences when G acts on a real tree. The main result of the paper states that the group of type-preserving automorphisms of a regular simplicial tree has a generating set with this property.

S. A. Zyubin - One of the best experts on this subject based on the ideXlab platform.

Jiping Zhang - One of the best experts on this subject based on the ideXlab platform.

Wei Zhou - One of the best experts on this subject based on the ideXlab platform.

Jamal Teymouri - One of the best experts on this subject based on the ideXlab platform.

  • On Conjugate Elements in a semigroup and semigroup diagrams
    Semigroup Forum, 2016
    Co-Authors: Paul A. Cummings, Jamal Teymouri
    Abstract:

    Semigroup derivation diagrams provide a geometric model for when a pair of positive words represent the same element of a semigroup S given by a semigroup presentation \(P=\langle X \, \vert \, R\rangle \). They are analogous to Lyndon-van Kampen group diagrams that model words representing the identity element in a group G. One key property of semigroup derivation diagrams is that they contain no internal vertices of either in-degree zero or out-degree zero. In this note we introduce classes of annular semigroup diagrams which also have, or nearly have, this key property. For our principal results, we use these (restricted) classes of annular semigroup diagrams to model some versions of conjugacy in semigroups. This is, intentionally, a semigroup analogue of the annular group diagrams first used by Paul Schupp to model conjugacy over presentations for a group.