On Hamiltonian cycle systems with a nice automorphism group

Size: px
Start display at page:

Download "On Hamiltonian cycle systems with a nice automorphism group"

Transcription

1 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 s ) form a partition of E(Γ)

2 Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C s ) form a partition of E(Γ) or K n I, I a -factor, n even Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C s ) form a partition of E(Γ) or K n I, I a -factor, n even

3 Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C s ) form a partition of E(Γ) or K n I, I a -factor, n even Hamiltonian cycle systems set B = {C,..., C s } of n-cycles of Γ such that the edges E(C ),... E(C s ) form a partition of E(Γ) or K n I, I a -factor, n even

4 more generally: graph decomposition Let G be a graph with vertex set V (G) and edge set E(G) a decomposition of G is a set of subgraphs of G whose edge sets partition the edge set of G a (G, Γ)-decomposition is a decomposition in which the subgraphs are all isomorphic to Γ A (K 7, K )-decomposition [or a (K 7, C )-decomposition] the vertices of the K s are {,, }, {,, }, {,, }, {,, }, {,, }, {,, }, {,, }

5 existence - Walecki s construction n odd n even removed -factor: [, ], [, ], [, ], [, ] regular cycle systems a HCS is regular if there is an automorphism group G of Γ acting sharply transitively on the vertices of Γ (so we identify V (Γ) with G) permuting the cycles of B it is called cyclic if G is a cyclic group we shall call it dihedral if G is a dihedral group to construct regular cs it is enough to give its base cycles i.e. a set F of representatives for the G-orbits of the cycles

6 cyclic HCS the existence of hamiltonian cyclic CS is completely settled n odd: a cyclic cs for K n iff n and n p α (p an odd prime and α > ) [Buratti, Del Fra ()] n even, a cyclic cs for K n I, iff n, (mod ) and n p α (p an odd prime and α ) [Gavlas-Jordon, Morris ()] a cyclic HCS for K I removed -factor: [, ] [, 7] [, ] [, 9] [, ] [, ]

7 non-hamiltonian CS we may consider a decomposition of Γ into k-cycles (k < n) obvious necessary conditions for existence of a k-cs of Γ k V (Γ); the vertices of Γ have even degree; k E(Γ) when Γ = K n, n odd or K n I, I a -factor, n even these conditions are also sufficient Alspach and Gavlas-Jordon () for n and k both odd or both even, Šajna () in the remaining cases but for cyclic k-cs known only for n, k (mod k) dihedral HCS consider a hamiltonian cycle system regular under the dihedral group D n n even, n = m the graph is K m I, I a -factor Theorem (M. Buratti, FM, ) There is a dihedral (K m I, C m )-design for all even m. There is a dihedral hamiltonian cycle system for K m I, m an odd integer, iff m has at least two distinct prime factors there is a suitable e such that p (mod e ) for all prime factors p of m and the number of those (counted with their respective multiplicities) such that p (mod e+ ) is even. note that, in the cyclic case, there is no hamiltonian cycle system when n (mod ) the odd integers < for which there is a dihedral HCS are,,, 7,, 9, 77, 9

8 a dihedral HCS for K I D = {, x, x, x, y, xy, x y, x y}, (x = y =, yxy = x ) x x y x x x y x x x x y x y xy x x y xy y x y x y xy x x y xy y x x the removed -factor is [, y] [x, x y] [x, xy] [x, x y] x y x y sharply vertex-transitive HCS a sharply vertex-transitive HCS(n) exists for n odd, iff n p α p prime, α > for n even, iff n pα p prime, α this comes from the cyclic and dihedral results plus some extra cases when n (mod ) (Buratti, unpublished) but - for which groups G is there a HCS which is sharply vertex transitive under G? not known and hard

9 -rotational HCS(n=k+) symmetric terrace of a binary ( involution, λ) group an ordering of the elts of G of the form (g, g,..., g k, g k + λ,..., g + λ, g + λ) such that {±(g i+ g i, i k )} = G \ {, λ} e.g. for Z (,, 7,,,,, ) Bailey-Ollis-Preece () ST -rotational HCS under G Anderson-Ihrig (99) G Q and soluble G has ST G non soluble - open Buratti-Rinaldi-Traetta () -rotational HCS under G ST BOP+BRT for k up to isomorphism at least k -rotational HCS(k + ) full automorphism group want to determine the groups G for which there is an HCS whose full automorphism group is G there is a very recent result by Buratti, Lovegrove, Traetta necessary condition: G AGL(, p) p prime or G is binary or G is odd also sufficient with the possible exception of G binary and non soluble.

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph Discrete Mathematics 309 (2009) 784 796 www.elsevier.com/locate/disc Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph Heather Jordon a,, Joy Morris b a Department of Mathematics,

