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.

scholarly journals Metric spaces related to Abelian groups

2021 ◽  
Vol 22 (1) ◽  
pp. 169
Author(s):  
Amir Veisi ◽  
Ali Delbaznasab
Keyword(s):  
Metric Space ◽  
Metric Spaces ◽  
Additive Group ◽  
Ordered Group ◽  
Infinite Cyclic Group ◽  
Ordered Groups ◽  
The Family ◽  
Nonempty Compact ◽  
Metric Topology ◽  
Induced Topology

<p>When working with a metric space, we are dealing with the additive group (R, +). Replacing (R, +) with an Abelian group (G, ∗), offers a new structure of a metric space. We call it a G-metric space and the induced topology is called the G-metric topology. In this paper, we are studying G-metric spaces based on L-groups (i.e., partially ordered groups which are lattices). Some results in G-metric spaces are obtained. The G-metric topology is defined which is further studied for its topological properties. We prove that if G is a densely ordered group or an infinite cyclic group, then every G-metric space is Hausdorff. It is shown that if G is a Dedekind-complete densely ordered group, (X, d) a G-metric space, A ⊆ X and d is bounded, then f : X → G with f(x) = d(x, A) := inf{d(x, a) : a ∈ A} is continuous and further x ∈ cl<sub>X</sub>A if and only if f(x) = e (the identity element in G). Moreover, we show that if G is a densely ordered group and further a closed subset of R, K(X) is the family of nonempty compact subsets of X, e &lt; g ∈ G and d is bounded, then d′ (A, B) &lt; g if and only if A ⊆ N<sub>d</sub>(B, g) and B ⊆ N<sub>d</sub>(A, g), where N<sub>d</sub>(A, g) = {x ∈ X : d(x, A) &lt; g}, d<sub>B</sub>(A) = sup{d(a, B) : a ∈ A} and d′ (A, B) = sup{d<sub>A</sub>(B), d<sub>B</sub>(A)}.</p>

scholarly journals BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS

2021 ◽  
pp. 1-11
Author(s):  
DMITRY BERDINSKY ◽  
MURRAY ELDER ◽  
JENNIFER TABACK
Keyword(s):  
Computer Science ◽  
Wreath Product ◽  
Cyclic Group ◽  
Wreath Products ◽  
Infinite Cyclic Group ◽  
Cyclic Groups ◽  
Automatic Groups

Abstract We extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, International Journal of Foundations of Computer Science27(2) (2016), 147–159] to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.

Wreath Products of Nonoverlapping Lattice Ordered Groups

1975 ◽  
Vol 17 (5) ◽  
pp. 713-722 ◽  
Author(s):  
John A. Read
Keyword(s):  
Wreath Product ◽  
Wreath Products ◽  
General Question ◽  
Real Numbers ◽  
Ordered Group ◽  
The Real ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Totally Ordered Group ◽  
Product Of Subgroups

One of the fundamental tools in the theory of totally ordered groups is Hahn’s Theorem (a detailed discussion may be found in Fuchs [3]), which asserts, roughly, that every abelian totally ordered group can be embedded in a lexicographically ordered (unrestricted) direct sum of copies of the ordered group of real numbers. Almost any general question regarding the structure of abelian totally ordered groups can be answered by reference to Hahn’s theorem. For the class of nonabelian totally ordered groups, a theorem which parallels Hahn’s Theorem is given in [5], and states that each totally ordered group can be o-embedded in an ordered wreath product of subgroups of the real numbers. In order to extend this theorem to include an “if and only if” statement, one must consider lattice ordered groups, as an ordered wreath product of subgroups of the real numbers is, in general, not totally-ordered, but lattice ordered.

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 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.

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.

scholarly journals Quasinormal Fitting classes of finite groups

2019 ◽  
pp. 18-26
Author(s):  
Martsinkevich Anna V.
Keyword(s):  
Natural Number ◽  
Wreath Product ◽  
Cyclic Group ◽  
Finite Groups ◽  
Fitting Class ◽  
Soluble Groups ◽  
Normal Fitting Class ◽  
Fitting Classes ◽  
Local Fitting ◽  
Class F

