SearcharxivSearch

arXiv subjects

Jiangmin Pan

Publications and source records attributed to Jiangmin Pan.

8 recordsLinked to original sources

2-Geodesic-transitive graphs of order twice a prime power

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case is obtained. Certain new 2-geodesic-transitive graphs are found, and a Magma code regarding 2-geodesic-transitive graphs is provided.

math.CO

Quasiprimitive groups with a biregular dihedral subgroup,and arc-transitive bidihedrants

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family of arc-transitive graphs whose automorphism groups containing a bi-regular dihedral subgroup. We first show that every such graph is a normal $r$-cover of an arc-transitive graph whose automorphism group is either quasiprimitive or bi-quasiprimitive on its vertices, and then classify all such quasiprimitive or bi-quasiprimitive arc-transitive graphs.

math.GR

Construction of 2fi-optimal row-column designs

Row-column factorial designs that provide unconfounded estimation of all main effects and the maximum number of two-factor interactions (2fi's) are called 2fi-optimal. This issue has been paid great attention recently for its wide application in industrial or physical experiments. The constructions of 2fi-optimal two-level and three-level full factorial and fractional factorial row-column designs have been proposed. However, the results for high prime level have not been achieved yet. In this paper, we develop these constructions by giving a theoretical construction of $s^n$ full factorial 2fi-optimal row-column designs for any odd prime level $s$ and any parameter combination, and theoretical constructions of $s^{n-1}$ fractional factorial 2fi-optimal row-column designs for any prime level $s$ and any parameter combination.

math.ST

2-Arc-transitive Cayley graphs on alternating groups

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study of $2$-arc-transitive Cayley graphs on $\mathrm{A}_n$ for arbitrary valency. In this paper, we characterize the automorphism groups of such graphs. In particular, we show that for a non-complete $(G,2)$-arc-transitive Cayley graph on $\mathrm{A}_n$ with $G$ almost simple, the socle of $G$ is either $\mathrm{A}_{n+1}$ or $\mathrm{A}_{n+2}$. We also construct the first infinite family of $(\mathrm{A}_{n+2},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$.

math.CO

Symmetric graphs of valency seven and their basic normal quotient graphs

A graph $Γ$ is basic if Aut$Γ$ has no normal subgroup $N\ne1$ such that $Γ$ is a normal cover of the normal quotient graph $Γ_N$. In this paper, we completely determine the basic normal quotient graphs of all connected 7-valent symmetric graphs of order $2pq^n$ with $p < q$ odd primes, which consist of an infinite family of dihedrants of order $2p$ with $p\equiv1$(mod 7), and 6 specific graphs with order at most 310. As a consequence, it shows that, for any given positive integer n, there are only finitely many connected 2-arc-transitive 7-valent graphs of order $2pq^n$ with $7\ne p<q$ primes, partially generalizing Theorem 1 of Conder, Li and Potocnik [On the orders of arc-transitive graphs, J. Algebra 421 (2015), 167-186].

math.CO

Vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups

A fascinating problem on digraphs is the existence problem of the finiteupper bound on s for all vertex-primitive s-arc-transitive digraphs except directed cycles (which is known to be reduced to the almost simple groups case). In this paper,we prove that s 2 for all G-vertex-primitive s-arc-transitive digraphs with G an (insoluble) alternating or symmetric group, which makes an important progress towards a solution of the problem. The proofs involves some methods that may be used to investigate other almost simple groups cases.

math.CO

Arc-transitive Cayley graphs on non-ableian simple groups with soluble vertex stabilizers and valency seven

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal Cayley graph or $\Ga$ is $S$-arc-transitive, with $(S,T)=(\A_n,\A_{n-1})$ and $n=7,21,63$ or $84$; and, for each of these four values of $n$, there really exists arc-transitive $7$-valent non-normal Cayley graphs on $\A_{n-1}$ and specific examples are constructed.

math.CO