More information

DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH

DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete

More information

Graph products and new solutions to Oberwolfach problems

Graph products and new solutions to Oberwolfach problems Graph products and new solutions to Oberwolfach problems Gloria Rinaldi Dipartimento di Scienze e Metodi dell Ingegneria Università di Modena e Reggio Emilia 42100 Reggio Emilia, Italy gloria.rinaldi@unimore.it

More information

Primitive 2-factorizations of the complete graph

Primitive 2-factorizations of the complete graph Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,

More information

Perfect 1-factorizations

Perfect 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 information

Sequenceable Groups and Related Topics

Sequenceable Groups and Related Topics Sequenceable Groups and Related Topics M. A. Ollis Marlboro College, P.O. Box A, Marlboro, VT 05344, USA. matt@marlboro.edu Submitted: Nov 15, 2001; Accepted: Aug 12, 2002; Version 1 published: Aug 12,

More information

Cycle decompositions of the complete graph

Cycle decompositions of the complete graph Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London

More information

Symmetric bowtie decompositions of the complete graph

Symmetric 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 information

Self-complementary circulant graphs

Self-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 information

arxiv: v1 [math.co] 31 Mar 2016

arxiv: v1 [math.co] 31 Mar 2016 3-pyramidal Steiner Triple Systems Marco Buratti Gloria Rinaldi Tommaso Traetta arxiv:1603.09645v1 [math.co] 31 Mar 2016 October 1, 2018 Abstract A design is said to be f-pyramidalwhen it has an automorphism

More information

Semiregular automorphisms of vertex-transitive graphs

Semiregular 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 information

UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA

UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento

More information

Skolem-type Difference Sets for Cycle Systems

Skolem-type Difference Sets for Cycle Systems Skolem-type Difference Sets for Cycle Systems Darryn Bryant Department of Mathematics University of Queensland Qld 072 Australia Heather Gavlas Department of Mathematics Illinois State University Campus

More information

Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.

Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a. Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More

More information

HAMILTON CYCLES IN CAYLEY GRAPHS

HAMILTON CYCLES IN CAYLEY GRAPHS Hamiltonicity of (2, s, 3)- University of Primorska July, 2011 Hamiltonicity of (2, s, 3)- Lovász, 1969 Does every connected vertex-transitive graph have a Hamilton path? Hamiltonicity of (2, s, 3)- Hamiltonicity

More information

Algebraically defined graphs and generalized quadrangles

Algebraically 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 information

Sylow structure of finite groups

Sylow structure of finite groups Sylow structure of finite groups Jack Schmidt University of Kentucky September 2, 2009 Abstract: Probably the most powerful results in the theory of finite groups are the Sylow theorems. Those who have

More information

arxiv: v2 [math.co] 6 Mar 2015

arxiv: v2 [math.co] 6 Mar 2015 A GENERALIZATION OF THE PROBLEM OF MARIUSZ MESZKA arxiv:1404.3890v [math.co] 6 Mar 015 ANITA PASOTTI AND MARCO ANTONIO PELLEGRINI Abstract. Mariusz Meszka has conjectured that given a prime p = n + 1 and

More information

Locally primitive normal Cayley graphs of metacyclic groups

Locally 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 information

HOMEWORK #2 - MATH 3260

HOMEWORK #2 - MATH 3260 HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is

More information

Imprimitive symmetric graphs with cyclic blocks

Imprimitive 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 information

C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS

C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS Discussiones Mathematicae Graph Theory 37 (2017) 523 535 doi:10.7151/dmgt.1936 C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS R.S. Manikandan Department of Mathematics Bharathidasan University

More information

A Family of One-regular Graphs of Valency 4

A 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 information

On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components

On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components R. C. Bunge 1, S. I. El-Zanati 1, D. Gibson 2, U. Jongthawonwuth 3, J. Nagel 4, B. Stanley 5, A. Zale 1 1 Department

More information

SOME QUESTIONS ARISING FROM THE STUDY OF THE GENERATING GRAPH

