Cyclic or elementary abelian Covers of K 4

Σχετικά έγγραφα
Congruence Classes of Invertible Matrices of Order 3 over F 2

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

2 Composition. Invertible Mappings

Fractional Colorings and Zykov Products of graphs

EE512: Error Control Coding

Affine Weyl Groups. Gabriele Nebe. Summerschool GRK 1632, September Lehrstuhl D für Mathematik

On a four-dimensional hyperbolic manifold with finite volume

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS

On the Galois Group of Linear Difference-Differential Equations

Finite Field Problems: Solutions

Example Sheet 3 Solutions

Every set of first-order formulas is equivalent to an independent set

Abstract Storage Devices

A Note on Intuitionistic Fuzzy. Equivalence Relation

ST5224: Advanced Statistical Theory II

Homomorphism in Intuitionistic Fuzzy Automata

Lecture 15 - Root System Axiomatics

C.S. 430 Assignment 6, Sample Solutions

5. Choice under Uncertainty

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

Chapter 3: Ordinal Numbers

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1

A General Note on δ-quasi Monotone and Increasing Sequence

Reminders: linear functions

Uniform Convergence of Fourier Series Michael Taylor

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

Second Order Partial Differential Equations

Statistical Inference I Locally most powerful tests

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

Inverse trigonometric functions & General Solution of Trigonometric Equations

Lecture 13 - Root Space Decomposition II

Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S.

THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano

Lecture 34 Bootstrap confidence intervals

Math221: HW# 1 solutions

Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.

The Small World Theorem

The challenges of non-stable predicates

Math 6 SL Probability Distributions Practice Test Mark Scheme

Approximation of distance between locations on earth given by latitude and longitude

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality

Areas and Lengths in Polar Coordinates

Homework 8 Model Solution Section

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

Lecture 10 - Representation Theory III: Theory of Weights

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Lecture 2. Soundness and completeness of propositional logic

arxiv: v2 [math.gr] 14 Dec 2018

Iterated trilinear fourier integrals with arbitrary symbols

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM

From root systems to Dynkin diagrams

Jordan Form of a Square Matrix

Distances in Sierpiński Triangle Graphs

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

Generating Set of the Complete Semigroups of Binary Relations

Mean-Variance Analysis

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

1. Introduction and Preliminaries.

Matrices and Determinants

Space-Time Symmetries

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

DIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS

SOME PROPERTIES OF FUZZY REAL NUMBERS

Overview. Transition Semantics. Configurations and the transition relation. Executions and computation

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

Areas and Lengths in Polar Coordinates

F A S C I C U L I M A T H E M A T I C I

Homomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

5.4 The Poisson Distribution.

( y) Partial Differential Equations

Section 8.3 Trigonometric Equations

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

Other Test Constructions: Likelihood Ratio & Bayes Tests

Lecture Notes Introduction to Cluster Algebra

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

Problem Set 3: Solutions

4.6 Autoregressive Moving Average Model ARMA(1,1)

UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition

Section 8.2 Graphs of Polar Equations

New bounds for spherical two-distance sets and equiangular lines

Some new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.

Sequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions

Lecture 21: Properties and robustness of LSE

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3

A Lambda Model Characterizing Computational Behaviours of Terms

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics

Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2)

Partial Differential Equations in Biology The boundary element method. March 26, 2013

Homomorphism of Intuitionistic Fuzzy Groups

3.2 Simple Roots and Weyl Group

Chapter 2. Ordinals, well-founded relations.

Transcript:

Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06

Outline 1 Question 2 Main results 3 Automorphisms of K 4 4 Ideas for the proof of main results 5 References

Question Given a base graph X and a transformation group K, find all non-isomorphic covers such that a group G of automorphisms of X lifts. In this talk, we will give an example by letting X = K 4, K cyclic or elementary abelian, and G an arc-transitive group of K 4. Furthermore, an application of the above result is given to classify cubic symmetric graphs of certain orders.

Theorem 1: Let K be a cyclic or an elementary abelian group, and let X be a connected K -covering of the complete graph K 4 whose fibre-preserving subgroup is arc-transitive. Then, (1) if K is cyclic then X is 2-regular and isomorphic to the complete graph K 4, the 3-dimensional Hypercube Q 3, or the generalized Petersen graph P(8, 3). (2) If K is an elementary abelian group Z m p (p prime, m 2), then X is 2-regular and isomorphic to one of EK p 3. Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular).