Let P be the set of all primes, Zn a cyclic group of order n and X wr Zn the regular wreath product of the group X with Zn. A Fitting class F is said to be X-quasinormal (or quasinormal in a class of groups X ) if F ⊆ X, p is a prime, groups G ∈ F and G wr Zp ∈ X, then there exists a natural number m such that G m wr Zp ∈ F. If  X is the class of all soluble groups, then F is normal Fitting class. In this paper we generalize the well-known theorem of Blessenohl and Gaschütz in the theory of normal Fitting classes. It is proved, that the intersection of any set of nontrivial X-quasinormal Fitting classes is a nontrivial X-quasinormal Fitting class. In particular, there exists the smallest nontrivial X-quasinormal Fitting class. We confirm a generalized version of the Lockett conjecture (in particular, the Lockett conjecture) about the structure of a Fitting class for the case of X-quasinormal classes, where X is a local Fitting class of partially soluble groups.

scholarly journals Automorphisms of Regular Wreath Product -Groups

2009 ◽  
Vol 2009 ◽  
pp. 1-12 ◽  
Author(s):  
Jeffrey M. Riedl
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Representation Theory ◽  
Wreath Product ◽  
Cyclic Group ◽  
Product Group ◽  
Finite Cyclic Group ◽  
Arbitrary Finite Group

We present a useful new characterization of the automorphisms of the regular wreath product group of a finite cyclic -group by a finite cyclic -group, for any prime , and we discuss an application. We also present a short new proof, based on representation theory, for determining the order of the automorphism group Aut(), where is the regular wreath product of a finite cyclic -group by an arbitrary finite -group.

scholarly journals Minimal vector lattice covers

1971 ◽  
Vol 5 (3) ◽  
pp. 331-335 ◽  
Author(s):  
Roger D. Bleier
Keyword(s):  
Vector Lattice ◽  
Lattice Ordered Group ◽  
Ordered Group ◽  
Vector Lattices ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Archimedean Lattice

We show that each archimedean lattice-ordered group is contained in a unique (up to isomorphism) minimal archimedean vector lattice. This improves a result of Paul F. Conrad appearing previously in this Bulletin. Moreover, we show that this relationship between archimedean lattice-ordered groups and archimedean vector lattices is functorial.

Some Applications of Artamonov-Quillen-Suslin Theorems to Metabelian Inner Rank and Primitivity

1994 ◽  
Vol 46 (2) ◽  
pp. 298-307 ◽  
Author(s):  
C. K. Gupta ◽  
N. D. Gupta ◽  
G. A. Noskov
Keyword(s):  
Metabelian Group ◽  
Sufficient Conditions ◽  
Surface Group ◽  
Maximal Rank ◽  
Orientable Surface ◽  
Surface Groups ◽  
Modular Element ◽  
Free Metabelian Group ◽  
One Relator Groups ◽  
Necessary And Sufficient

AbstractFor any variety of groups, the relative inner rank of a given groupG is defined to be the maximal rank of the -free homomorphic images of G. In this paper we explore metabelian inner ranks of certain one-relator groups. Using the well-known Quillen-Suslin Theorem, in conjunction with an elegant result of Artamonov, we prove that if r is any "Δ-modular" element of the free metabelian group Mn of rank n > 2 then the metabelian inner rank of the quotient group Mn/(r) is at most [n/2]. As a corollary we deduce that the metabelian inner rank of the (orientable) surface group of genus k is precisely k. This extends the corresponding result of Zieschang about the absolute inner ranks of these surface groups. In continuation of some further applications of the Quillen-Suslin Theorem we give necessary and sufficient conditions for a system g = (g1,..., gk) of k elements of a free metabelian group Mn, k ≤ n, to be a part of a basis of Mn. This extends results of Bachmuth and Timoshenko who considered the cases k = n and k < n — 3 respectively.

Sign in / Sign up

Export Citation Format

Share Document