相关论文: Projective resolutions for graph products

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

Let $\Gamma$ be a finitely generated group and $N$ be a normal subgroup of $\Gamma$. The fiber product of $\Gamma$ with respect to $N$ is the subgroup $\Gamma \times_N \Gamma=\{(\gamma, \gamma w): \gamma \in \Gamma, w \in N\}$ of the direct…

Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

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 show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

The goal of the paper "A new graph over semi-direct products of groups" is to define a graph \Gamma(G) on a group G when G splits over a normal subgroup. We demonstrate herein that the graph is ill-defined. We also attempt to ascertain…

We study properties of automorphisms of graph products of groups. We show that graph product $\Gamma\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has…

Given a connected graph $G=(V(G), E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be the maximum value of $d(u,v)$ as $u$ ranging over $W$ and $v$…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

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…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…

The true prosoluble completion $P\Cal S (\Gamma)$ of a group $\Gamma$ is the inverse limit of the projective system of soluble quotients of $\Gamma$. Our purpose is to describe examples and to point out some natural open problems. We…

We prove that every finitely generated group $G$ discriminated by a locally quasi-convex torsion-free hyperbolic group $\Gamma$ is effectively coherent: that is, presentations for finitely generated subgroups can be computed from the…

We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

A graph $\Gamma$ is called locally finite if, for each vertex $v$ of $\Gamma$, the set $\Gamma(v)$ of all neighbors of $v$ in $\Gamma$ is finite. For any locally finite graph $\Gamma$ with vertex set $V(\Gamma)$ and for any field $F$, let…

Figueroa-Centeno et al. introduced the following product of digraphs: let $D$ be a digraph and let $\Gamma$ be a family of digraphs such that $V(F)=V$ for every $F\in \Gamma$. Consider any function $h:E(D)\longrightarrow\Gamma $. Then the…