SOME QUESTIONS ARISING FROM THE STUDY OF THE GENERATING GRAPH SOME QUESTIONS ARISING FROM THE STUDY OF Andrea Lucchini Università di Padova, Italy ISCHIA GROUP THEORY 2012 March, 26th - 29th The generating graph Γ(G) of a group G is the graph defined on the non-identity

More information

ON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II

ON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II Bull. Aust. Math. Soc. 87 (2013), 441 447 doi:10.1017/s0004972712000470 ON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II GABRIEL VERRET (Received 30 April 2012; accepted 11 May 2012; first

More information

Name: Solutions - AI FINAL EXAM

Name: Solutions - AI FINAL EXAM 1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from

More information

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below). Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately

More information

On Hamilton Decompositions of Infinite Circulant Graphs

On 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 information

NP-problems continued

NP-problems continued NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. 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 information

Research Article Sunlet Decomposition of Certain Equipartite Graphs

Research Article Sunlet Decomposition of Certain Equipartite Graphs International Combinatorics Volume 2013, Article ID 907249, 4 pages http://dx.doi.org/10.1155/2013/907249 Research Article Sunlet Decomposition of Certain Equipartite Graphs Abolape D. Akwu 1 and Deborah

More information

Connectivity of Cayley Graphs: A Special Family

Connectivity 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 information

A cycle decomposition conjecture for Eulerian graphs

A cycle decomposition conjecture for Eulerian graphs AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(1) (2014), Pages 48 59 A cycle decomposition conjecture for Eulerian graphs Gary Chartrand Department of Mathematics Western Michigan University Kalamazoo,

More information

11 Block Designs. Linear Spaces. Designs. By convention, we shall

11 Block Designs. Linear Spaces. Designs. By convention, we shall 11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,

More information

Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices

Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices Computer Science Journal of Moldova, vol.19, no.3(57), 2011 Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices Luigia Berardi, Mario Gionfriddo, Rosaria Rota Abstract An octagon quadrangle

More information

1 Chapter 6 - Exercise 1.8.cf

1 Chapter 6 - Exercise 1.8.cf 1 CHAPTER 6 - EXERCISE 1.8.CF 1 1 Chapter 6 - Exercise 1.8.cf Determine 1 The Class Equation of the dihedral group D 5. Note first that D 5 = 10 = 5 2. Hence every conjugacy class will have order 1, 2

