Searcharxiv⌕ Search

arXiv subjects

Yan-Quan Feng

Publications and source records attributed to Yan-Quan Feng.

At least 37 records · Page 2Linked to original sources

On $n$-partite digraphical representations of finite groups

A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $Γ$ such that the automorphism group $\mathrm{Aut}(Γ)$ of $Γ$ satisfies the following properties: $\mathrm{Aut}(Γ)$ is isomorphic to $G$, $\mathrm{Aut}(Γ)$ acts semiregularly on the vertices of $Γ$ and the orbits of $\mathrm{Aut}(Γ)$ on the vertex set of $Γ$ form a partition into $n$ parts giving a structure of $n$-partite digraph to $Γ$. In this paper, for every positive integer $n$, we classify the finite groups admitting an $n$-partite digraphical representation.

math.CO↗

Normal Cayley digraphs of dihedral groups with CI-property

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $α\in Aut(G)$ such that $S^α=T$, whenever $Cay(G,S)\cong Cay(G,T)$ for a Cayley (di)graph $Cay(G,T)$. A finite group $G$ is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of $G$ are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of $G$ are CI-graphs, respectively. Motivated by a conjecture proposed by Ádám in 1967, CI-groups and DCI-groups have been actively studied during the last fifty years by many researchers in algebraic graph theory. It takes about thirty years to obtain the classification of cyclic CI-groups and DCI-groups, and recently, the first two authors, among others, classified cyclic NCI-groups and NDCI-groups. Even though there are many partial results on dihedral CI-groups and DCI-groups, their classification is still elusive. In this paper, we prove that a dihedral group of order $2n$ is a NCI-group or a NDCI-group if and only if $n=2,4$ or $n$ is odd. As a direct consequence, we have that if a dihedral group $D_{2n}$ of order $2n$ is a DCI-group then $n=2$ or $n$ is odd-square-free, and that if $D_{2n}$ is a CI-group then $n=2,9$ or $n$ is odd-square-free, throwing some new light on classification of dihedral CI-groups and DCI-groups.

math.CO↗

Normal Cayley digraphs of cyclic groups with CI-property

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if for every $T\subseteq G$, $Cay(G,S)\cong Cay(G,T)$ implies that there is $σ\in Aut(G)$ such that $S^σ=T$. We call a group $G$ a NDCI-group if all normal Cayley digraphs of $G$ are CI-digraphs, and a NCI-group if all normal Cayley graphs of $G$ are CI-graphs, respectively. In this paper, we prove that a cyclic group of order $n$ is a NDCI-group if and only if $8\nmid n$, and is a NCI-group if and only if either $n=8$ or $8\nmid n$.

math.CO↗

On finite groups with prescribed two-generator subgroups and integral Cayley graphs

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$, $\mathbb{Z}_4$, $\mathbb{Z}_6$, $\mathbb{Z}_2 \times \mathbb{Z}_4$, $\mathbb{Z}_2 \times\mathbb{Z}_6$ and $A_4$. As a result, a characterization will be obtained for the finite groups all of whose Cayley graphs of degree $3$ have integral spectrum.

math.GR↗

Two-distance transitive normal Cayley graphs

In this paper, we construct an infinite family of normal Cayley graphs, which are $2$-distance-transitive but neither distance-transitive nor $2$-arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a claim in a literature given by Pan, Huang and Liu in 2015.

math.CO↗

Arc-transitive Cayley graphs on nonabelian simple groups with prime valency

In 2011, Fang et al. in (J. Combin. Theory A 118 (2011) 1039-1051) posed the following problem: Classify non-normal locally primitive Cayley graphs of finite simple groups of valency $d$, where either $d\leq 20$ or $d$ is a prime number. The only case for which the complete solution of this problem is known is of $d=3$. Except this, a lot of efforts have been made to attack this problem by considering the following problem: Characterize finite nonabelian simple groups which admit non-normal locally primitive Cayley graphs of certain valency $d\geq4$. Even for this problem, it was only solved for the cases when either $d\leq 5$ or $d=7$ and the vertex stabilizer is solvable. In this paper, we make crucial progress towards the above problems by completely solving the second problem for the case when $d\geq 11$ is a prime and the vertex stabilizer is solvable.

math.CO↗

