Timothy C. Burness

activity

20132026

most citedOn the commuting probability of p-elements in a finite group

12 citations · 48 across the 40 of their papers we have counts for

collaborators

Showing 2018Show all

5 papers · 1 filter

math.GR2018

Finite groups, 2-generation and the uniform domination number

Timothy C. Burness, Scott Harper

Let $G$ be a finite $2$ -generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_{1}, \dots, x_{k}$ , there exists $y \in G$ su…

math.GR2018

The length and depth of compact Lie groups

Timothy C. Burness, Martin W. Liebeck, Aner Shalev

Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_{0} > G_{1} > \dots > G_{t} = 1$ , where each $G_{i}$ is a maximal connected subgroup of $G_{i-…

math.GR2018

On base sizes for almost simple primitive groups

Timothy C. Burness

Let $G ⩽ Sym (Ω)$ be a finite almost simple primitive permutation group, with socle $G_{0}$ and point stabilizer $H$ . A subset of $Ω$ is a base for $G$ if its pointwise…

math.GR2018

Irreducible subgroups of simple algebraic groups - a survey

Timothy C. Burness, Donna M. Testerman

Let $G$ be a simple linear algebraic group over an algebraically closed field $K$ of characteristic $p ⩾ 0$ , let $H$ be a proper closed subgroup of $G$ and let $V$ be a non…

math.GR2018★ 9 cited

On the length and depth of finite groups (with an appendix by D.R. Heath-Brown)

Timothy C. Burness, Martin W. Liebeck, Aner Shalev

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_{0} > G_{1} > \dots > G_{t} = 1$ , where each $G_{i}$ is a maximal subgroup of $G_{i - 1}$ . The length (respectively…