Generalizing and strengthening some well-known results of Higman, B. Neumann, Hanna Neumann and Dark on embeddings into two-generator groups, we introduce a construction of subnormal verbal embedding of an arbitrary (soluble, fully ordered or torsion free) ordered countable group into a two-generator ordered group with these properties. Further, we establish subnormal verbal embedding of defect two of an arbitrary (soluble, fully ordered or torsion free) ordered group G into a group with these properties and of the same cardinality as G, and show in connection with a problem of Heineken that the defect of such an embedding cannot be made smaller, that is, such verbal embeddings of ordered groups cannot in general be normal
Graham Higman proved that a finitely generated group can be embedded in a finitely presented group i...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...
Continuing our recent research on embedding properties of generalized soluble and gener-alized nilpo...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
Continuing our recent research on embedding properties of generalized soluble and gener-alized nilpo...
Abstract. We show that every countable SD-group G can be subnormally embedded into a two-generator S...
AbstractStrengthening a theorem of L. G. Kovács and B. H. Neumann on embeddings of countable SN*- an...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
Abstract. We give a new proof to the criterion for the normal verbal embed-dability of groups. The n...
AbstractStrengthening a theorem of L. G. Kovács and B. H. Neumann on embeddings of countable SN*- an...
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simpl...
Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embe...
summary:It was shown in [7] that any right reversible, cancellative ordered semigroup can be embedde...
Graham Higman proved that a finitely generated group can be embedded in a finitely presented group i...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...
Continuing our recent research on embedding properties of generalized soluble and gener-alized nilpo...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
Continuing our recent research on embedding properties of generalized soluble and gener-alized nilpo...
Abstract. We show that every countable SD-group G can be subnormally embedded into a two-generator S...
AbstractStrengthening a theorem of L. G. Kovács and B. H. Neumann on embeddings of countable SN*- an...
We show that every countable $SD$-group G can be subnormally embedded into a two-generator $SD$-grou...
Abstract. We give a new proof to the criterion for the normal verbal embed-dability of groups. The n...
AbstractStrengthening a theorem of L. G. Kovács and B. H. Neumann on embeddings of countable SN*- an...
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simpl...
Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embe...
summary:It was shown in [7] that any right reversible, cancellative ordered semigroup can be embedde...
Graham Higman proved that a finitely generated group can be embedded in a finitely presented group i...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...
For a countable group G = presented by its generators A and defining relations R we discuss a simpl...