相关论文: The Bieri-Neumann-Strebel invariants for graph gro…

For a finitely generated group $G$ we calculate the Bieri-Neumann-Strebel-Renz invariant $\Sigma^1(\X(G))$ for the weak commutativity construction $\X(G)$. Identifying $S(\X(G))$ with $S(\X(G) / W(G))$ we show $\Sigma^2(\X(G),\Z) \subseteq…

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

Given a finite group $G$ and a subset $X$ of $G$, the commuting graph of $G$ on $X$, denoted by ${\cal C}(G,X)$, is the graph that has $X$ as its vertex set with $x,y\in X$ joined by an edge whenever $x\neq y$ and $xy=yx$. Let $T$ be a…

We calculate the Bieri-Neumann-Strebel-Renz invariant $\Sigma^1(G)$ for even Artin groups $G$ with underlying graph $\Gamma$ such that if there is a closed reduced path in $\Gamma$ with all labels bigger than 2 then the length of such path…

An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

We classify the Bieri-Neumann-Strebel-Renz invariant $\Sigma^1(G)$ for a class of Artin groups with minimal graphs of arbitrary circuit rank.

We use Fox calculus to assign a marked polytope to a `nice' group presentation with two generators and one relator. Relating the marked vertices to Novikov-Sikorav homology we show that they determine the Bieri-Neumann-Strebel invariant of…

We compute the Bieri-Neumann-Strebel invariants $\Sigma^1$ for the generalized solvable Baumslag-Solitar groups $\Gamma_n$ and their finite index subgroups. Using $\Sigma^1$, we show that certain finite index subgroups of $\Gamma_n$ cannot…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

We introduce a directed graph related to a group $G$, which we call the N-prime graph $\Gamma_{\rm{N}}(G)$ of $G$ and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of $\Gamma_{\rm{N}}(G)$ are the primes $p$ such…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

A finite simple graph \G determines a right-angled Artin group G_\G, with one generator for each vertex v, and with one commutator relation vw=wv for each pair of vertices joined by an edge. The Bestvina-Brady group N_\G is the kernel of…

Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. We introduce a bipartite graph $\mathcal{B}(G)$ on $G$ whose vertex set is the union of two sets $G \times G$ and $L(G)$, and two vertices $(a, b) \in G \times G$ and $H \in…

We associate a graph $\mathcal{N}_{G}$ with a group $G$ (called the non-nilpotent graph of $G$) as follows: take $G$ as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this paper we study the graph…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…