arXiv subjects

Hong Yi Huang

Publications and source records attributed to Hong Yi Huang.

10 recordsLinked to original sources

arXiv2026

Greedy bases and relational complexity of diagonal type groups

A base for a subgroup $G$ of $\mathrm{Sym}(Ω)$ is a sequence of elements of $Ω$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for $G$, and it was conjectured by Cameron in 1999 that there exists an absolute constant $c$ such that if $G$ is primitive then any base returned by this algorithm has size at most $cb(G)$. In this paper we determine the size of every base returned by the greedy algorithm when $G$ is a primitive group of diagonal type, and hence prove Cameron's conjecture for these groups. The relational complexity $\mathrm{RC}(G)$ of $G$ is a measure of the way in which the orbits of $G$ on $Ω^k$ for various $k$ determine the action of $G$ on $Ω$. Very few precise values of relational complexity are known, and in particular it is not known which primitive groups have relational complexity $3$. In this paper we prove that if $G$ is primitive of diagonal type then $\mathrm{RC}(G) \geqslant 4$, that this lower bound is attained by infinitely many such $G$, and that the relational complexity of the groups of diagonal type is unbounded.

math.GR↗

arXiv2026

On the intersections of nilpotent subgroups in simple groups

Let $G$ be a finite group and let $H_p$ be a Sylow $p$-subgroup of $G$. A recent conjecture of Lisi and Sabatini asserts the existence of an element $x \in G$ such that $H_p \cap H_p^x$ is inclusion-minimal in the set $\{H_p \cap H_p^g \,:\, g \in G\}$ for every prime $p$. For a simple group $G$, in view of a theorem of Mazurov and Zenkov from 1996, the conjecture implies the existence of an element $x \in G$ with $H_p \cap H_p^x = 1$ for all $p$. In turn, this statement implies a conjecture of Vdovin from 2002, which asserts that if $G$ is simple and $H$ is a nilpotent subgroup, then $H \cap H^x = 1$ for some $x \in G$. In this paper, we adopt a probabilistic approach to prove the Lisi-Sabatini conjecture for all non-alternating simple groups. By combining this with earlier work of Kurmazov on nilpotent subgroups of alternating groups, we complete the proof of Vdovin's conjecture. Moreover, by combining our proof with earlier work of Zenkov on alternating groups, we are able to establish a stronger form of Vdovin's conjecture: if $G$ is simple and $A,B$ are nilpotent subgroups, then $A \cap B^x = 1$ for some $x \in G$. To obtain these results, we study the probability that a random pair of Sylow $p$-subgroups in a simple group of Lie type intersect trivially, complementing recent work of Diaconis et al. and Eberhard on symmetric and alternating groups.

math.GR↗

arXiv2026

On the generalised Saxl graphs of permutation groups

A base for a finite permutation group $G \le \mathrm{Sym}(Ω)$ is a subset of $Ω$ with trivial pointwise stabiliser in $G$, and the base size of $G$ is the smallest size of a base for $G$. Motivated by the interest in groups of base size two, Burness and Giudici introduced the notion of the Saxl graph. This graph has vertex set $Ω$, with edges between elements if they form a base for $G$. We define a generalisation of this graph that encodes useful information about $G$ whenever $b(G) \ge 2$: here, the edges are the pairs of elements of $Ω$ that can be extended to bases of size $b(G)$. In particular, for primitive groups, we investigate the completeness and arc-transitivity of the generalised graph, and the generalisation of Burness and Giudici's Common Neighbour Conjecture on the original Saxl graph.

math.GR↗

arXiv2025

On the intersections of Sylow subgroups in almost simple groups

Let $G$ be a finite almost simple group and let $H$ be a Sylow $p$-subgroup of $G$. As a special case of a theorem of Zenkov, there exist $x,y \in G$ such that $H \cap H^x \cap H^y = 1$. In fact, if $G$ is simple, then a theorem of Mazurov and Zenkov reveals that $H \cap H^x = 1$ for some $x \in G$. However, it is known that the latter property does not extend to all almost simple groups. For example, if $G = S_8$ and $p=2$, then $H \cap H^x \ne 1$ for all $x \in G$. Further work of Zenkov in the 1990s shows that such examples are rare (for instance, there are no such examples if $p \geqslant 5$) and he reduced the classification of all such pairs to the situation where $p=2$ and $G$ is an almost simple group of Lie type defined over a finite field $\mathbb{F}_q$ and either $q=9$ or $q$ is a Mersenne or Fermat prime. In this paper, by adopting a probabilistic approach based on fixed point ratio estimates, we complete Zenkov's classification.

math.GR↗

arXiv2025

Fixers and derangements of finite permutation groups

