arXiv subjects

Binzhou Xia

Publications and source records attributed to Binzhou Xia.

At least 19 recordsLinked to original sources

arXiv2026

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorphism group is generated by right translations, group automorphisms preserving the connection set, and inversion. Our results substantially generalize several results in the literature, including the known determinations of the automorphism groups of derangement graphs, complete transposition graphs and complete alternating group graphs. As a further application, we establish criteria for a finite nonabelian simple group to admit a graphical doubly regular representation and determine exactly which alternating groups do so, correcting claims in the literature.

math.GR↗

arXiv2026

Asymptotic stability of Cayley graphs on abelian groups

For a finite group $G$, we say that a Cayley graph $Γ$ on $G$ is a most rigid representation (MRR) of $G$ if its full automorphism group has the smallest possible order among all Cayley graphs on $G$, and say that $Γ$ is stable if every automorphism of $Γ\times K_2$ comes from $\mathrm{Aut}(Γ)\times\Aut(K_2)$. Although the study of stability has attracted significant attention, particularly regarding Cayley graphs on abelian groups, a complete classification is currently out of reach even for Cayley graphs on cyclic groups. In this paper, we prove that almost all Cayley graphs on finite abelian groups are stable MRRs. This strengthens the main result of Dobson, Spiga and Verret [Combinatorica, 36 (2016), no.~4, 371--393], which states that almost all Cayley graphs on finite abelian groups are MRRs.

math.CO↗

arXiv2026

Solvable Supplements to Normalizers of Cyclic 2-Subgroups

Amberg and Kazarin proved that a finite group is solvable if the normalizer of every cyclic subgroup of prime power order has a solvable supplement. We substantially relax this hypothesis by requiring it only for cyclic $2$-subgroups. This condition, denoted by $\mathrm{SSN}_2$, sharply restricts the nonabelian composition factors of the group to the family $\PSL_2(q)$, where $q\geq7$ is a prime power satisfying $q\equiv3\pmod4$. Conversely, this family is precisely the nonabelian finite simple groups that satisfy $\mathrm{SSN}_2$. Consequently, a finite group satisfying $\mathrm{SSN}_2$ is solvable if and only if it has no section isomorphic to one of these groups.

math.GR↗

arXiv2026

Factorizations of Almost Simple Groups with Applications

The classification of factorizations $G=HK$ of finite almost simple groups, proposed by Wielandt in 1979 and pursued through several partial classifications, has remained open in one major case. We settle that case: for every finite almost simple classical group $G$, we determine all factorizations $G=HK$ in which both $H$ and $K$ have a unique nonsolvable composition factor, completing the classification of factorizations of finite almost simple groups. Among other consequences of this classification, we prove that the smallest dimension of a biperfect bicrossproduct Hopf algebra is $41287680$.

math.GR↗

arXiv2026

Asymptotic enumeration of minimally transitive permutation groups

We prove that Pyber's upper bound $2^{O(n\log(n))}$ for the number of minimally transitive subgroups of $S_n$ is best possible along the powers of every fixed prime, even when the groups are counted up to permutational isomorphism. As a byproduct, our construction shows that, along the powers of every fixed prime, the maximum order of a minimally transitive permutation group of degree $n$ is $2^{Θ(n)}$. For completeness, we also present Pyber's previously unpublished proof of his upper bound. We further deduce that the numbers of labelled vertex-transitive graphs and digraphs of order $n$ are both $2^{Θ(n\log(n))}$, and discuss the implications of our results for approaches to the McKay--Praeger conjecture.

math.GR↗

arXiv2026

On the automorphism group of direct product of digraphs

Determining the conditions under which the direct product of graphs $G$ and $H$ satisfies $\mathrm{Aut}(G\times H)=\mathrm{Aut}(G)\times\mathrm{Aut}(H)$ has been a problem of considerable interest since Sabidussi's classic work in the 1950s. We call such a pair $(G,H)$ stable, and unstable otherwise. Although much progress has been made for graph pairs, the general digraph case has remained completely open. In this paper, we initiate the study of the stability of digraph pairs, and then focus on the stability of a single digraph $G$. This is defined as the stability of the pair $(G,K_2)$ and has been studied extensively when $G$ is undirected. We establish a necessary and sufficient condition for a connected digraph to be unstable, and use it to derive four sufficient conditions for circulant digraphs to be unstable. Moreover, we prove the nonexistence of nontrivially unstable finite arc-transitive circulant digraphs and nontrivially unstable Cayley digraphs of abelian groups of odd order.

math.CO↗

arXiv2026

On automorphism groups of half-arc-transitive tetravalent graphs