Y.-Q. Feng, J.H. Kwak / Journal of Combinatorial Theory, Series B 97 (2007) 627 646 Automorphisms of K 4,4 α Fig. = 3. (ab)(cd) The complete graph β = K(bcd) 4 with voltage assignment γ = (bc) φ. A 4 = α, β S 4 = α, β, γ Aut(K 4 ) = S 4 able 2 undamental cycles and their images with voltages on K 4 1 Fundamental cycles: abc, acd, adb φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) 2 Assume that N is the fibre-preserving group and the covering graph is N-arc-transitive. bc z 1 bad z 3 acd z 2 acb z 1 cd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 db z 3 bca z 1 abc z 1 adc z 2 3 Let N project to L. Then K 4 is L-arc-transitive. Thus, L = A 4 or S 4. Hence, α and β lifts.

Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts.

Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ.

Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ. 3 Since L lifts, α can be extended to an automorphism of K, say α. Similarly, we can define β and γ if γ lifts.

Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ. 3 Since L lifts, α can be extended to an automorphism of K, say α. Similarly, we can define β and γ if γ lifts. 4 z β 1 = z 2 and z β 2 = z 3 o(z 1 ) = o(z 2 ) = o(z 3 ).

K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1.

K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n.

K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1.

K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1. 4 z 1 = z 2 = z 3 = 1. z α 2 = z 1 z 2 z 3 4 = 0 n = 2, 4.

K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1. 4 z 1 = z 2 = z 3 = 1. z α 2 = z 1 z 2 z 3 4 = 0 n = 2, 4. 5 For n = 2, 4, α, β and γ extends to automorphisms of Z n. It follows that X = Q 3 or P(8, 3) because there is unique connected cubic symmetric graph of order 8 or 16.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b. 3 z 3 = ka + lb a = z 1 = z β 3 = kb + l(ka + lb) lk = 1, k + l 2 = 0 in Z p l 3 = 1, k = l 1.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b. 3 z 3 = ka + lb a = z 1 = z β 3 = kb + l(ka + lb) lk = 1, k + l 2 = 0 in Z p l 3 = 1, k = l 1. 4 z 3 = ka + lb a = z 1 = z3 α = k(ka + lb) l[(k + 1)a + (l + 1)b] k 2 kl l = 1, kl l 2 l = 0 2l = 2, l 2 + l 1 = 0, contradiction.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A. 3 If p = 2 or 3, by Conder and Dobcsányi [1], X is 2-regular, a contradiction.

K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A. 3 If p = 2 or 3, by Conder and Dobcsányi [1], X is 2-regular, a contradiction. 4 If p 5 then K Syl p (B) K A K 4 is 3-arc-transitive, a contradiction. Thus, X is 2-regular.

Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m.

Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C 28.

Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C 28. 3 Let p 17. We aim to deduce a contradiction.

Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C 28. 3 Let p 17. We aim to deduce a contradiction. 4 Let P Syl p (A). Then Syl p (A) = np + 1 = A : N A (P). If np + 1 = 1 P A X is a regular covering of K 4, but no such graph X by Theorem 1, a contradiction.

Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np + 1 18, A 192m np + 1 192 (m = p or p 2 ).

Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np + 1 18, A 192m np + 1 192 (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5.

Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np + 1 18, A 192m np + 1 192 (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p.

Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np + 1 18, A 192m np + 1 192 (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p. 4 Thus, V (X) = 4p 2.

Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np + 1 18, A 192m np + 1 192 (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p. 4 Thus, V (X) = 4p 2. 5 n = 1 and p = 191, 47, 31 or 23. Let H = N A (P). Considering the right multiplication action of A on right cosets of H in A A/H A (p + 1)! p H A P H A = p P H A A X P HA is a connected cubic symmetric graph of order 4p, a contradiction.

Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = 96 4 19 2 3 2 3 A X is 4-arc-transitive A = 2 5 3 19 2 or 2 6 3 19 2.

Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = 96 4 19 2 3 2 3 A X is 4-arc-transitive A = 2 5 3 19 2 or 2 6 3 19 2. 2 By Gorenstein [3, pp.12-14], a simple {2, 3, q}-group exists if and only if q = 5, 7, 13 or 17 A is solvable for a minimal normal subgroup N of A, N = Z s r, r = 2, 3, 19.

Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = 96 4 19 2 3 2 3 A X is 4-arc-transitive A = 2 5 3 19 2 or 2 6 3 19 2. 2 By Gorenstein [3, pp.12-14], a simple {2, 3, q}-group exists if and only if q = 5, 7, 13 or 17 A is solvable for a minimal normal subgroup N of A, N = Z s r, r = 2, 3, 19. 3 r = 3 N A v, impossible. r = 2 or 19 X N is a connected cubic 4-arc-transitive graph of order 722 or 38, which is impossible by Conder and Dobcsányi [1].

M.D.E. Conder, P. Dobcsǎnyi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40(2002) 41-63. M.D.E. Conder, R. Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322(2009) 722-740. D. Gorenstein, Finite Simple Groups, New York and London: Plenum Press, 1982. P. Lorimer, Vertex-transitive graphs: symmetric graphs of prime valency, J. Graph Theory 8(1984), 55-68. A. Malnič, Group actions, coverings and lifts of automorphisms, Discrete Math. 182(1998), 203-218. W.T. Tutte, On the symmetry of cubic graphs, Canad. J. Math. 11(1959), 621-624.

Thank you!