相关论文: On the intersection of subgroups in free groups: e…

The \emph{power graph} $P(G)$ of a group $G$ is the graph whose vertex set is $G$, with $x$ and $y$ joined if one is a power of the other; the \emph{directed power graph} $\vec{P}(G)$ has the same vertex set, with an arc from $x$ to $y$ if…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

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…

Let $D$ be a division ring of fractions of a crossed product $F[G,\eta,\alpha]$ where $F$ is a skew field and $G$ is a group with Conradian left-order $\leq$. For $D$ we introduce the notion of freeness with respect to $\leq$ and show that…

The enhanced power graph of a group is the simple graph whose vertex set is consisted of all elements of the group, and whose any pair of vertices are adjacent if they generate a cyclic subgroup. In this paper, we classify all finite groups…

We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…

We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…

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…

A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…

Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…

Given a graph $G$ and a graph property $P$ we say that $G$ is minimal with respect to $P$ if no proper induced subgraph of $G$ has the property $P$. An HC-obstruction is a minimal 2-connected non-Hamiltonian graph. Given a graph $H$, a…

Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is a graph whose vertex set is the group $G$ and distinct elements $x,y\in G$ are adjacent if one is a power of the other, that is, $x$ and $y$ are adjacent if $x\in\langle y\rangle$ or…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

The Surface Group Conjectures are statements about recognising surface groups among one-relator groups, using either the structure of their finite-index subgroups, or all subgroups. We resolve these conjectures in the two generator case.…

We consider embeddings in a torsion-free hyperbolic group which are elementary in the sense of first-order logic. We give a description of these embeddings in terms of Sela's hyperbolic towers. We deduce as a corollary that subgroups…

A graph $G$ is $H$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to $H$. Given a graph $H$, we present sufficient and necessary conditions for a graph $G$ such that $G/e$ is $H$-free for any edge $e$ in…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…