HAMILTON CYCLES IN CAYLEY GRAPHS
|
|
- Buck Dean
- 5 years ago
- Views:
Transcription
1 Hamiltonicity of (2, s, 3)- University of Primorska July, 2011
2 Hamiltonicity of (2, s, 3)- Lovász, 1969 Does every connected vertex-transitive graph have a Hamilton path?
3 Hamiltonicity of (2, s, 3)- Hamiltonicity of vertex - transitive graphs All known VTG have Hamilton path. Only 4 CVTG (having at least three vertices) not having a Hamilton cycle are known to exist. None of them is a Cayley graph. Folklore conjecture Every connected Cayley graph contains a Hamilton cycle.
4 Hamiltonicity of (2, s, 3)- The current situation Hamilton cycles (paths) are known to exist in these cases: VTG of order p, 2p, 3p, 4p, 5p, 6p, 2p 2, p k (for k 4) (Alspach, Chen, Du, Marušič, Parsons, Šparl, KK, etc.); CG of p-groups (Witte); VTG having groups with a cyclic commutator subgroup of order p k (Durenberger, Gavlas, Keating, Marušič, Morris, Morris-Witte, etc.). CG Cay(G, {a, b, a b }), where a is an involution (Pak, Radoičić). Cubic CG Cay(G, S), where S = {a, b, c} and a 2 = b 2 = c 2 = 1 and ab = ba (Cherkassoff, Sjerve). Cubic CG Cay(G, S), where S = {a, x, x 1 } and a 2 = 1, x s = 1 and (ax) 3 = 1 (Glover, Marušič). CG on groups whose orders have small prime factorization. This shows, among other, that every CG on a group of order n < 120, n / {48, 72, 80, 96, 108, 112}, has a Hamilton cycle (KK, Marušič, Morris, Morris, Šparl, 2010). and in some other cases.
5 Hamiltonicity of (2, s, 3)- Definition Given a group G and a subset S of G \ {1}, S = S 1, the Cayley graph Cay(G, S) has vertex set G and edges of the form {g, gs} for all g G and s S. The group G acts on itself by the left multiplication. This action may be viewed as the action of G on its Cayley graph. Sabidussi characterized as follows. A graph is a Cayley graph of a group G if and only if its automorphism group contains a regular subgroup isomorphic to G.
6 Hamiltonicity of (2, s, 3)- Cubic If Cay(G, S) is a cubic Cayley graph then S = 3, and either S = {a, b, c a 2 = b 2 = c 2 = 1}, or S = {a, x, x 1 a 2 = x s = 1} where s 3.
7 Hamiltonicity of (2, s, 3)- (2, s, t)- Definition Let G = a, x a 2 = x s = (ax) t = 1,... be a group. Then the Cayley graph X = Cay(G, S) of G with respect to the generating set S = {a, x, x 1 } is called (2, s, t)-cayley graph.
8 Hamiltonicity of (2, s, 3)- (2, s, t)- Definition Let G = a, x a 2 = x s = (ax) t = 1,... be a group. Then the Cayley graph X = Cay(G, S) of G with respect to the generating set S = {a, x, x 1 } is called (2, s, t)-cayley graph. Examples: - Z 6 = a, x a 2 = x 6 = (ax) 3 = 1,... - A 4 = a, x a 2 = x 3 = (ax) 3 = 1 - A 5 = a, x a 2 = x 5 = (ax) 3 = 1 - S 4 = a, x a 2 = x 4 = (ax) 3 = 1 - Most of simple groups - Hurwitz groups
9 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Glover, Marušič, J. Eur. Math. Soc., 2007 Let s 3 be an integer and let X = Cay(G, S) be a (2, s, 3)-Cayley graph of a group G. Then X has a Hamilton cycle when G is congruent to 2 modulo 4, and a cycle of length G 2, and also a Hamilton path, when G is congruent to 0 modulo 4. Glover, KK, Marušič, J. Algebraic Combin., 2009 Let s 0 (mod 4) 4 be an integer. Then a (2, s, 3)-Cayley graph X has a Hamilton cycle. Glover, KK, Malnič, Marušič, 2011 Let s be an odd integer. Then a (2, s, 3)-Cayley graph X has a Hamilton cycle.
10 Henry H. Glover Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-
11 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamilton trees on surfaces approach the beginning H. H. Glover and T. Y. Yang, A Hamilton cycle in the Cayley graph of the (2, p, 3) presentation of PSL 2 (p), Discrete Math. 160 (1996),
12 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- A Hamilton cycle given as the boundary of a Hamilton tree in the Cayley graph for the (5, 3, 2)-generation of PSL 2 (5).
13 Cayley map Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- (2, s, 3)-Cayley graph Cay(G, {a, x, x 1 }) has a canonical Cayley map given by the embedding in the closed orientable surface of genus 1 + (s 6) G /12s, whose set of faces consists of G /s disjoint s-gons and G /3 hexagons. This map is given by taking, at each vertex, the same rotation of the edges labelled by x, a, x 1, and results in one s-gon and two hexagons adjacent at each vertex.
14 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-
15 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Example: (2, 6, 3)-Cayley graph on Z 6 Z 6 = a, x a 2 = x 6 = (ax) 3 = 1,... where a = 3 and x = 1.
16 Soccer ball Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- (2, 5, 3)-Cayley graph on A 5 = a, x a 2 = x 5 = (ax) 3 = 1.
17 Hamiltonicity of (2, s, 3)- Hamilton trees on surfaces approach Hamiltonicity of (2, s, 3)-
18 Hamiltonicity of (2, s, 3)- Hamilton trees on surfaces approach Hamiltonicity of (2, s, 3)-
19 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- A necessary condition for the existence of a Hamilton cycle in a (2, s, 3)-Cayley graph given as the boundary of the Hamiltonian tree HEAD Equation (Glover, Yanq, 1996) If there is a Hamilton cycle given as the boundary of a tree of α s-gons and β hexagons in the Cayley map of the (2, s, 3)-generation of G, then (s 2)α + 4β = G 2.
20 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- How to find a Hamiltonian tree of faces?
21 Hexagon graph Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- With the Cayley map of a (2, s, 3)-Cayley graph X on a group G we associate the so-called hexagon graph Hex(X ) having all the hexagons in X as vertices, where two hexagons are adjacent in Hex(X ) whenever they share an edge in X.
22 Hexagon graph Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- With the Cayley map of a (2, s, 3)-Cayley graph X on a group G we associate the so-called hexagon graph Hex(X ) having all the hexagons in X as vertices, where two hexagons are adjacent in Hex(X ) whenever they share an edge in X.
23 Hamiltonicity of (2, s, 3)- Properties of the hexagon graph Hamiltonicity of (2, s, 3)- Let X be a (2, s, 3)-Cayley graph on a group G = a, x a 2, x s, (ax) 3,.... Then the hexagon graph has the following properties Hex(X ):
24 Hamiltonicity of (2, s, 3)- Properties of the hexagon graph Hamiltonicity of (2, s, 3)- Let X be a (2, s, 3)-Cayley graph on a group G = a, x a 2, x s, (ax) 3,.... Then the hexagon graph has the following properties Hex(X ): - Hex(X ) is of order G /3.
25 Hamiltonicity of (2, s, 3)- Properties of the hexagon graph Hamiltonicity of (2, s, 3)- Let X be a (2, s, 3)-Cayley graph on a group G = a, x a 2, x s, (ax) 3,.... Then the hexagon graph has the following properties Hex(X ): - Hex(X ) is of order G /3. - Hex(X ) is isomorphic to the orbital graph of the left action of G on the set of left cosets H of the subgroup H = ax, arising from the suborbit {ah, axah, axaxah} = {ah, x 1 H, ax 2 H} of length 3. More precisely, the graph has vertex set H, with adjacency defined as follows: a coset yh, y G, is adjacent to the three cosets yah, yx 1 H and yax 2 H.
26 Hamiltonicity of (2, s, 3)- Properties of the hexagon graph Hamiltonicity of (2, s, 3)- Let X be a (2, s, 3)-Cayley graph on a group G = a, x a 2, x s, (ax) 3,.... Then the hexagon graph has the following properties Hex(X ): - Hex(X ) is of order G /3. - Hex(X ) is isomorphic to the orbital graph of the left action of G on the set of left cosets H of the subgroup H = ax, arising from the suborbit {ah, axah, axaxah} = {ah, x 1 H, ax 2 H} of length 3. More precisely, the graph has vertex set H, with adjacency defined as follows: a coset yh, y G, is adjacent to the three cosets yah, yx 1 H and yax 2 H. - G acts 1-regularly on Hex(X ), and so Hex(X ) is a cubic arc-transitive graph.
27 Hamiltonicity of (2, s, 3)- Example: G 2(mod 4) Hamiltonicity of (2, s, 3)- G = Z 6 with a (2, 6, 3)-presentation a, x a 2 = x 6 = (ax) 3 = 1, where a = 3 and x = 1.
28 Hamiltonicity of (2, s, 3)- Example: G 2(mod 4) Hamiltonicity of (2, s, 3)- G = S 3 Z 3 with a (2, 6, 3)-presentation a, x a 2 = x 6 = (ax) 3 = 1,..., where a = ((12), 0) and x = ((13), 1).
29 Hamiltonicity of (2, s, 3)- Example: G 0(mod 4) Hamiltonicity of (2, s, 3)- G = A 4 with a (2, 3, 3)-presentation a, x a 2 = x 3 = (ax) 3 = 1, where a = (1 2)(3 4) and x = (1 2 3).
30 Hamiltonicity of (2, s, 3)- Example: G 0(mod 4) Hamiltonicity of (2, s, 3)- G = S 4 with a (2, 4, 3)-presentation a, x a 2 = x 4 = (ax) 3 = 1, where a = (12) and x = (1234).
31 Hamiltonicity of (2, s, 3)- Example: G 0(mod 4) Hamiltonicity of (2, s, 3)- (2, 8, 3)-Cayley graph on G = Q 3 S 3
32 Hamiltonicity of (2, s, 3)- Cyclically stable subsets Hamiltonicity of (2, s, 3)-
33 Hamiltonicity of (2, s, 3)- Payan, Sakarovitch, 1975 Hamiltonicity of (2, s, 3)- Payan, Sakarovitch, 1975 Let X be a cyclically 4-edge-connected cubic graph of order n, and let S be a maximum cyclically stable subset of V (X ). Then S = (3n 2)/2 and more precisely, the following hold. If n 2 (mod 4) then S = (3n 2)/4, and X [S] is a tree and V (X ) \ S is an independent set of vertices; If n 0 (mod 4) then S = (3n 4)/4, and either X [S] is a tree and V (X ) \ S induces a graph with a single edge, or X [S] has two components and V (X ) \ S is an independent set of vertices.
34 Hamiltonicity of (2, s, 3)- Cyclically k-edge-connected graphs Hamiltonicity of (2, s, 3)- Cycle-separating subset A subset F E(X ) of edges of X is said to be cycle-separating if X F is disconnected and at least two of its components contain cycles. Cyclically k-edge-connected graphs A graph X is cyclically k-edge-connected, if no set of fewer than k edges is cycle-separating in X.
35 Is it c.4.c? Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-
36 Is it c.4.c? Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- No.
37 Is it c.4.c? Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-
38 Is it c.4.c? Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Yes. It is in fact c.5.c.
39 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- of cubic arc-transitive graphs Nedela, Škoviera, 1995 of a vertex-transitive graph equals its girth. Proposition Let Y be a cubic arc-transitive graph. Then: (i) The girth g(y ) of Y is at least 6; or (ii) Y is one of the following graphs: the theta graph θ 2, K 4, K 3,3, Q 3, GP(5, 2) or GP(10, 2). Proof: exercise.
40 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of a (2, s, 3)-Cayley graph X on a group G By previous examples we can conclude: If G 2 (mod 4) then Payan-Sakarovitch result implies the existence of a Hamilton cycle in X. If G 0 (mod 4) then Payan-Sakarovitch result implies the existence of a Hamilton cycle in X.
41 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- (2, s, 3)- of order 0 (mod 4) For a (2, s, 3)-Cayley graph of order 0 (mod 4) three cases can occur: s 0 (mod 4). s 2 (mod 4). s odd.
42 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- (2, s, 3)- of order 0 (mod 4) For a (2, s, 3)-Cayley graph of order 0 (mod 4) three cases can occur: s 0 (mod 4). s 2 (mod 4). s odd. HEAD Equation (Glover, Yanq, 1996) If there is a Hamilton cycle given as the boundary of a tree of α s-gons and β hexagons in the Cayley map of the (2, s, 3)-generation of G, then (s 2)α + 4β = G 2.
43 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-, s 0 (mod 4) Glover, KK, Marušič, 2009 Let s 0 (mod 4) 4 be an integer. Then a (2, s, 3)-Cayley graph X has a Hamilton cycle. Glover-Marušič method. Classification of cubic ATG of girth 6. Results on cubic ATG admitting a 1-regular subgroup.
44 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- We consider the graph of hexagons HexX. The graph of hexagons HexX is modified so as to get a graph ModX with 2 (mod 4) vertices and cyclically 4-edge-connected, so to be able to get by [Payan, Sakarovitch, 1975] a tree whose complement is an independent set of vertices giving rise to a Hamilton cycle in X.
45 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- The local structure
46 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- Graph of hexagons Hex(X )
47 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- Graph of hexagons Hex(X ) Hex(X ) is of order G /3.
48 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)-
49 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)-
50 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)-
51 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- Modified graph ModX is of order V (HexX ) (3s 6). Since V (HexX ) 0(mod 4) we have that ModX is of order 2(mod 4).
52 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- HexX is cubic symmetric graph. Lemma If Hex(X ) is cyclically c-edge-connected for c 5 then it is Θ 2, K 4, K 3,3, Q 3 or GP(10, 2). If Hex(X ) cyclically 6-edge-connected then it is an Ik n (r)-path or a suitable cover of the cube or some Ik n(r)-path. If Hex(X ) is cyclically 7-edge-connected then s = 7. In all other cases Hex(X ) is cyclically 8-edge-connected.
53 Hamiltonicity of (2, s, 3)- Modification process in (2, 4k, 3) case Hamiltonicity of (2, s, 3)- Using this lemma we show ModX is cyclically 4-edge-connected. If cyclical edge-connectivity c of HexX is at most 5 then HexX is Θ 2 or Q 3 ; If c = 6 then it is first proved that HexX is some Ik n (r)-path and then shown that the modification process does not reduce c by more than 2. The case c = 7 is impossible; If c is at least 8, then it is shown that the modification process does not reduce c by more than 4. Applying [Payan, Sakarovitch] to ModX gives a Hamilton cycle in X.
54 Example Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-
55 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-, s odd x is corefree in G = a, x a 2 = x s = (ax) 3 = 1,... : A method similar to the method used in s 0 (mod 4) case gives us a Hamilton cycle as a boundary of a Hamilton tree of faces consisting of hexagons and two s-gons. x is not corefree in G = a, x a 2 = x s = (ax) 3 = 1,... : Factor Group Lemma.
56 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-, s odd x is corefree in G = a, x a 2 = x s = (ax) 3 = 1,... : A method similar to the method used in s 0 (mod 4) case gives us a Hamilton cycle as a boundary of a Hamilton tree of faces consisting of hexagons and two s-gons. x is not corefree in G = a, x a 2 = x s = (ax) 3 = 1,... : Factor Group Lemma. Factor Group Lemma Let G be a group with a generating set S such that S 1 = S and 1 S, and let N be a cyclic normal subgroup of G of index n. If [s 1 N,..., s n N] is a Hamilton cycle in Cay(G/N, {sn, s S}) and the product s 1 s 2 s n generates N, where s 1,..., s n S, then Cay(G, S) has a Hamilton cycle.
57 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-, s odd
58 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)-, s 2 (mod 4) For s 2 (mod 4) and G 0 (mod 4) the HEAD equation has no solution, and thus in order to prove the existence of Hamilton cycles in this remaining case a new approach needs to be developed.
59 Hamiltonicity of (2, s, 3)- Hamiltonicity of (2, s, 3)- Thanks!
Cubic Cayley graphs and snarks
Cubic Cayley graphs and snarks University of Primorska UP FAMNIT, Feb 2012 Outline I. Snarks II. Independent sets in cubic graphs III. Non-existence of (2, s, 3)-Cayley snarks IV. Snarks and (2, s, t)-cayley
More informationCubic Cayley Graphs and Snarks
Cubic Cayley Graphs and Snarks Klavdija Kutnar University of Primorska Nashville, 2012 Snarks A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. non-snark = bridgeless cubic
More informationHAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS
HAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS University of Primorska & University of Ljubljana June, 2011 Announcing two opening positions at UP Famnit / Pint in 2011/12 Young Research position = PhD Grant
More informationarxiv:math/ v1 [math.co] 31 Aug 2005
HAMILTONICITY OF CUBIC CAYLEY GRAPHS arxiv:math/0508647v1 [math.co] 31 Aug 2005 Henry Glover Dragan Marušič 1 Department of Mathematics IMFM, University of Ljubljana Ohio State University and University
More informationArc-transitive Bicirculants
1 / 27 Arc-transitive Bicirculants Klavdija Kutnar University of Primorska, Slovenia This is a joint work with Iva Antončič, Aubin Arroyo, Isabel Hubard, Ademir Hujdurović, Eugenia O Reilly and Primož
More information2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS
Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if
More informationCLASSIFICATION OF CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 14p 2
Hacettepe Journal of Mathematics and Statistics Volume 41(2) (2012), 277 282 CLASSIFICATION OF CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 14p 2 Mehdi Alaeiyan and Mohsen Lashani Received 11:12:2010 : Accepted
More informationGeneralized Cayley Digraphs
Pure Mathematical Sciences, Vol. 1, 2012, no. 1, 1-12 Generalized Cayley Digraphs Anil Kumar V. Department of Mathematics, University of Calicut Malappuram, Kerala, India 673 635 anilashwin2003@yahoo.com
More informationAvailable online at J. Math. Comput. Sci. 2 (2012), No. 6, ISSN: COSET CAYLEY DIGRAPH STRUCTURES
Available online at http://scik.org J. Math. Comput. Sci. 2 (2012), No. 6, 1766-1784 ISSN: 1927-5307 COSET CAYLEY DIGRAPH STRUCTURES ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, 1 Department of Mathematics,
More informationOdd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 1 28 Odd-order Cayley graphs with commutator subgroup of order
More informationDIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS
DIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS LUKE MORGAN, JOY MORRIS, AND GABRIEL VERRET Abstract. Let Γ = Cay(G, S) be a Cayley digraph on a group G and let A =
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationSemiregular automorphisms of vertex-transitive graphs
Semiregular automorphisms of vertex-transitive graphs Michael Giudici http://www.maths.uwa.edu.au/ giudici/research.html Semiregular automorphisms A semiregular automorphism of a graph is a nontrivial
More informationA Family of One-regular Graphs of Valency 4
Europ. J. Combinatorics (1997) 18, 59 64 A Family of One-regular Graphs of Valency 4 D RAGAN M ARUSä ICä A graph is said to be one - regular if its automorphism group acts regularly on the set of its arcs.
More informationON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 2, 2012, 79 87 ON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS ADRIÁN PASTINE AND DANIEL JAUME Abstract. In this paper we
More informationSemiregular automorphisms of vertex-transitive cubic graphs
Semiregular automorphisms of vertex-transitive cubic graphs Peter Cameron a,1 John Sheehan b Pablo Spiga a a School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationarxiv: v3 [math.co] 4 Apr 2011
Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x xxxx) 1 x Hamiltonian cycles in Cayley graphs whose order has few prime factors arxiv:1009.5795v3 [math.co] 4 Apr 2011 K. Kutnar University
More informationRegular embeddings of graphs into surfaces
Banská Bystrica Wien, November 28 November 2, 28 Maps and graph embeddings Maps Map is a 2-cell decomposition of a surface Category OrMaps Maps on orientable surfaces together with orientation-preserving
More informationArc-transitive pentavalent graphs of order 4pq
Arc-transitive pentavalent graphs of order 4pq Jiangmin Pan Bengong Lou Cuifeng Liu School of Mathematics and Statistics Yunnan University Kunming, Yunnan, 650031, P.R. China Submitted: May 22, 2012; Accepted:
More informationA TETRAVALENT HALF-ARC-TRANSITIVE GRAPH WITH NONABELIAN VERTEX STABILIZER
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 8 (000), 685 A TETRAVALENT HALF-ARC-TRANSITIVE
More informationRegular actions of groups and inverse semigroups on combinatorial structures
Regular actions of groups and inverse semigroups on combinatorial structures Tatiana Jajcayová Comenius University, Bratislava CSA 2016, Lisbon August 1, 2016 (joint work with Robert Jajcay) Group of Automorphisms
More informationarxiv: v1 [math.co] 19 Nov 2016
Tetravalent 2-transitive Cayley graphs of finite simple groups and their automorphism groups Xin Gui Fang a, Jie Wang a and Sanming Zhou b arxiv:1611.06308v1 [math.co] 19 Nov 2016 a LAMA and School of
More informationOn Hamilton Decompositions of Infinite Circulant Graphs
On Hamilton Decompositions of Infinite Circulant Graphs Darryn Bryant 1, Sarada Herke 1, Barbara Maenhaut 1, and Bridget Webb 2 1 School of Mathematics and Physics, The University of Queensland, QLD 4072,
More informationAlgebraic Combinatorics, Computability and Complexity Syllabus for the TEMPUS-SEE PhD Course
Algebraic Combinatorics, Computability and Complexity Syllabus for the TEMPUS-SEE PhD Course Dragan Marušič 1 and Stefan Dodunekov 2 1 Faculty of Mathematics Natural Sciences and Information Technologies
More informationCAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv: v1 [math.co] 17 Sep 2015
CAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv:1509.05221v1 [math.co] 17 Sep 2015 TED DOBSON AND PABLO SPIGA Abstract. A positive integer n is a Cayley number if every vertex-transitive
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationPentavalent symmetric graphs of order twice a prime power
Pentavalent symmetric graphs of order twice a prime power Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China yqfeng@bjtu.edu.cn A joint work with Yan-Tao Li, Da-Wei Yang,
More informationSymmetry properties of generalized graph truncations
Symmetry properties of generalized graph truncations University of Ljubljana and University of Primorska, Slovenia Graphs, groups and more Koper, Slovenia June 1, 2018 Joint work with Eduard Eiben and
More informationDegree of commutativity of infinite groups
Degree of commutativity of infinite groups... or how I learnt about rational growth and ends of groups Motiejus Valiunas University of Southampton Groups St Andrews 2017 11th August 2017 The concept of
More informationLocally primitive normal Cayley graphs of metacyclic groups
Locally primitive normal Cayley graphs of metacyclic groups Jiangmin Pan Department of Mathematics, School of Mathematics and Statistics, Yunnan University, Kunming 650031, P. R. China jmpan@ynu.edu.cn
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationAutomorphism group of the balanced hypercube
Abstract Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 12 (2017) 145 154 Automorphism group of the balanced hypercube
More informationMathematica Slovaca. Dragan Marušič; Tomaž Pisanski The remarkable generalized Petersen graph G(8, 3) Terms of use:
Mathematica Slovaca Dragan Marušič; Tomaž Pisanski The remarkable generalized Petersen graph G(8, 3) Mathematica Slovaca, Vol. 50 (2000), No. 2, 117--121 Persistent URL: http://dml.cz/dmlcz/133137 Terms
More informationCubic vertex-transitive non-cayley graphs of order 8p
Cubic vertex-transitive non-cayley graphs of order 8p Jin-Xin Zhou, Yan-Quan Feng Department of Mathematics, Beijing Jiaotong University, Beijing, China jxzhou@bjtu.edu.cn, yqfeng@bjtu.edu.cn Submitted:
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More information4-valent graphs of order 6p 2 admitting a group of automorphisms acting regularly on arcs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.) ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (2015) 1 18 4-valent graphs of order 6p 2 admitting a group of automorphisms
More informationEnumeration of Skew-morphisms of Cyclic Groups of Small Orders and Their Corresponding Cayley Maps
Λ45ffiΛ1 μ χ fi ' Vol.45, No.1 2016 1% ADVANCES IN MATHEMATICS (CHINA) Jan., 2016 doi: 10.11845/sxjz.2014107b Enumeration of Skew-morphisms of Cyclic Groups of Small Orders and Their Corresponding Cayley
More informationResearch Article Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups
International Scholarly Research Network ISRN Algebra Volume 2011, Article ID 428959, 6 pages doi:10.5402/2011/428959 Research Article Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups Mehdi
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationHamiltonian circuits in Cayley digraphs. Dan Isaksen. Wayne State University
Hamiltonian circuits in Cayley digraphs Dan Isaksen Wayne State University 1 Digraphs Definition. A digraph is a set V and a subset E of V V. The elements of V are called vertices. We think of vertices
More information-ARC-TRANSITIVE GRAPHS Dragan Marusic IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija
CLASSIFYING -ARC-TRANSITIVE GRAPHS OF ORDER A PRODUCT OF TWO PRIMES Dragan Marusic 1 Primoz Potocnik 1 IMFM, Oddelek za matematiko IMFM, Oddelek za matematiko Univerza v Ljubljani Univerza v Ljubljani
More informationIsomorphic Cayley Graphs on Nonisomorphic Groups
Isomorphic Cayley raphs on Nonisomorphic roups Joy Morris Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC. V5A 1S6. CANADA. morris@cs.sfu.ca January 12, 2004 Abstract: The
More informationAutomorphisms of a family of cubic graphs
Automorphisms of a family of cubic graphs Jin-Xin Zhou Mohsen Ghasemi ICM 2012, 11-14 March, Al Ain Abstract A Cayley graph Cay(G, S) on a group G with respect to a Cayley subset S is said to be normal
More informationRegular Hamiltonian embeddings of the complete bipartite graph K n,n in an orientable surface
Regular Hamiltonian embeddings of the complete bipartite graph K n,n in an orientable surface M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationExamples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are
Cosets Let H be a subset of the group G. (Usually, H is chosen to be a subgroup of G.) If a G, then we denote by ah the subset {ah h H}, the left coset of H containing a. Similarly, Ha = {ha h H} is the
More informationHAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS.
HAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS. MARY STELOW Abstract. Cayley graphs and digraphs are introduced, and their importance and utility in group theory is formally shown.
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationSelf-Complementary Metacirculants
Self-Complementary Metacirculants Grant Rao (joint work with Cai Heng Li and Shu Jiao Song) The University of Western Australia July 7, 2014 All graphs are assumed to be finite simple. Γ is vertex-transitive
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationImprimitive symmetric graphs with cyclic blocks
Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline
More informationLecture 4.1: Homomorphisms and isomorphisms
Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture
More informationFURTHER RESTRICTIONS ON THE STRUCTURE OF FINITE DCI-GROUPS: AN ADDENDUM
FURTHER RESTRICTIONS ON THE STRUCTURE OF FINITE DCI-GROUPS: AN ADDENDUM EDWARD DOBSON, JOY MORRIS, AND PABLO SPIGA Abstract. A finite group R is a DCI-group if, whenever S and T are subsets of R with the
More informationConnectivity of Cayley Graphs: A Special Family
Connectivity of Cayley Graphs: A Special Family Joy Morris Department of Mathematics and Statistics Trent University Peterborough, Ont. K9J 7B8 January 12, 2004 1 Introduction Taking any finite group G,
More informationPerfect 1-factorizations
Perfect 1-factorizations Alexander Rosa Department of Mathematics and Statistics, McMaster University Rosa (McMaster) Perfect 1-factorizations 1 / 17 Smolenice 1963 Rosa (McMaster) Perfect 1-factorizations
More informationThe L 3 (4) near octagon
The L 3 (4) near octagon A. Bishnoi and B. De Bruyn October 8, 206 Abstract In recent work we constructed two new near octagons, one related to the finite simple group G 2 (4) and another one as a sub-near-octagon
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationMath 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.
Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. 24. We basically know already that groups of order p 2 are abelian. Indeed, p-groups have non-trivial
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More information1 Introductory remarks Throughout this paper graphs are nite, simple and undirected. Adopting the terminology of Tutte [11], a k-arc in a graph X is a
ON 2-ARC-TRANSITIVE CAYLEY GRAPHS OF DIHEDRAL GROUPS Dragan Marusic 1 IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija Abstract A partial extension of the results
More informationNote on group distance magic complete bipartite graphs
Cent. Eur. J. Math. 12(3) 2014 529-533 DOI: 10.2478/s11533-013-0356-z Central European Journal of Mathematics Note on group distance magic complete bipartite graphs Research Article Sylwia Cichacz 1 1
More informationHalf-arc-transitive graphs of arbitrary even valency greater than 2
arxiv:150502299v1 [mathco] 9 May 2015 Half-arc-transitive graphs of arbitrary even valency greater than 2 Marston DE Conder Department of Mathematics, University of Auckland, Private Bag 92019, Auckland
More informationREU 2007 Discrete Math Lecture 2
REU 2007 Discrete Math Lecture 2 Instructor: László Babai Scribe: Shawn Drenning June 19, 2007. Proofread by instructor. Last updated June 20, 1 a.m. Exercise 2.0.1. Let G be an abelian group and A G be
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationQuotients of vertex-transitive graphs
Chapter 5 Quotients of vertex-transitive graphs This chapter will study some operations on vertex-transitive graphs. 5.1 Quotient graphs Let Γ = (V,E) be a digraph. For a partition B of V,thequotient Γ
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
More informationAUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY
AUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY Abstract. We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of
More informationHEPTAVALENT SYMMETRIC GRAPHS OF ORDER 6p
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 2017 (741 750) 741 HEPTAVALENT SYMMETRIC GRAPHS OF ORDER 6p Song-Tao Guo School of Mathematics and Statistics Henan University of Science and Technology
More informationAlmost Invariant Sets. M. J. Dunwoody. July 18, 2011
Almost Invariant Sets M. J. Dunwoody July 18, 2011 Introduction Let G be a finitely generated group with finite generating set S and let X = Cay(G, S) be the Cayley graph of G with respect to S. We say
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More informationarxiv: v1 [math.gr] 1 Jul 2018
Rhomboidal C 4 C 8 toris which are Cayley graphs F. Afshari, M. Maghasedi Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran arxiv:87.78v [math.gr] Jul 8 Abstract A C 4 C 8 net
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 43 (2017), No. 3, pp. 951 974. Title: Normal edge-transitive Cayley graphs on the nonabelian groups of
More informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationA more detailed classification of symmetric cubic graphs
A more detailed classification of symmetric cubic graphs Marston Conder 1 Roman Nedela 2 Department of Mathematics University of Auckland Private Bag 92019 Auckland New Zealand Email: m.conder@auckland.ac.nz
More informationAPPLICATION OF HOARE S THEOREM TO SYMMETRIES OF RIEMANN SURFACES
Annales Academiæ Scientiarum Fennicæ Series A. I. Mathematica Volumen 18, 1993, 307 3 APPLICATION OF HOARE S THEOREM TO SYMMETRIES OF RIEMANN SURFACES E. Bujalance, A.F. Costa, and D. Singerman Universidad
More information1 Finite abelian groups
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room
More informationOn Hamiltonian cycle systems with a nice automorphism group
On Hamiltonian cycle systems with a nice automorphism group Francesca Merola Università Roma Tre April Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationarxiv: v1 [math.co] 1 Jan 2019
ARC-TRANSITIVE GRAPHS OF VALENCY TWICE A PRIME ADMIT A SEMIREGULAR AUTOMORPHISM MICHAEL GIUDICI AND GABRIEL VERRET arxiv:1901.00084v1 [math.co] 1 Jan 2019 Abstract. We prove that every finite arc-transitive
More informationArc-transitive Cubic Abelian bi-cayley Graphs and BCI-graphs
Filomat 30:2 (2016), 321 331 DOI 10.2298/FIL1602321K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Arc-transitive Cubic Abelian
More information8th PhD Summer School in Discrete Mathematics Vertex-transitive graphs and their local actions II
8th PhD Summer School in Discrete Mathematics Vertex-transitive graphs and their local actions II Gabriel Verret g.verret@auckland.ac.nz The University of Auckland Rogla 3 July 2018 Vertex-stabilisers
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationCayley Graphs of Finitely Generated Groups
Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationHamilton decompositions of 6-regular abelian Cayley graphs
Michigan Technological University Digital Commons @ Michigan Tech Dissertations, Master's Theses and Master's Reports - Open Dissertations, Master's Theses and Master's Reports 2010 Hamilton decompositions
More informationSymmetric bowtie decompositions of the complete graph
Symmetric bowtie decompositions of the complete graph Simona Bonvicini Dipartimento di Scienze e Metodi dell Ingegneria Via Amendola, Pad. Morselli, 4100 Reggio Emilia, Italy simona.bonvicini@unimore.it
More informationThe symmetric genus spectrum of finite groups
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 4 (2011) 271 289 The symmetric genus spectrum of finite groups Marston
More informationOn Z 3 -Magic Labeling and Cayley Digraphs
Int. J. Contemp. Math. Sciences, Vol. 5, 00, no. 48, 357-368 On Z 3 -Magic Labeling and Cayley Digraphs J. Baskar Babujee and L. Shobana Department of Mathematics Anna University Chennai, Chennai-600 05,
More informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
More informationRegular embeddings of K n,n where n is a power of 2. I: Metacyclic case
Regular embeddings of K n,n where n is a power of 2. I: Metacyclic case Shao-Fei Du Department of Mathematics, Capital Normal University Beijing 100037, People s Republic of China Gareth Jones School of
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationIS A CI-GROUP. RESULTS TOWARDS SHOWING Z n p
RESULTS TOWARDS SHOWING Z n p IS A CI-GROUP JOY MORRIS Abstract. It has been shown that Z i p is a CI-group for 1 i 4, and is not a CI-group for i 2p 1 + ( 2p 1 p ; all other values (except when p = 2
More informationWhat is a semigroup? What is a group? What is the difference between a semigroup and a group?
The second exam will be on Thursday, July 5, 2012. The syllabus will be Sections IV.5 (RSA Encryption), III.1, III.2, III.3, III.4 and III.8, III.9, plus the handout on Burnside coloring arguments. Of
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationarxiv: v4 [math.gr] 17 Jun 2015
On finite groups all of whose cubic Cayley graphs are integral arxiv:1409.4939v4 [math.gr] 17 Jun 2015 Xuanlong Ma and Kaishun Wang Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, 100875,
More information