Related papers: Isoperimetric functions for graph products

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $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 definition can be extended to a…

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…

The isoperimetric constant of a graph $G$ on $n$ vertices, $i(G)$, is the minimum of $\frac{|\partial S|}{|S|}$, taken over all nonempty subsets $S\subset V(G)$ of size at most $n/2$, where $\partial S$ denotes the set of edges with…

Let $\Gamma$ be a finite graph together with a group $G_v$ at each vertex $v$. The graph product $G(\Gamma)$ is obtained from the free product of all $G_v$ by factoring out by the normal subgroup generated by $\{g^{-1}h^{-1}gh; g\in G_v,…

The direct product of graphs $G_1,\ldots,G_n$ is the graph with vertex set $V(G_1)\times\cdots\times V(G_n)$ in which two vertices $(g_1,\ldots,g_n)$ and $(g_1',\ldots,g_n')$ are adjacent if and only if $g_i$ is adjacent to $g_i'$ in $G_i$…

We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even…

The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of…

In this thesis we investigate the Dehn functions of two different classes of groups: subdirect products, in particular subdirect products of limit groups; and Bestvina-Brady groups. Let D = \Gamma_1 \times ... \times \Gamma_n be a direct…

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

We address a question from \cite{BKV25} regarding the finiteness of the homological $R$-isoperimetric function. Let $R$ be a subfield of the complex numbers $\mathbb{C}$ with the absolute value norm. We prove that for any group $G$ that…

It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

A 2-factor of a graph is a 2-regular spanning subgraph. For a graph $G$ and an independent set $I$ of $G$, let $\delta_G(I)$ denote the minimum degree of vertices contained in $I$. We show that (1) if every independent set $I$ of $G$…

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…