scholarly journals Word problems, embeddings, and free products of right-ordered groups with amalgamated subgroup

2009 ◽  
Vol 99 (3) ◽  
pp. 585-608 ◽  
Author(s):  
V. V. Bludov ◽  
A. M. W. Glass
Keyword(s):  
Word Problems ◽  
Free Products ◽  
Ordered Groups ◽  
Amalgamated Subgroup

scholarly journals Right orders and amalgamation for lattice-ordered groups

2011 ◽  
Vol 61 (3) ◽  
Author(s):  
V. Bludov ◽  
A. Glass
Keyword(s):  
Free Product ◽  
Sufficient Conditions ◽  
State University ◽  
Lattice Ordered Group ◽  
Ordered Group ◽  
Free Products ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Amalgamated Subgroup ◽  
Necessary And Sufficient

AbstractLet H i be a sublattice subgroup of a lattice-ordered group G i (i = 1, 2). Suppose that H 1 and H 2 are isomorphic as lattice-ordered groups, say by φ. In general, there is no lattice-ordered group in which G 1 and G 2 can be embedded (as lattice-ordered groups) so that the embeddings agree on the images of H 1 and H 1φ. In this article we prove that the group free product of G 1 and G 2 amalgamating H 1 and H 1φ is right orderable and so embeddable (as a group) in a lattice-orderable group. To obtain this, we use our necessary and sufficient conditions for the free product of right-ordered groups with amalgamated subgroup to be right orderable [BLUDOV, V. V.—GLASS, A. M. W.: Word problems, embeddings, and free products of right-ordered groups with amalgamated subgroup, Proc. London Math. Soc. (3) 99 (2009), 585–608]. We also provide new limiting examples to show that amalgamation can fail in the category of lattice-ordered groups even when the amalgamating sublattice subgroups are convex and normal (ℓ-ideals) and solve of Problem 1.42 from [KOPYTOV, V. M.—MEDVEDEV, N. YA.: Ordered groups. In: Selected Problems in Algebra. Collection of Works Dedicated to the Memory of N. Ya. Medvedev, Altaii State University, Barnaul, 2007, pp. 15–112 (Russian)].

scholarly journals Separating conjugates in amalgamated free products and HNN extensions

1980 ◽  
Vol 29 (1) ◽  
pp. 35-51 ◽  
Author(s):  
Joan L. Dyer
Keyword(s):  
Nilpotent Groups ◽  
Conjugacy Classes ◽  
Free Products ◽  
Amalgamated Free Products ◽  
Hnn Extensions ◽  
Nontrivial Center ◽  
One Relator Groups ◽  
Amalgamated Subgroup ◽  
Conjugacy Separable ◽  
Base Group

AbstractA group G is termed conjugacy separable (c.s.) if any pair of distinct conjugacy classes may be mapped to distinct conjugacy classes in some finite epimorph of G. The free product of A and B with cyclic amalgamated subgroup H is shown to be c.s. if A and B are both free, or are both finitely generated nilpotent groups. Further, one-relator groups with nontrivial center and HNN extensions with c.s. base group and finite associated subgroups are also c.s.

scholarly journals Orders on Trees and Free Products of Left-ordered Groups

2020 ◽  
Vol 63 (2) ◽  
pp. 335-347
Author(s):  
Warren Dicks ◽  
Zoran Šunić
Keyword(s):  
Free Product ◽  
Short Proof ◽  
Free Products ◽  
Ordered Groups ◽  
Vertex Set ◽  
Total Orders

AbstractWe construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another.As an application, we provide a short proof (modulo Bass–Serre theory) of Vinogradov’s result that the free product of left-orderable groups is left-orderable.

GROUPS WITH INDEXED CO-WORD PROBLEM

2006 ◽  
Vol 16 (05) ◽  
pp. 985-1014 ◽  
Author(s):  
DEREK F. HOLT ◽  
CLAAS E. RÖVER
Keyword(s):  
Dynamical Systems ◽  
Large Class ◽  
Word Problem ◽  
Word Problems ◽  
Automorphism Groups ◽  
Finite Automata ◽  
Restricted Class ◽  
Closure Properties ◽  
Free Products ◽  
Thompson Groups

We investigate co-indexed groups, that is groups whose co-word problem (all words defining nontrivial elements) is an indexed language. We show that all Higman–Thompson groups and a large class of tree automorphism groups defined by finite automata are co-indexed groups. The latter class is closely related to dynamical systems and includes the Grigorchuk 2-group and the Gupta–Sidki 3-group. The co-word problems of all these examples are in fact accepted by nested stack automata with certain additional properties, and we establish various closure properties of this restricted class of co-indexed groups, including closure under free products.

scholarly journals On the Root-Class Residuallity of Generalized Free Products

2015 ◽  
Vol 20 (1) ◽  
pp. 133-137 ◽  
Author(s):  
E. A. Tumanova
Keyword(s):  
Free Product ◽  
Sufficient Condition ◽  
Free Products ◽  
Generalized Free Product ◽  
Amalgamated Subgroup ◽  
Root Class ◽  
Generalized Free Products

Let K be a root class of groups. It is proved that a free product of any family of residually K groups with one amalgamated subgroup, which is a retract in all free factors, is residually K. The sufficient condition for a generalized free product of two groups to be residually K is also obtained, provided that the amalgamated subgroup is normal in one of the free factors and is a retract in another.

Sign in / Sign up

Export Citation Format

Share Document