We introduce the concept of finite compatibility to prove certain double coset separability of tree products of central subgroup separable groups. We also prove a criterion for the conjugacy separability of generalized free products of two conjugacy separable groups amalgamating a central subgroup i
Graphs and Separability Properties of Groups
β Scribed by Rita Gitik
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 207 KB
- Volume
- 188
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
A group G is LERF locally extended residually finite if for any finitely generated subgroup S of G and for any g f S there exists a finite index subgroup S of G which contains S but not g. Using graph-theoretical methods we give 0 algorithms for constructing finite index subgroups in amalgamated free products of groups with good separability properties. We prove that a free product of a free group and a LERF group amalgamated over a cyclic subgroup maximal in the free factor is LERF. The maximality condition cannot be removed, because adjunction of roots does not preserve property LERF. We also give short proofs of some old theorems about separability properties of groups, including a theorem of Brunner, Burns, and Solitar that a free product of free groups amalgamated over a cyclic subgroup is LERF.
π SIMILAR VOLUMES
G and G amalgamating a common subgroup H. The first problem that 1 2 one encounters is that the residual finiteness of G and G does not imply 1 2 w x in general that G is residually finite. Baumslag 1 proved that if G and 1 G are either both free or both torsion-free finitely generated nilpotent 2 g
Let C be a conjugacy class in the alternating group A n , and let supp(C) be the number of nonfixed digits under the action of a permutation in C. For every 1>$>0 and n 5 there exists a constant c=c($)>0 such that if supp(C) $n then the undirected Cayley graph X(A n , C) is a c expander. A family of
A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied
## Abstract A perfect colouring Ξ¦ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis
For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Γ2-transitive and 1-regular graphs.