We characterize connected tetravalent graphs $Γ$ which admit groups $M<H$ of automorphisms such that $Γ$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a question asked by A. R. Rivera and P. Šparl in 2019 as well as the first example of tetravalent normal-edge-transitive non-normal Cayley graph on a nonabelian simple group.

math.GR↗

arXiv2026

The existence of unexpected automorphisms in direct product graphs

A pair of graphs $(Γ,Σ)$ is called unstable if their direct product $Γ\timesΣ$ admits automorphisms not from $\mathrm{Aut}(Γ)\times\mathrm{Aut}(Σ)$, and such automorphisms are said to be unexpected. The stability of a graph $Γ$ refers to that of $(Γ,K_2)$. While the stability of individual graphs has been relatively well studied, much less is known for graph pairs. In this paper, we propose a conjecture that provides the best possible reduction of the stability of a graph pair to the stability of a single graph. We prove one direction of this conjecture and establish partial results for the converse. This enables the determination of the stability of a broad class of graph pairs, with complete results when one factor is a cycle.

math.CO↗

arXiv2026

Vertex-primitive $s$-arc-transitive Cayley digraphs

Determining an upper bound on $s$ for vertex-primitive $s$-arc-transitive digraphs has been an open problem of considerable interest since a question asked by Praeger in 1990. Although much progress has been made and an upper bound is conjectured to be $2$, a complete classification for $s=2$ remains out of reach. In this paper, we prove that the tight upper bound on $s$ for finite vertex-primitive $s$-arc-transitive Cayley digraphs is exactly $2$. Furthermore, we completely characterize the structure of these digraphs when $s=2$.

math.CO↗

arXiv2026

Locally dihedral block designs and primitive groups with dihedral point stabilizers

Let $\mathcal{D}$ be a block design admitting a locally transitive automorphism group $G$. We say that $\mathcal{D}$ is $G$-point-locally dihedral if the induced local action $G_x^{\mathcal{D}}$ is dihedral for each point $x$, and that $\mathcal{D}$ is $G$-block-locally dihedral if the induced local action $G_B^B$ is dihedral for each block $B$. If both conditions hold, $\mathcal{D}$ is called $G$-locally dihedral. We give a classification of primitive permutation groups with dihedral point stabilizers and apply this to classify point-locally dihedral block designs. In particular, for symmetric designs with a dihedral or abelian local action, we show that $G_x$ and $G_B$ are conjugate in $G$, and that either $G$ acts imprimitively on both points and blocks, or $G$ is a Frobenius group of odd order.

math.CO↗

arXiv2026

Tiling the symmetric group by transpositions

For nonempty subsets $X$ and $Y$ of a group $G$, we say that $(X,Y)$ is a tiling of $G$ if every element of $G$ can be uniquely expressed as $xy$ for some $x\in X$ and $y\in Y$. In 1966, Rothaus and Thompson studied whether the symmetric group $S_n$ with $n\geq3$ admits a tiling $(T_n,Y)$, where $T_n$ consists of the identity and all the transpositions in $S_n$. They showed that no such tiling exists if $1+n(n-1)/2$ is divisible by a prime number at least $\sqrt{n}+2$. In this paper, we establish a new necessary condition for the existence of such a tiling: the subset $Y$ must be partition-transitive with respect to certain partitions of $n$. This generalizes the result of Rothaus and Thompson, as well as a result of Nomura in 1985. We also study whether $S_n$ can be tiled by the set $T_n^*$ of all the transpositions, which finally leads us to conjecture that neither $T_n$ nor $T_n^*$ tiles $S_n$ for any $n\geq4$.

math.CO↗

arXiv2026

Elusive groups from non-split extensions

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts that no elusive group is $2$-closed. Existing constructions of elusive groups mostly arise from split extensions. In this paper, we initiate the construction of elusive groups via non-split extensions. As a demonstration, we construct elusive groups of new degrees, namely $p^{3k-4}(p+1)/2$ for each Mersenne prime $p\geq7$ and integer $k\geq2$. We also construct the first examples of elusive groups with odd degree, namely $3^{k+1}\cdot5^2$, and twice odd degree, namely $2\cdot3^{k + 1}\cdot5^2$ for each $k\geq1$. We conclude by proposing further problems to advance this new direction of research.

math.GR↗

arXiv2025

A complete classification of solvable factors of almost simple groups

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program initiated in [Memoirs of the AMS, 279 (2022), no.~1375] and [Advances in Mathematics, 377 (2021), 107499]. In particular, it resolves the final remaining case in the long-standing problem of determining exact factorizations of almost simple groups. As a byproduct, we obtain a new characterization of one-dimensional transitive groups, offering further insights into their group structures. We also apply our classification to describe quasiprimitive permutation groups with a solvable transitive subgroup, leading to an interesting result that these subgroups are ``small''.