On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $ι$ be the automorphism of $A$ defined by $a^ι=a^{-1}$, for every $a\in A$. A Cayley graph $\Cay(A, S)$ is said to have an automorphism group as small as possible if $\Aut(\Cay(A,S)) = \langle A,ι\rangle$. In this paper, we show that, except for two infinite families, almost all bipartite Cayley graphs on abelian groups have automorphism group as small as possible. We also investigate the analogous question for bipartite Cayley digraphs.

math.CO↗

On Haar digraphical representations of groups

In this paper we extend the notion of digraphical regular representations in the context of Haar digraphs. Given a group $G$, a {\em Haar digraph} $Γ$ over $G$ is a bipartite digraph having a bipartition $\{X,Y\}$ such that $G$ is a group of automorphisms of $Γ$ acting regularly on $X$ and on $Y$. We say that $G$ admits a {\em Haar digraphical representation} (HDR for short), if there exists a Haar digraph over $G$ such that its automorphism group is isomorphic to $G$. In this paper, we classify finite groups admitting a HDR.

math.CO↗

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR. First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR. Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.

math.CO↗

Two infinite families of chiral polytopes of type \{4,4,4\} with solvable automorphism groups

We construct two infinite families of locally toroidal chiral polytopes of type $\{4,4,4\}$, with $1024m^2$ and $2048m^2$ automorphisms for every positive integer $m$, respectively. The automorphism groups of these polytopes are solvable groups, and when $m$ is a power of $2$, they provide examples with automorphism groups of order $2^n$ where $n$ can be any integer greater than $9$. (On the other hand, no chiral polytopes of type $[4,4,4]$ exist for $n \leq 9$.) In particular, our two families give a partial answer to a problem proposed by Schulte and Weiss in [Problems on polytopes, their groups, and realizations, {\em Periodica Math.\ Hungarica\} 53 (2006), 231-255].

math.CO↗

Existence of non-Cayley Haar graphs

A Cayley graph of a group $H$ is a finite simple graph $Γ$ such that its automorphism group ${\rm Aut}(Γ)$ contains a subgroup isomorphic to $H$ acting regularly on $V(Γ)$, while a Haar graph of $H$ is a finite simple bipartite graph $Σ$ such that ${\rm Aut}(Σ)$ contains a subgroup isomorphic to $H$ acting semiregularly on $V(Σ)$ and the $H$-orbits are equal to the partite sets of $Σ$. It is well-known that every Haar graph of finite abelian groups is a Cayley graph. In this paper, we prove that every finite non-abelian group admits a non-Cayley Haar graph except the dihedral groups $D_6$, $D_8$, $D_{10}$, the quaternion group $Q_8$ and the group $Q_8\times\mathbb{Z}_2$. This answers an open problem proposed by Estélyi and Pisanski in 2016.

math.CO↗

Existence of regular $3$-hypertopes with $2^n$ chambers

For any positive integers $n, s, t, l$ such that $n \geq 10$, $s, t \geq 2$, $l \geq 1$ and $n \geq s+t+l$, a new infinite family of regular 3-hypertopes with type $(2^s, 2^t, 2^l)$ and automorphism group of order $2^n$ is constructed.

math.CO↗

$2$-groups behaving as automorphism groups of regular $3$-polytopes

In this paper, we classify regular polytopes with automorphism groups of order $2^n$ and Schläfli types $\{4, 2^{n-3}\}, \{4, 2^{n-4}\}$ and $\{4, 2^{n-5}\}$ for $n \geq 10$, therefore giving a partial answer to a problem proposed by Schulte and Weiss in [Problems on polytopes, their groups, and realizations, Periodica Math. Hungarica 53(2006) 231-255].

math.CO↗

A classification of the m-graphical regular representation of finite groups

In this paper we extend the classical notion of digraphical and graphical regular representation of a group and we classify, by means of an explicit description, the finite groups satisfying this generalization. A graph or digraph is called regular if each vertex has the same valency, or, the same out-valency and the same in-valency, respectively. An m-(di)graphical regular representation (respectively, m-GRR and m-DRR, for short) of a group G is a regular (di)graph whose automorphism group is isomorphic to G and acts semiregularly on the vertex set with m orbits. When m=1, this definition agrees with the classical notion of GRR and DRR. Finite groups admitting a 1-DRR were classified by Babai in 1980, and the analogue classification of finite groups admitting a 1-GRR was completed by Godsil in 1981. Pivoting on these two results in this paper we classify finite groups admitting an m-GRR or an m-DRR, for arbitrary positive integers m. For instance, we prove that every non-identity finite group admits an m-GRR, for every m>4.

