Related papers: A construction of free digroup
By using a notion of a geometric Dehn twist in $\sharp_k(S^2 \times S^1)$, we prove that when projections of two $\mathbb{Z}$-splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist…
It is known that the automorphism group of any projective K3 surface is finitely generated [24]. In this paper, we consider a certain kind of K3 surfaces with Picard number 3 whose automorphism groups are isomorphic to congruence subgroups…
We show that if the fundamental groups of the complements of two line arrangements in the complex projective plane are isomorphic to the same direct sum of free groups, then the complements of the arrangements are homotopy equivalent. For…
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the…
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
In this paper are described the groups of automorphisms of semigroup End(W(X)), where W(X) is free commutative or free associative algebra.
Suppose that $G$ is a group, $H$ and $K$ are proper isomorphic central subgroups of $G$, and $\mathfrak{G}$ is an HNN-extension of $G$ with the associated subgroups $H$ and $K$. We prove necessary and sufficient conditions for…
Given isometric actions by a group G on finitely many \delta-hyperbolic metric spaces, we provide a sufficient condition that guarantees the existence of a single element in G that is hyperbolic for each action. As an application we prove a…
Given a family of graphs $\mathcal{H}$, a graph $G$ is $\mathcal{H}$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to any graph in $\mathcal{H}$. We present sufficient and necessary conditions for a graph…
We show that free-by-free groups satisfying a homological criterion, which we call excessive homology, are incoherent. This class is large in nature, including many examples of hyperbolic and non-hyperbolic free-by-free groups. We apply…
In answer to a question of P. Hall, we supply another construction of a group which is isomorphic to each of its non-trivial normal subgroups.
A morphism of linear algebraic groups $\phi:K\rightarrow G$ is called an epimorphism if it admits right cancellation. A subgroup $H\leq G$ is epimorphic if the inclusion map is an epimorphism. For $G$ a simple algebraic group over an…
We prove that a homomorphism between free groups of finite rank equipped with the bi-invariant word metrics is a quasi-isometry if and only if it is an isomorphism.
In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…
This paper studies when a pair of elements in F are the images of the standard generators of F under a self monomorphism.
In this paper, we study the so-called diagram groups. Our main result is that diagram groups are free if and only if they do not contain any subgroup isomorphic to $\mathbb{Z}^2$. As an immediate corollary, we get that hyperbolic diagram…
Root-class residuality of free product of root-class residual groups is demonstrated. A sufficient condition for root-class residuality of generalized free product $G$ of groups $A$ and $B$ amalgamating subgroups $H$ and $K$ through the…
In a paper from 2011, Jiang, Wang and Zhang studied the fixed points and fixed subgroups of selfmaps on a connected finite graph or a connected compact hyperbolic surface $X$. In particular, for any selfmap $f: X\to X$, they proved that a…
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…