math.GR↗

arXiv2025

Perfect codes in Cayley graphs of Hajós groups

A perfect code in a graph $Γ$ is a subset $C$ of the vertex set of $Γ$ such that every vertex of $Γ$ outside $C$ has exactly one neighbour in $C$. A perfect code in a directed graph can be defined similarly by requiring that for every vertex $v$ outside $C$ there exists exactly one vertex $u$ in $C$ such that the arc from $u$ to $v$ exists in $Γ$. A subset $X$ of an abelian group $G$ is said to be periodic if there exists a non-identity element $g$ of $G$ such that $g + X = X$. A factorization of $G$ is a pair of nonempty subsets $(A, B)$ of $G$ such that every element $g$ of $G$ can be expressed uniquely as $g = a+b$ with $a \in A$ and $b \in B$. If for every factorization $(A, B)$ of an abelian group $G$ at least one of $A$ and $B$ is periodic, then $G$ is said to be a Hajós group. In this paper we classify all Cayley graphs (directed or undirected) of Hajós groups which admit perfect codes, and moreover we determine all perfect codes in such Cayley graphs.

math.CO↗

arXiv2025

The existence of $m$-Haar graphical representations

Extending the well-studied concept of graphical regular representations to bipartite graphs, a Haar graphical representation (HGR) of a group $G$ is a bipartite graph whose automorphism group is isomorphic to $G$ and acts semiregularly with the orbits giving the bipartition. The question of which groups admit an HGR was inspired by a closely related question of Estélyi and Pisanski in 2016, as well as Babai's work in 1980 on poset representations, and has been recently solved by Morris and Spiga. In this paper, we introduce the $m$-Haar graphical representation ($m$-HGR) as a natural generalization of HGR to $m$-partite graphs for $m\geq2$, and explore the existence of $m$-HGRs for any fixed group. This inquiry represents a more robust version of the existence problem of G$m$SRs as addressed by Du, Feng and Spiga in 2020. Our main result is a complete classification of finite groups $G$ without $m$-HGRs.

math.CO↗

arXiv2025

Which maximal subgroups are perfect codes?

A perfect code in a graph $Γ=(V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if it is a perfect code in some Cayley graph of $G$. In this paper, we undertake a systematic study of which maximal subgroups of a group can be perfect codes. Our approach highlights a characterization of subgroup perfect codes in terms of their ``local'' complements.

math.CO↗

arXiv2025

Determining the vertex stabilizers of 4-valent half-arc-transitive graphs

We say that a group is a $4$-HAT-stabilizer if it is the vertex stabilizer of some connected $4$-valent half-arc-transitive graph. In 2001, Marušič and Nedela proved that every $4$-HAT-stabilizer must be a concentric group. However, over the past two decades, only a very small proportion of concentric groups have been shown to be $4$-HAT-stabilizers. This paper develops a theory that provides a general framework for determining whether a concentric group is a $4$-HAT-stabilizer. With this approach, we significantly extend the known list of $4$-HAT-stabilizers. As a corollary, we confirm that $\mathcal{H}_7\times C_2^{m-7}$ are $4$-HAT-stabilizers for $m\geq 7$, achieving the goal of a conjecture posed by Spiga and Xia.

math.CO↗

arXiv2025

On subgroup perfect codes in vertex-transitive graphs

A subset $C$ of the vertex set $V$ of a graph $Γ$ is called a perfect code in $Γ$ if every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. Given a group $G$ and a subgroup $H$ of $G$, a subgroup $A$ of $G$ containing $H$ is called a perfect code of the pair $(G,H)$ if there exists a coset graph $\mathrm{Cos}(G,H,U)$ such that the set of left cosets of $H$ in $A$ is a perfect code in $\mathrm{Cos}(G,H,U)$. In particular, $A$ is called a perfect code of $G$ if $A$ is a perfect code of the pair $(G,1)$. In this paper, we give a characterization of $A$ to be a perfect code of the pair $(G,H)$ under the assumption that $H$ is a perfect code of $G$. As a corollary, we derive an additional sufficient and necessary condition for $A$ to be a perfect code of $G$. Moreover, we establish conditions under which $A$ is not a perfect code of $(G,H)$, which is applied to construct infinitely many counterexamples to a question posed by Wang and Zhang [\emph{J.~Combin.~Theory~Ser.~A}, 196 (2023) 105737]. Furthermore, we initiate the study of determining which maximal subgroups of $S_n$ are perfect codes.

math.CO↗