Related papers: Shintani descent, simple groups and spread

Let $G$ be a graph with $m$ edges and let $\mathrm{mc}(G)$ denote the size of a largest cut of $G$. The difference $\mathrm{mc}(G)-m/2$ is called the surplus $\mathrm{sp}(G)$ of $G$. A fundamental problem in MaxCut is to determine…

Let $G$ be the special linear group $\mathrm{SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are sampled uniformly from large subsets $A$ and $B$ of $G^t$ then their interleaved product $a_1 b_1 a_2 b_2 \cdots a_t b_t$…

Given a positive integer $u$ and a simple algebraic group $G$ defined over an algebraically closed field $K$ of characteristic $p$, we derive properties about the subvariety $G_{[u]}$ of $G$ consisting of elements of $G$ of order dividing…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

We associate with every etale groupoid G two normal subgroups S(G) and A(G) of the topological full group of G, which are analogs of the symmetric and alternating groups. We prove that if G is a minimal groupoid of germs (e.g., of a group…

It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides…

Let $k$ be any field and let $G$ be a connected reductive algebraic $k$-group. Associated to $G$ is an invariant first studied by Satake and Tits that is called the index of $G$ (a Dynkin diagram along with some additional combinatorial…

We prove that, if $G$ is a finite almost simple group and $H$ is a maximal subgroup of $G$, then the $10$th term of the derived series of $H$ is perfect. The same is true if $G$ is perfect and $H$ is core-free. The constant $10$ is best…

For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all…

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that…

The class, denoted by $\mathscr{S}$, of totally disconnected locally compact groups which are non-discrete, compactly generated, and topologically simple contains many compelling examples. In recent years, a general theory for these groups,…

An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…