Let $G\leqslant\mathrm{Sym}(Ω)$ be a finite transitive permutation group with point stabiliser $H$. We say that a subgroup $K$ of $G$ is a fixer if every element of $K$ has fixed points, and we say that $K$ is large if $|K| \geqslant |H|$. There is a special interest in studying large fixers due to connections with Erdős-Ko-Rado type problems. In this paper, we classify up to conjugacy the large fixers of the almost simple primitive groups with socle $\mathrm{PSL}_2(q)$, and we use this result to verify a special case of a conjecture of Spiga on permutation characters. We also present some results on large fixers of almost simple primitive groups with socle an alternating or sporadic group.

math.GR↗

arXiv2024

On finite permutation groups of rank three

The classification of the finite primitive permutation groups of rank $3$ was completed in the 1980s and this landmark achievement has found a wide range of applications. In the general transitive setting, a classical result of Higman shows that every finite imprimitive rank $3$ permutation group $G$ has a unique non-trivial block system $\mathcal{B}$ and this provides a natural way to partition the analysis of these groups. Indeed, the induced permutation group $G^{\mathcal{B}}$ is $2$-transitive and one can also show that the action induced on each block in $\mathcal{B}$ is also $2$-transitive (and so both induced groups are either affine or almost simple). In this paper, we make progress towards a classification of the rank $3$ imprimitive groups by studying the case where the induced action of $G$ on a block in $\mathcal{B}$ is of affine type. Our main theorem divides these rank $3$ groups into four classes, which are defined in terms of the kernel of the action of $G$ on $\mathcal{B}$. In particular, we completely determine the rank $3$ semiprimitive groups for which $G^{\mathcal{B}}$ is almost simple, extending recent work of Baykalov, Devillers and Praeger. We also prove that if $G$ is rank $3$ semiprimitive and $G^{\mathcal{B}}$ is affine, then $G$ has a regular normal subgroup which is a special $p$-group for some prime $p$.

math.GR↗

arXiv2023

Base sizes of primitive groups of diagonal type

Let $G$ be a permutation group on a finite set $Ω$. The base size of $G$ is the minimal size of a subset of $Ω$ with trivial pointwise stabiliser in $G$. In this paper, we extend earlier work of Fawcett by determining the precise base size of every finite primitive permutation group of diagonal type. In particular, this is the first family of primitive groups arising in the O'Nan-Scott theorem for which the exact base size has been computed in all cases. Our methods also allow us to determine all the primitive groups of diagonal type with a unique regular suborbit.

math.GR↗

arXiv2022

On base sizes for primitive groups of product type

Let $G \leqslant {\rm Sym}(Ω)$ be a finite permutation group and recall that the base size of $G$ is the minimal size of a subset of $Ω$ with trivial pointwise stabiliser. There is an extensive literature on base sizes for primitive groups, but there are very few results for primitive groups of product type. In this paper, we initiate a systematic study of bases in this setting. Our first main result determines the base size of every product type primitive group of the form $L \wr P \leqslant {\rm Sym}(Ω)$ with soluble point stabilisers, where $Ω= Γ^k$, $L \leqslant {\rm Sym}(Γ)$ and $P \leqslant S_k$ is transitive. This extends recent work of Burness on almost simple primitive groups. We also obtain an expression for the number of regular suborbits of any product type group of the form $L \wr P$ and we classify the groups with a unique regular suborbit under the assumption that $P$ is primitive, which involves extending earlier results due to Seress and Dolfi. We present applications on the Saxl graphs of base-two product type groups and we conclude by establishing several new results on base sizes for general product type primitive groups.

math.GR↗

arXiv2022

On the Saxl graphs of primitive groups with soluble stabilisers

Let $G$ be a transitive permutation group on a finite set $Ω$ and recall that a base for $G$ is a subset of $Ω$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$ then we can study the Saxl graph $Σ(G)$ of $G$, which has vertex set $Ω$ and two vertices are adjacent if they form a base. This is a vertex-transitive graph, which is conjectured to be connected with diameter at most $2$ when $G$ is primitive. In this paper, we combine probabilistic and computational methods to prove a strong form of this conjecture for all almost simple primitive groups with soluble point stabilisers. In this setting, we also establish best possible lower bounds on the clique and independence numbers of $Σ(G)$ and we determine the groups with a unique regular suborbit, which can be interpreted in terms of the valency of $Σ(G)$.

math.GR↗

arXiv2021

On Valency Problems of Saxl Graphs

Let $G$ be a permutation group on a set $Ω$ and recall that a base for $G$ is a subset of $Ω$ such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of $G$, denoted $Σ(G)$, with vertex set $Ω$ and two vertices adjacent if they form a base. If $G$ is transitive, then $Σ(G)$ is vertex-transitive and it is natural to consider its valency (which we refer to as the valency of $G$). In this paper we present a general method for computing the valency of any finite transitive group and we use it to calculate the exact valency of every primitive group with stabiliser a Frobenius group with cyclic kernel. As an application, we calculate the valency of every almost simple primitive group with an alternating socle and soluble stabiliser and we use this to extend results of Burness and Giudici on almost simple primitive groups with prime-power or odd valency.

math.GR↗