scholarly journals The solution of length three equations over groups

1983 ◽  
Vol 26 (1) ◽  
pp. 89-96 ◽  
Author(s):  
James Howie
Keyword(s):  
Free Product ◽  
Cyclic Group ◽  
Normal Closure ◽  
Infinite Cyclic Group ◽  
Canonical Map ◽  
Equations Over Groups

Let G be a group, and let r = r(t) be an element of the free product G * 〈G〉 of G with the infinite cyclic group generated by t. We say that the equation r(t) = 1 has a solution in G if the identity map on G extends to a homomorphism from G * 〈G〉 to G with r in its kernel. We say that r(t) = 1 has a solution over G if G can be embedded in a group H such that r(t) = 1 has a solution in H. This property is equivalent to the canonical map from G to 〈G, t|r〉 (the quotient of G * 〈G〉 by the normal closure of r) being injective.

scholarly journals The Topological Interpretation of the Core Group of a Surface in S4

2002 ◽  
Vol 45 (1) ◽  
pp. 131-137 ◽  
Author(s):  
Józef H. Przytycki ◽  
Witold Rosicki
Keyword(s):  
Fundamental Group ◽  
Free Product ◽  
Cyclic Group ◽  
Branched Covers ◽  
Infinite Cyclic Group ◽  
Core Group ◽  
Group Invariant ◽  
Codimension Two ◽  
The Core ◽  
Topological Interpretation

AbstractWe give a topological interpretation of the core group invariant of a surface embedded in S4 [F-R], [Ro]. We show that the group is isomorphic to the free product of the fundamental group of the double branch cover of S4 with the surface as a branched set, and the infinite cyclic group. We present a generalization for unoriented surfaces, for other cyclic branched covers, and other codimension two embeddings of manifolds in spheres.

scholarly journals Semigroups with few endomorphisms

1969 ◽  
Vol 10 (1-2) ◽  
pp. 162-168 ◽  
Author(s):  
Vlastimil Dlab ◽  
B. H. Neumann
Keyword(s):  
Cyclic Group ◽  
Finite Groups ◽  
Automorphism Groups ◽  
Infinite Groups ◽  
Infinite Cyclic Group

Large finite groups have large automorphism groups [4]; infinite groups may, like the infinite cyclic group, have finite automorphism groups, but their endomorphism semigroups are infinite (see Baer [1, p. 530] or [2, p. 68]). We show in this paper that the corresponding propositions for semigroups are false.

scholarly journals PSL(2, q) as an image of the extended modular group with applications to group actions on surfaces

1987 ◽  
Vol 30 (1) ◽  
pp. 143-151 ◽  
Author(s):  
David Singerman
Keyword(s):  
Free Product ◽  
Cyclic Group ◽  
Modular Group ◽  
Prime Power ◽  
Group Actions ◽  
Index 2 ◽  
Image Position

The modular group PSL(2, ℤ), which is isomorphic to a free product of a cyclicgroupof order 2 and a cyclic group of order 3, has many important homomorphic images. Inparticular, Macbeath [7] showed that PSL(2, q) is an image of the modular group if q ≠ 9. (Here, as usual, q is a prime power.) The extended modular group PGL(2, ℤ) contains PSL{2, ℤ) with index 2. It has a presentationthe subgroup PSL(2, ℤ) being generated by UV and VW.

On multiplicative systems defined by generators and relations

1953 ◽  
Vol 49 (4) ◽  
pp. 579-589 ◽  
Author(s):  
Trevor Evans
Keyword(s):  
Automorphism Group ◽  
Finite Number ◽  
Cyclic Group ◽  
Complete Information ◽  
Isomorphism Problem ◽  
Infinite Cyclic Group ◽  
Generators And Relations ◽  
Decision Method ◽  
Multiplicative Systems ◽  
Finitely Related

The techniques developed in (9) are used here to study the properties of multiplicative systems generated by one element (monogenie systems). The results are of two kinds. First, we obtain fairly complete information about the automorphisms and endo-morphisms of free and finitely related loops. The automorphism group of the free monogenie loop is the infinite cyclic group, each automorphism being obtained by mapping the generator on one of its repeated inverses. A monogenie loop with a finite, non-empty set of relations has only a finite number of endomorphisms. These are obtained by mapping the generator on some of the components, or their repeated inverses, occurring in the relations. We use the same methods to solve the isomorphism problem for monogenie loops, i.e. we give a method for determining whether two finitely related monogenie loops are isomorphic. The decision method consists essentially of constructing all homomorphisms between two given finitely related monogenie loops.

Inverse semigroups generated by a pair of subgroups

1977 ◽  
Vol 77 (1-2) ◽  
pp. 9-22 ◽  
Author(s):  
D. B. McAlister
Keyword(s):  
Inverse Semigroup ◽  
Free Product ◽  
Homomorphic Image ◽  
Main Part ◽  
Structure Theorem ◽  
Inverse Semigroups ◽  
Infinite Cyclic Group ◽  
The Third ◽  
Group A ◽  
Maximum Group

