Related papers: An improved diameter bound for finite simple group…
Let $f(d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $\overrightarrow{G}$ such that the diameter of $\overrightarrow{G}$ is at most $f(d)$. Chv\'atal and Thomassen (1978)…
The height gap theorem states that the finite subsets $F$ of matrices generating non-virtually solvable groups have normalized height $\widehat{h}(F)$ bounded below by a constant. It was first proved by Breuillard and another proof was…
We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…
Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…
The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…
Suppose $G$ is a free product $G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups $A_i$ is torsion-free and $F_N$ is a free group of rank $N$. Let $\mathcal{O}$ be the deformation space associated to this free product…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…
For any finite, simple graph $G = (V,E)$, its $2$-distance graph $G_2$ is a graph having the same vertex set $V$ where two vertices are adjacent if and only if their distance is $2$ in $G$. Connectivity and diameter properties of these…
We consider the following long range percolation model: an undirected graph with the node set $\{0,1,...,N\}^d$, has edges $(\x,\y)$ selected with probability $\approx \beta/||\x-\y||^s$ if $||\x-\y||>1$, and with probability 1 if…
We construct a family of finite special 2-groups which have commuting graph of increasing diameter
Let G be a regular Lie group which is a directed union of regular Lie groups G_i (all modelled on possibly infinite-dimensional, locally convex spaces). We show that G is the direct limit of the G_i as a regular Lie group whenever G admits…
Let $G$ be a finite directed graph, $\beta(G)$ the minimum size of a subset $X$ of edges such that the graph $G' = (V,E \smallsetminus X)$ is directed acyclic and $\gamma(G)$ the number of pairs of nonadjacent vertices in the undirected…
Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…
Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…
Let $G$ be either the Grigorchuk $2$-group or one of the Gupta-Sidki $p$-groups. We give new upper bounds for the diameters of the quotients of $G$ by its level stabilisers, as well as other natural sequences of finite-index normal…
For every connected, almost simple linear algebraic group $G\leq\mathrm{GL}_{n}$ over a large enough field $K$, every subvariety $V\subseteq G$, and every finite generating set $A\subseteq G(K)$, we prove a general dimensional bound, that…
Let $G$ be a connected bridgeless graph with domination number $\gamma$. The oriented diameter (strong diameter) of $G$ is the smallest integer $d$ for which $G$ admits a strong orientation with diameter (strong diameter) $d$. Kurz and…
Let G be a Lie group which is the union of an ascending sequence of Lie groups G_n (all of which may be infinite-dimensional). We study the question when G is the direct limit of the G_n's in the category of Lie groups, topological groups,…