math.CO↗

Regular maps of order $2$-powers

In this paper, we consider the possible types of regular maps of order $2^n$, where the order of a regular map is the order of automorphism group of the map. For $n \le 11$, M. Conder classified all regular maps of order $2^n$. It is easy to classify regular maps of order $2^n$ whose valency or covalency is $2$ or $2^{n-1}$. So we assume that $n \geq 12$ and $2\leq s,t\leq n-2$ with $s\leq t$ to consider regular maps of order $2^n$ with type $\{2^s, 2^t\}$. We show that for $s+t\leq n$ or for $s+t>n$ with $s=t$, there exists a regular map of order $2^n$ with type $\{2^s, 2^t\}$, and furthermore, we classify regular maps of order $2^n$ with types $\{2^{n-2},2^{n-2}\}$ and $\{2^{n-3},2^{n-3}\}$. We conjecture that, if $s+t>n$ with $s<t$, then there is no regular map of order $2^n$ with type $\{2^s, 2^t\}$, and we confirm the conjecture for $t=n-2$ and $n-3$.

math.CO↗

Complete regular dessins and skew-morphisms of cyclic groups

A dessin is a 2-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving automorphisms acts regularly on the edges. In this paper we study regular dessins whose underlying graph is a complete bipartite graph $K_{m,n}$, called $(m,n)$-complete regular dessins. The purpose is to establish a rather surprising correspondence between $(m,n)$-complete regular dessins and pairs of skew-morphisms of cyclic groups. A skew-morphism of a finite group $A$ is a bijection $φ\colon A\to A$ that satisfies the identity $φ(xy)=φ(x)φ^{π(x)}(y)$ for some function $π\colon A\to\mathbb{Z}$ and fixes the neutral element of~$A$. We show that every $(m,n)$-complete regular dessin $\mathcal{D}$ determines a pair of reciprocal skew-morphisms of the cyclic groups $\mathbb{Z}_n$ and $\mathbb{Z}_m$. Conversely, $\mathcal{D}$ can be reconstructed from such a reciprocal pair. As a consequence, we prove that complete regular dessins, exact bicyclic groups with a distinguished pair of generators, and pairs of reciprocal skew-morphisms of cyclic groups are all in one-to-one correspondence. Finally, we apply the main result to determining all pairs of integers $m$ and $n$ for which there exists, up to interchange of colours, exactly one $(m,n)$-complete regular dessin. We show that the latter occurs precisely when every group expressible as a product of cyclic groups of order $m$ and $n$ is abelian, which eventually comes down to the condition $\gcd(m,ϕ(n))=\gcd(ϕ(m),n)=1$, where $ϕ$ is Euler's totient function.

math.CO↗

Heptavalent symmetric graphs with solvable stabilizers admitting vertex-transitive non-abelian simple groups

A graph $Γ$ is said to be symmetric if its automorphism group $\rm Aut(Γ)$ acts transitively on the arc set of $Γ$. In this paper, we show that if $Γ$ is a finite connected heptavalent symmetric graph with solvable stabilizer admitting a vertex-transitive non-abelian simple group $G$ of automorphisms, then either $G$ is normal in $\rm Aut(Γ)$, or $\rm Aut(Γ)$ contains a non-abelian simple normal subgroup $T$ such that $G\leq T$ and $(G,T)$ is explicitly given as one of $11$ possible exception pairs of non-abelian simple groups. Furthermore, if $G$ is regular on the vertex set of $Γ$ then the exception pair $(G,T)$ is one of $7$ possible pairs, and if $G$ is arc-transitive then the exception pair $(G,T)=(A_{17},A_{18})$ or $(A_{35},A_{36})$.

math.CO↗

Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups

Let $Γ$ be a graph and let $G$ be a group of automorphisms of $Γ$. The graph $Γ$ is called $G$-normal if $G$ is normal in the automorphism group of $Γ$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with $l\geq 1$. In this paper we prove that if every connected pentavalent symmetric $T$-vertex-transitive graph is $T$-normal, then every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal. This result, among others, implies that every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal except $T$ is one of $57$ simple groups. Furthermore, every connected pentavalent symmetric $G$-regular graph is $G$-normal except $T$ is one of $20$ simple groups, and every connected pentavalent $G$-symmetric graph is $G$-normal except $T$ is one of $17$ simple groups.

math.CO↗