SynopsisThe aim of this paper is to describe the free product of a pair G, H of groups in the category of inverse semigroups. Since any inverse semigroup generated by G and H is a homomorphic image of this semigroup, this paper can be regarded as asking how large a subcategory, of the category of inverse semigroups, is the category of groups? In this light, we show that every countable inverse semigroup is a homomorphic image of an inverse subsemigroup of the free product of two copies of the infinite cyclic group. A similar result can be obtained for arbitrary cardinalities. Hence, the category of inverse semigroups is generated, using algebraic constructions by the subcategory of groups.The main part of the paper is concerned with obtaining the structure of the free product G inv H, of two groups G, H in the category of inverse semigroups. It is shown in section 1 that G inv H is E-unitary; thus G inv H can be described in terms of its maximum group homomorphic image G gp H, the free product of G and H in the category of groups, and its semilattice of idempotents. The second section considers some properties of the semilattice of idempotents while the third applies these to obtain a representation of G inv H which is faithful except when one group is a non-trivial finite group and the other is trivial. This representation is used in section 4 to give a structure theorem for G inv H. In this section, too, the result described in the first paragraph is proved. The last section, section 5, consists of examples.

Lehmer’s problem for arbitrary groups

2020 ◽  
pp. 1-32
Author(s):  
W. Lück
Keyword(s):  
Cyclic Group ◽  
Group Ring ◽  
Bounded Operator ◽  
Integral Group Ring ◽  
Integral Group ◽  
Infinite Cyclic Group ◽  
Matrix Formula ◽  
Lehmer’S Problem

We consider the problem whether for a group [Formula: see text] there exists a constant [Formula: see text] such that for any [Formula: see text]-matrix [Formula: see text] over the integral group ring [Formula: see text] the Fuglede–Kadison determinant of the [Formula: see text]-equivariant bounded operator [Formula: see text] given by right multiplication with [Formula: see text] is either one or greater or equal to [Formula: see text]. If [Formula: see text] is the infinite cyclic group and we consider only [Formula: see text], this is precisely Lehmer’s problem.

Commutative Endomorphism Rings

1971 ◽  
Vol 23 (1) ◽  
pp. 69-76 ◽  
Author(s):  
J. Zelmanowitz
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Endomorphism Ring ◽  
Endomorphism Rings ◽  
Prime Rings ◽  
Infinite Cyclic Group ◽  
Free Abelian Groups ◽  
Scalar Action ◽  
Torsion Free

The problem of classifying the torsion-free abelian groups with commutative endomorphism rings appears as Fuchs’ problems in [4, Problems 46 and 47]. They are far from solved, and the obstacles to a solution appear formidable (see [4; 5]). It is, however, easy to see that the only dualizable abelian group with a commutative endomorphism ring is the infinite cyclic group. (An R-module Miscalled dualizable if HomR(M, R) ≠ 0.) Motivated by this, we study the class of prime rings R which possess a dualizable module M with a commutative endomorphism ring. A characterization of such rings is obtained in § 6, which as would be expected, places stringent restrictions on the ring and the module.Throughout we will write homomorphisms of modules on the side opposite to the scalar action. Rings will not be assumed to contain identity elements unless otherwise indicated.

scholarly journals Generalized Fibonacci groups H(r,n,s) that are connected labelled oriented graph groups

2019 ◽  
Vol 22 (1) ◽  
pp. 23-39 ◽  
Author(s):  
Gerald Williams
Keyword(s):  
Cyclic Group ◽  
Betti Numbers ◽  
Oriented Graph ◽  
Complete Classification ◽  
Circulant Matrices ◽  
Fundamental Groups ◽  
Infinite Cyclic Group ◽  
Torus Knot ◽  
Graph Groups

Abstract The class of connected Labelled Oriented Graph (LOG) groups coincides with the class of fundamental groups of complements of closed, orientable 2-manifolds embedded in {S^{4}} , and so contains all knot groups. We investigate when Campbell and Robertson’s generalized Fibonacci groups {H(r,n,s)} are connected LOG groups. In doing so, we use the theory of circulant matrices to calculate the Betti numbers of their abelianizations. We give an almost complete classification of the groups {H(r,n,s)} that are connected LOG groups. All torus knot groups and the infinite cyclic group arise and we conjecture that these are the only possibilities. As a corollary we show that {H(r,n,s)} is a 2-generator knot group if and only if it is a torus knot group.

Wreath Product of O*-Groups that is not in O*

1971 ◽  
Vol 14 (3) ◽  
pp. 453-454
Author(s):  
S. V. Modak
Keyword(s):  
Wreath Product ◽  
Cyclic Group ◽  
Metabelian Group ◽  
Ordered Group ◽  
Infinite Cyclic Group ◽  
Free Metabelian Group ◽  
Ordered Groups

It is well known that the wreath product of two ordered groups is an ordered group. In [2] Fuchs asks if the same is true for O*-groups. Here we construct an example to show that the wreath product of an infinite cyclic group with a free metabelian group is not an O*-group.

Sign in / Sign up

Export Citation Format

Share Document