More information

Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)

Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Warm up: 1. Let n 1500. Find all sequences n 1 n 2... n s 2 satisfying n i 1 and n 1 n s n (where s can vary from sequence to

More information

HAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS

HAMILTONICITY 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 information

Ma/CS 6a Class 19: Group Isomorphisms

Ma/CS 6a Class 19: Group Isomorphisms Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x,

More information

Math 120A: Extra Questions for Midterm

Math 120A: Extra Questions for Midterm Math 120A: Extra Questions for Midterm Definitions Complete the following sentences. 1. The direct product of groups G and H is the set under the group operation 2. The symmetric group on n-letters S n

More information

Self-Complementary Metacirculants

Self-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 information

COUNTING INVOLUTIONS. Michael Aschbacher, Ulrich Meierfrankenfeld, and Bernd Stellmacher

COUNTING INVOLUTIONS. Michael Aschbacher, Ulrich Meierfrankenfeld, and Bernd Stellmacher COUNTING INVOLUTIONS Michael Aschbacher, Ulrich Meierfrankenfeld, and Bernd Stellmacher California Institute of Technology Michigan State University Christian-Albrechts-Universität zu Kiel There are a

More information

Lecture 7 Cyclic groups and subgroups

Lecture 7 Cyclic groups and subgroups Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:

More information

GROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache

GROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin

More information

Chief factors. Jack Schmidt. University of Kentucky

Chief factors. Jack Schmidt. University of Kentucky Chief factors Jack Schmidt University of Kentucky 2008-03-05 Chief factors allow a group to be studied by its representation theory on particularly natural irreducible modules. Outline What is a chief

More information

Automorphism groups of Steiner triple systems

Automorphism groups of Steiner triple systems Automorphism groups of Steiner triple systems Alexander Rosa Department of Mathematics and Statistics, McMaster University Rosa (McMaster) Automorphism groups of Steiner triple systems 1 / 20 Steiner triple

More information

Standard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.

Standard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph. 5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered

More information

Strongly regular graphs and Borsuk s conjecture

Strongly regular graphs and Borsuk s conjecture Optimal Point Configurations and Orthogonal Polynomials 2017 Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology 19 April 2017 Andriy Bondarenko

More information

Lecture 15: The Hidden Subgroup Problem

Lecture 15: The Hidden Subgroup Problem CS 880: Quantum Information Processing 10/7/2010 Lecture 15: The Hidden Subgroup Problem Instructor: Dieter van Melkebeek Scribe: Hesam Dashti The Hidden Subgroup Problem is a particular type of symmetry

More information

Notes for Lecture 25

Notes for Lecture 25 U.C. Berkeley CS276: Cryptography Handout N25 Luca Trevisan April 23, 2009 Notes for Lecture 25 Scribed by Alexandra Constantin, posted May 4, 2009 Summary Today we show that the graph isomorphism protocol

More information

Homogeneous structures

Homogeneous structures Homogeneous structures Robert Gray Centro de Álgebra da Universidade de Lisboa Lisboa, April 2010 Group theory A group is... a set G with a binary operation G G G, (x, y) xy, written multiplicatively,

More information

Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations

Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations (bijections). Definition A bijection from a set A to itself is also

More information

Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons

Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2013 Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons

More information

Examples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are

Examples: 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 information

Complete graphs whose topological symmetry groups are polyhedral

Complete graphs whose topological symmetry groups are polyhedral Digital Commons@ Loyola Marymount University and Loyola Law School Mathematics Faculty Works Mathematics 1-1-2011 Complete graphs whose topological symmetry groups are polyhedral Eric Flapan Blake Mellor

More information

Math 430 Exam 1, Fall 2006

Math 430 Exam 1, Fall 2006 c IIT Dept. Applied Mathematics, October 21, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 1, Fall 2006 These theorems may be cited at any time during the test by stating By

More information

Spectra of Semidirect Products of Cyclic Groups

Spectra of Semidirect Products of Cyclic Groups Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH 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 information

1 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

1 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 information

(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G.

(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (2) Determine all groups of order 21 up to isomorphism. (3) Let P be s Sylow

More information

Planes and MOLS. Ian Wanless. Monash University

Planes and MOLS. Ian Wanless. Monash University Planes and MOLS Ian Wanless Monash University A few of our favourite things A projective plane of order n. An orthogonal array OA(n + 1, n) (strength 2) A (complete) set of n 1 MOLS(n). A classical result

More information

NP-problems continued

NP-problems continued NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.

More information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18

More information

Extra exercises for algebra

Extra exercises for algebra Extra exercises for algebra These are extra exercises for the course algebra. They are meant for those students who tend to have already solved all the exercises at the beginning of the exercise session

More information

Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set

Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty

More information

AUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY

AUTOMORPHISM 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 information

12 Algebraic Structure and Coding Theory

12 Algebraic Structure and Coding Theory 12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b

More information

Transversals in Latin Squares

Transversals in Latin Squares Transversals in Latin Squares Ian Wanless Monash University Australia Loops 07 workshop, Prague, Aug 2007 A latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each

More information

arxiv: v2 [math.co] 31 Jul 2015

arxiv: v2 [math.co] 31 Jul 2015 The rainbow connection number of the power graph of a finite group arxiv:1412.5849v2 [math.co] 31 Jul 2015 Xuanlong Ma a Min Feng b,a Kaishun Wang a a Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal

More information

Formal definition of P

Formal definition of P Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity. In SAT we want to know if

More information

Cycles through 23 vertices in 3-connected cubic planar graphs

Cycles through 23 vertices in 3-connected cubic planar graphs Cycles through 23 vertices in 3-connected cubic planar graphs R. E. L. Aldred, S. Bau and D. A. Holton Department of Mathematics and Statistics, University of Otago, P.O. Box 56, Dunedin, New Zealand.

More information

Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups

Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). Plans until Eastern vacations: In the book the group theory included in the curriculum

More information

Finite Model Theory and Graph Isomorphism. II.

Finite Model Theory and Graph Isomorphism. II. Finite Model Theory and Graph Isomorphism. II. Anuj Dawar University of Cambridge Computer Laboratory visiting RWTH Aachen Beroun, 13 December 2013 Recapitulation Finite Model Theory aims to study the

More information

On a 3-Uniform Path-Hypergraph on 5 Vertices

On a 3-Uniform Path-Hypergraph on 5 Vertices Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1489-1500 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.512742 On a 3-Uniform Path-Hypergraph on 5 Vertices Paola Bonacini Department

More information

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Supplement. 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 information

and e 2 ~ e 2 iff e 1

and e 2 ~ e 2 iff e 1 Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x

More information

Combinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada

Combinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,

More information

Zero sum partition of Abelian groups into sets of the same order and its applications

Zero sum partition of Abelian groups into sets of the same order and its applications Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,

More information

12 Algebraic Structure and Coding Theory

12 Algebraic Structure and Coding Theory 12.1 The Structure of Algebra Def 1 Let S be a set and be a binary operation on S( : S S S). 2. The operation is associative over S, if a (b c) = (a b) c. 1. The operation is commutative over S, if a b

More information

Hopf-Galois Structures on Galois Extensions of Fields

Hopf-Galois Structures on Galois Extensions of Fields Hopf-Galois Structures on Galois Extensions of Fields Nigel Byott University of Exeter, UK 23 June 2017 Hopf Galois Extensions Let H be a finite dimensional cocommutative Hopf algebra over a field K, with

More information

On the Action of Γ 0 (N) on ˆQ

On the Action of Γ 0 (N) on ˆQ Note di Matematica ISSN 23-236, e-issn 90-0932 Note Mat. 30 (200 no. 2, 4 48. doi:0.28/i900932v30n2p4 On the Action of Γ 0 (N on ˆQ Bahadır Özgür Güler Department of Mathematics, University of Rize bahadir.guler@rize.edu.tr

More information

Error-correcting codes from permutation groups

Error-correcting codes from permutation groups Error-correcting codes from permutation groups Robert F. Bailey 1 School of Mathematics and Statistics, Carleton University, 115 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada Abstract We replace the

More information

Note on group distance magic complete bipartite graphs

Note 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 information

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

Quiz 2 Practice Problems

Quiz 2 Practice Problems Quiz 2 Practice Problems Math 332, Spring 2010 Isomorphisms and Automorphisms 1. Let C be the group of complex numbers under the operation of addition, and define a function ϕ: C C by ϕ(a + bi) = a bi.

More information

RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction

RELATIVE 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 information

A note on the Isomorphism Problem for Monomial Digraphs

A note on the Isomorphism Problem for Monomial Digraphs A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University

More information

CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION

CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number

More information

MA441: Algebraic Structures I. Lecture 14

MA441: Algebraic Structures I. Lecture 14 MA441: Algebraic Structures I Lecture 14 22 October 2003 1 Review from Lecture 13: We looked at how the dihedral group D 4 can be viewed as 1. the symmetries of a square, 2. a permutation group, and 3.

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

Some Notes on Distance-Transitive and Distance-Regular Graphs

Some Notes on Distance-Transitive and Distance-Regular Graphs Some Notes on Distance-Transitive and Distance-Regular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,

More information

c 2006 Society for Industrial and Applied Mathematics

c 2006 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 20, No. 3, pp. 603 609 c 2006 Society for Industrial Applied Mathematics CYCLE DECOMPOSITIONS OF K n,n I JUN MA, LIQUN PU, AND HAO SHEN Abstract. Let K n,n denote the complete

More information

arxiv: v3 [math.co] 4 Apr 2011

arxiv: 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 information

SUPPLEMENT ON THE SYMMETRIC GROUP

SUPPLEMENT ON THE SYMMETRIC GROUP SUPPLEMENT ON THE SYMMETRIC GROUP RUSS WOODROOFE I presented a couple of aspects of the theory of the symmetric group S n differently than what is in Herstein. These notes will sketch this material. You

More information

TC10 / 3. Finite fields S. Xambó

TC10 / 3. Finite fields S. Xambó TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the

More information

Some Applications of pq-groups in Graph Theory

Some Applications of pq-groups in Graph Theory Some Applications of pq-groups in Graph Theory Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu January 25, 2002 Abstract

More information

Orbit coherence in permutation groups

Orbit coherence in permutation groups Orbit coherence in permutation groups John R. Britnell Department of Mathematics Imperial College London j.britnell@imperial.ac.uk Groups St Andrews 2013 Joint work with Mark Wildon (RHUL) Orbit partitions

More information

Solutions of Assignment 10 Basic Algebra I

Solutions of Assignment 10 Basic Algebra I Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,

More information

MA441: Algebraic Structures I. Lecture 18

MA441: 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 information