Related papers: Canonicality of Makanin-Razborov Diagrams - Counte…

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

For every finitely generated free group $F$, we construct an irreducible open $3$-manifold $M_F$ whose end set is homeomorphic to a Cantor set, and with the end homogeneity group of $M_F$ isomorphic to $F$. The end homogeneity group is the…

A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…

For the coordinate algebras of connected affine algebraic groups, we explore the problem of finding a presentation by generators and relations canonically determined by the group structure.

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

We give a construction of a free digroup $F(X)$ on a set $X$ and formulate the halo and the group parts of $F(X)$. We prove that $F(X)$ is isomorphic to $F(Y)$ if and only if $card(X)=card(Y)$.

Among all affine, flat, finitely presented group schemes, we focus on those that are pure, this includes all groups which are extensions of a finite locally free group by a group with connected fibres. We prove that over an arbitrary base…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…

Canonical functions are a powerful concept with numerous applications in the study of groups, monoids, and clones on countable structures with Ramsey-type properties. In this short note, we present a proof of the existence of canonical…

Given nontrivial finite groups $A$ and $B$, not both of order 2, we prove that every finite simple group of sufficiently large rank is an image of the free product $A \ast B$. To show this, we prove that every finite simple group of…

The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…

We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form.…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…