Isomorphisms. Sasha Patotski. Cornell University November 23, 2015

Size: px
Start display at page:

Download "Isomorphisms. Sasha Patotski. Cornell University November 23, 2015"

Transcription

1 Isomorphisms Sasha Patotski Cornell University November 23, 2015 Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

2 Last time Definition If G, H are groups, a map ϕ: G H is called a homomorphism if ϕ(a b) = ϕ(a) ϕ(b) For a homomorphism ϕ, necessarily ϕ(e G ) = e H and ϕ(a 1 ) = ϕ(a) 1. Definition The kernel of a homomorphism ϕ is ker ϕ = {a G ϕ(a) = e} The image of a homomorphism ϕ is im ϕ = {ϕ(a) H a G} ker ϕ and im ϕ are subgroups of G and H, respectively. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

3 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

4 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. The map n n( mod m) defines a homomorphism Z Z/m. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

5 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. The map n n( mod m) defines a homomorphism Z Z/m. There are no nontrivial homomorphisms Z/m Z. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

6 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. The map n n( mod m) defines a homomorphism Z Z/m. There are no nontrivial homomorphisms Z/m Z. For a fixed m Z, the map ϕ m : Z Z given by ϕ m (n) = nm defines a homomorphism. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

7 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. The map n n( mod m) defines a homomorphism Z Z/m. There are no nontrivial homomorphisms Z/m Z. For a fixed m Z, the map ϕ m : Z Z given by ϕ m (n) = nm defines a homomorphism. For any abelian group G, the map ϕ m : G G given by g g m is a homomorphism. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

8 Between any groups G, H there is a trivial homomorphism ϕ: G H, given by ϕ(g) = e H, for all g G. The map n n( mod m) defines a homomorphism Z Z/m. There are no nontrivial homomorphisms Z/m Z. For a fixed m Z, the map ϕ m : Z Z given by ϕ m (n) = nm defines a homomorphism. For any abelian group G, the map ϕ m : G G given by g g m is a homomorphism. The same map for non-abelian group is not necessarily a homomorphism (can you give an example?). Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

9 The group of symmetries of an equilateral triangle is isomorphic to S 3. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

10 The group of symmetries of an equilateral triangle is isomorphic to S 3. Prove that the alternating group A 3 is isomorphic to Z/3. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

11 The group of symmetries of an equilateral triangle is isomorphic to S 3. Prove that the alternating group A 3 is isomorphic to Z/3. Prove that orientation preserving symmetries of the square form a subgroup of the group of all symmetries. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

12 The group of symmetries of an equilateral triangle is isomorphic to S 3. Prove that the alternating group A 3 is isomorphic to Z/3. Prove that orientation preserving symmetries of the square form a subgroup of the group of all symmetries. Prove that this subgroup is isomorphic to Z/4. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

13 The group of symmetries of an equilateral triangle is isomorphic to S 3. Prove that the alternating group A 3 is isomorphic to Z/3. Prove that orientation preserving symmetries of the square form a subgroup of the group of all symmetries. Prove that this subgroup is isomorphic to Z/4. Describe the group of orientation preserving symmetries of a regular n-gon. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

14 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

15 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. There is an obvious homomorphism ϕ: G S 4, sending a symmetry to corresponding permutation of vertices. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

16 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. There is an obvious homomorphism ϕ: G S 4, sending a symmetry to corresponding permutation of vertices. It is injective: if a symmetry fixes all vertices, it must be the identity symmetry. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

17 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. There is an obvious homomorphism ϕ: G S 4, sending a symmetry to corresponding permutation of vertices. It is injective: if a symmetry fixes all vertices, it must be the identity symmetry. Every transposition of neighbors is in the image im(ϕ). Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

18 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. There is an obvious homomorphism ϕ: G S 4, sending a symmetry to corresponding permutation of vertices. It is injective: if a symmetry fixes all vertices, it must be the identity symmetry. Every transposition of neighbors is in the image im(ϕ). But im(ϕ) is a subgroup. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

19 Tetrahedron Theorem The group G of symmetries of a regular tetrahedron is isomorphic to S 4. There is an obvious homomorphism ϕ: G S 4, sending a symmetry to corresponding permutation of vertices. It is injective: if a symmetry fixes all vertices, it must be the identity symmetry. Every transposition of neighbors is in the image im(ϕ). But im(ϕ) is a subgroup. Since S 4 is generated by these transpositions, im(ϕ) = S 4. Done. Sasha Patotski (Cornell University) Isomorphisms November 23, / 5

Bell ringing and group theory

Bell ringing and group theory Bell ringing and group theory Sasha Patotski Cornell University ap744@cornell.edu December 17, 2015 Sasha Patotski (Cornell University) Bell ringing and group theory December 17, 2015 1 / 12 Setup A church

More information

4.2 Simplicial Homology Groups

4.2 Simplicial Homology Groups 4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point

More information

Embedded graphs. Sasha Patotski. Cornell University November 24, 2014

Embedded graphs. Sasha Patotski. Cornell University November 24, 2014 Embedded graphs Sasha Patotski Cornell University ap744@cornell.edu November 24, 2014 Sasha Patotski (Cornell University) Embedded graphs November 24, 2014 1 / 11 Exercise Embed K 6 and K 7 into a torus.

More information

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple Computing the Symmetry Groups of the Platonic Solids with the Help of Maple In this note we will determine the symmetry groups of the Platonic solids. We will use Maple to help us do this. The five Platonic

More information

Math 462: Review questions

Math 462: Review questions Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube

More information

Missouri State University REU, 2013

Missouri State University REU, 2013 G. Hinkle 1 C. Robichaux 2 3 1 Department of Mathematics Rice University 2 Department of Mathematics Louisiana State University 3 Department of Mathematics Missouri State University Missouri State University

More information

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple Computing the Symmetry Groups of the Platonic Solids with the Help of Maple June 27, 2002 In this note we will determine the symmetry groups of the Platonic solids. We will use Maple to help us do this.

More information

1.1 Topological Representatives for Automorphisms

1.1 Topological Representatives for Automorphisms Chapter 1 Out(F n ) and Aut(F n ) 1.1 Topological Representatives for Automorphisms Definition 1.1.1. Let X be a topological space with base point P. A self-homotopy equivalence is a base point preserving

More information

ON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS

ON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS ON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS CHARLES HOMANS Abstract. In this paper we provide an introduction to the properties of one important connection between the

More information

An Investigation of Closed Geodesics on Regular Polyhedra

An Investigation of Closed Geodesics on Regular Polyhedra An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from

More information

Problem 1: A connected graph which contains no cycles is called a tree. Prove that the following are equivalent:

Problem 1: A connected graph which contains no cycles is called a tree. Prove that the following are equivalent: Problem Set 1 Due on February 13th. Problem 1: A connected graph which contains no cycles is called a tree. Prove that the following are equivalent: G is a tree. G is minimally connected, that is G \ e

More information

Groups and Graphs Lecture I: Cayley graphs

Groups and Graphs Lecture I: Cayley graphs Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 1 / 17 graphs A GRAPH is a pair Γ = (V, E) where V - set of vertices

More information

Free groups, Lecture 2, Part 2

Free groups, Lecture 2, Part 2 Free groups, Lecture 2, Part 2 Olga Kharlampovich NYC, Sep 2 1 / 19 We say that a group G embeds into a group H, if there is a monomorphism φ: G H. If φ(g) H, then we say that G properly embeds into H

More information

EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m

EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation

More information

Exercise Find angles x and y as shown in Figure The lines m and n are parallel. 60 y m. x n. Figure

Exercise Find angles x and y as shown in Figure The lines m and n are parallel. 60 y m. x n. Figure Exercise 1.2.1. Find angles x and y as shown in Figure 1.2.11. The lines m and n are parallel. 60 y m 45 x n Figure 1.2.11 Exercise 1.2.2. Find angles α, β and γ as shown in Figure 1.2.12. The lines p

More information

Color Models as Tools in Teaching Mathematics

Color Models as Tools in Teaching Mathematics Color Models as Tools in Teaching Mathematics Ma. Louise Antonette N. De Las Peñas mlp@math.admu.edu.ph Department of Mathematics, Ateneo de Manila University Philippines Abstract: In this paper we discuss

More information

Algebra II: Review Exercises

Algebra II: Review Exercises : Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory

More information

arxiv: v1 [math.dg] 9 Jan 2018

arxiv: v1 [math.dg] 9 Jan 2018 THE SET OF VERTICES WITH POSITIVE CURVATURE IN A PLANAR GRAPH WITH NONNEGATIVE CURVATURE arxiv:1801.02968v1 [math.dg] 9 Jan 2018 BOBO HUA AND YANHUI SU Abstract. In this paper, we give the sharp upper

More information

Resolutions of the pair design, or 1-factorisations of complete graphs. 1 Introduction. 2 Further constructions

Resolutions of the pair design, or 1-factorisations of complete graphs. 1 Introduction. 2 Further constructions Resolutions of the pair design, or 1-factorisations of complete graphs 1 Introduction A resolution of a block design is a partition of the blocks of the design into parallel classes, each of which forms

More information

Braid groups and Curvature Talk 2: The Pieces

Braid groups and Curvature Talk 2: The Pieces Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with

More information

Conway s Tiling Groups

Conway s Tiling Groups Conway s Tiling Groups Elissa Ross Department of Mathematics University of British Columbia, BC, Canada elissa@math.ubc.ca December 12, 2004 Abstract In this paper I discuss a method of John Conway for

More information

The University of Sydney MATH2008 Introduction to Modern Algebra

The University of Sydney MATH2008 Introduction to Modern Algebra 2 Semester 2, 2003 The University of Sydney MATH2008 Introduction to Modern Algebra (http://www.maths.usyd.edu.au/u/ug/im/math2008/) Lecturer: R. Howlett Computer Tutorial 2 This tutorial explores the

More information

FLIP GRAPHS, YOKE GRAPHS AND DIAMETER

FLIP GRAPHS, YOKE GRAPHS AND DIAMETER FLIP GRAPHS, AND Roy H. Jennings Bar-Ilan University, Israel 9th Sèminaire Lotharingien de Combinatoire 0- September, 0 Bertinoro, Italy FLIP GRAPHS, AND FLIP GRAPH TRIANGULATIONS PERMUTATIONS TREES KNOWN

More information

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering. ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

THE FREUDENTHAL-HOPF THEOREM

THE FREUDENTHAL-HOPF THEOREM THE FREUDENTHAL-HOPF THEOREM SOFI GJING JOVANOVSKA Abstract. In this paper, we will examine a geometric property of groups: the number of ends of a group. Intuitively, the number of ends of a group is

More information

Lecture 009 (November 25, 2009) Suppose that I is a small category, and let s(r Mod) I be the category of I-diagrams in simplicial modules.

Lecture 009 (November 25, 2009) Suppose that I is a small category, and let s(r Mod) I be the category of I-diagrams in simplicial modules. Lecture 009 (November 25, 2009) 20 Homotopy colimits Suppose that I is a small category, and let s(r Mod) I be the category of I-diagrams in simplicial modules. The objects of this category are the functors

More information

Topological Invariance under Line Graph Transformations

Topological Invariance under Line Graph Transformations Symmetry 2012, 4, 329-335; doi:103390/sym4020329 Article OPEN ACCESS symmetry ISSN 2073-8994 wwwmdpicom/journal/symmetry Topological Invariance under Line Graph Transformations Allen D Parks Electromagnetic

More information

Geometric structures on 2-orbifolds

Geometric structures on 2-orbifolds Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)

More information

The Graphs of Triangulations of Polygons

The Graphs of Triangulations of Polygons The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation

More information

Primitive groups, graph endomorphisms and synchronization

Primitive groups, graph endomorphisms and synchronization Primitive groups, graph endomorphisms and synchronization João Araújo Universidade Aberta, R. Escola Politécnica, 147 1269-001 Lisboa, Portugal & CAUL/CEMAT, Universidade de Lisboa 1649-003 Lisboa, Portugal

More information

Topology Hmwk 3 All problems are from Allen Hatcher Algebraic Topology (online) ch 1

Topology Hmwk 3 All problems are from Allen Hatcher Algebraic Topology (online) ch 1 Topology Hmwk 3 All problems are from Allen Hatcher Algebraic Topology (online) ch Andrew Ma December 23, 203 This assignment has been corrected post - grading...6 (a) Proof. Assume for a contradiction

More information

GENERALIZED CPR-GRAPHS AND APPLICATIONS

GENERALIZED CPR-GRAPHS AND APPLICATIONS Volume 5, Number 2, Pages 76 105 ISSN 1715-0868 GENERALIZED CPR-GRAPHS AND APPLICATIONS DANIEL PELLICER AND ASIA IVIĆ WEISS Abstract. We give conditions for oriented labeled graphs that must be satisfied

More information

Algebraic Topology: A brief introduction

Algebraic Topology: A brief introduction Algebraic Topology: A brief introduction Harish Chintakunta This chapter is intended to serve as a brief, and far from comprehensive, introduction to Algebraic Topology to help the reading flow of this

More information

On the automorphism group of the m-coloured random graph

On the automorphism group of the m-coloured random graph On the automorphism group of the m-coloured random graph Peter J. Cameron and Sam Tarzi School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk

More information

PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES

PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES HANEY MAXWELL Abstract. We introduce homology and finite topological spaces. From the basis of that introduction, persistent homology is applied to finite

More information

THE DOLD-KAN CORRESPONDENCE

THE DOLD-KAN CORRESPONDENCE THE DOLD-KAN CORRESPONDENCE 1. Simplicial sets We shall now introduce the notion of a simplicial set, which will be a presheaf on a suitable category. It turns out that simplicial sets provide a (purely

More information

Portraits of Groups on Bordered Surfaces

Portraits of Groups on Bordered Surfaces Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu

More information

Chapel Hill Math Circle: Symmetry and Fractals

Chapel Hill Math Circle: Symmetry and Fractals Chapel Hill Math Circle: Symmetry and Fractals 10/7/17 1 Introduction This worksheet will explore symmetry. To mathematicians, a symmetry of an object is, roughly speaking, a transformation that does not

More information

Automorphism Groups of Cyclic Polytopes

Automorphism Groups of Cyclic Polytopes 8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n

More information

James Mahoney Dissertation Adviser: Dr. John Caughman Portland State University

James Mahoney Dissertation Adviser: Dr. John Caughman Portland State University James Mahoney Dissertation Adviser: Dr. John Caughman Portland State University 5-5-2016 Acknowledgements Dr. John Caughman, Chair Committee members: Dr. Nirupama Bulusu Dr. Derek Garton Dr. Paul Latiolais

More information

DIHEDRAL GROUPS KEITH CONRAD

DIHEDRAL GROUPS KEITH CONRAD DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 of the plane preserving a regular n-gon, with the operation being composition. These polygons

More information

A DESCRIPTION OF THE OUTER AUTOMORPHISM OF S 6, AND THE INVARIANTS OF SIX POINTS IN PROJECTIVE SPACE

A DESCRIPTION OF THE OUTER AUTOMORPHISM OF S 6, AND THE INVARIANTS OF SIX POINTS IN PROJECTIVE SPACE A DESCRIPTION OF THE OUTER AUTOMORPHISM OF S 6, AND THE INVARIANTS OF SIX POINTS IN PROJECTIVE SPACE BEN HOWARD, JOHN MILLSON, ANDREW SNOWDEN, AND RAVI VAKIL ABSTRACT. We use a simple description of the

More information

ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT

ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT A graph G is self complementary if it is isomorphic to its complement G.

More information

HOMOLOGY. Equivalently,

HOMOLOGY. Equivalently, HOMOLOGY JOHN ROGNES 1. Homology 1.1. The Euler characteristic. The Euler characteristic of a compact triangulated surface X is defined to be the alternating sum χ(x) = V E + F where V, E and F are the

More information

THE SOLUTION OF LENGTH THREE EQUATIONS OVER GROUPS

THE SOLUTION OF LENGTH THREE EQUATIONS OVER GROUPS Proceedings of the Edinburgh Mathematical Society (1983) 26, 89-96 THE SOLUTION OF LENGTH THREE EQUATIONS OVER GROUPS by JAMES HOWIE* (Received 22nd September 1981) Let G be a group, and let r = r{t) be

More information

Chapter 9. Graph Theory

Chapter 9. Graph Theory Chapter 9. Graph Theory Prof. Tesler Math 8A Fall 207 Prof. Tesler Ch. 9. Graph Theory Math 8A / Fall 207 / 50 Graphs PC Computer network PC2 Modem ISP Remote server PC Emily Dan Friends Irene Gina Harry

More information

Regular Coverings of the Figure Eight Space

Regular Coverings of the Figure Eight Space Regular Coverings of the Figure Eight Space Natasha Komarov Carnegie Mellon University nkomarov@andrew.cmu.edu Oregon State University Summer REU 2007 Regular Coverings of the Figure Eight Space Plan of

More information

arxiv: v4 [math.gr] 16 Apr 2015

arxiv: v4 [math.gr] 16 Apr 2015 On Jones subgroup of R. Thompson group F arxiv:1501.0074v4 [math.gr] 16 Apr 015 Gili Golan, Mark Sapir April 17, 015 Abstract Recently Vaughan Jones showed that the R. Thompson group F encodes in a natural

More information

Lecture 11 COVERING SPACES

Lecture 11 COVERING SPACES Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest

More information

Endomorphisms and synchronization, 2: Graphs and transformation monoids. Peter J. Cameron

Endomorphisms and synchronization, 2: Graphs and transformation monoids. Peter J. Cameron Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras From algebras to relations Given a relational structure R, there are

More information

Endomorphisms and synchronization, 2: Graphs and transformation monoids

Endomorphisms and synchronization, 2: Graphs and transformation monoids Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras Given a relational structure R, there are several similar ways to produce

More information

Alex Schaefer. April 9, 2017

Alex Schaefer. April 9, 2017 Department of Mathematics Binghamton University April 9, 2017 Outline 1 Introduction 2 Cycle Vector Space 3 Permutability 4 A Characterization Introduction Outline 1 Introduction 2 Cycle Vector Space 3

More information

Vertex-transitive direct products of graphs

Vertex-transitive direct products of graphs Vertex-transitive direct products of graphs Richard H. Hammack Department of Mathematics Virginia Commonwealth University Richmond, Virginia U.S.A. rhammack@vcu.edu Wilfried Imrich Dept. of Mathematics

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

More information

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering. ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

Biquasiprimitive oriented graphs of valency four

Biquasiprimitive oriented graphs of valency four Biquasiprimitive oriented graphs of valency four Nemanja Poznanović and Cheryl E. Praeger Abstract In this short note we describe a recently initiated research programme aiming to use a normal quotient

More information

AUTOMORPHISMS OF THE PANTS COMPLEX

AUTOMORPHISMS OF THE PANTS COMPLEX AUTOMORPHISMS OF THE PANTS COMPLEX DAN MARGALIT In loving memory of my mother, Batya 1. Introduction In the theory of mapping class groups, curve complexes assume a role similar to the one that buildings

More information

DIHEDRAL GROUPS KEITH CONRAD

DIHEDRAL GROUPS KEITH CONRAD DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 taking a regular n-gon back to itself, with the operation being composition. These polygons

More information

Geometry Review for Test 3 January 13, 2016

Geometry Review for Test 3 January 13, 2016 Homework #7 Due Thursday, 14 January Ch 7 Review, pp. 292 295 #1 53 Test #3 Thurs, 14 Jan Emphasis on Ch 7 except Midsegment Theorem, plus review Betweenness of Rays Theorem Whole is Greater than Part

More information

Lifts of convex sets and cone factorizations

Lifts of convex sets and cone factorizations Lifts of convex sets and cone factorizations João Gouveia Universidade de Coimbra 20 Dec 2012 - CORE - Université Catholique de Louvain with Pablo Parrilo (MIT) and Rekha Thomas (U.Washington) Lifts of

More information

Some Theorems on Polygons with One-line Spectral Proofs

Some Theorems on Polygons with One-line Spectral Proofs Forum Geometricorum Volume 5 (05) 67 73. FORUM GEOM ISSN 534-78 Some Theorems on Polygons with One-line Spectral Proofs Grégoire Nicollier Abstract. We use discrete Fourier transforms and convolution products

More information

ARTIN S THEOREM: FOR THE STUDENT SEMINAR

ARTIN S THEOREM: FOR THE STUDENT SEMINAR ARTIN S THEOREM: FOR THE STUDENT SEMINAR VIPUL NAIK Abstract. This is a write-up of Artin s theorem for the student seminar in the course on Representation Theory of Finite Groups. Much of the material

More information

Continuous Spaced-Out Cluster Category

Continuous Spaced-Out Cluster Category Brandeis University, Northeastern University March 20, 2011 C π Г T The continuous derived category D c is a triangulated category with indecomposable objects the points (x, y) in the plane R 2 so that

More information

COVERING SPACES, GRAPHS, AND GROUPS

COVERING SPACES, GRAPHS, AND GROUPS COVERING SPACES, GRAPHS, AND GROUPS CARSON COLLINS Abstract. We introduce the theory of covering spaces, with emphasis on explaining the Galois correspondence of covering spaces and the deck transformation

More information

Simplicial Objects and Homotopy Groups

Simplicial Objects and Homotopy Groups Simplicial Objects and Homotopy Groups Jie Wu Department of Mathematics National University of Singapore July 8, 2007 Simplicial Objects and Homotopy Groups -Objects and Homology Simplicial Sets and Homotopy

More information

Geometry Ch 7 Quadrilaterals January 06, 2016

Geometry Ch 7 Quadrilaterals January 06, 2016 Theorem 17: Equal corresponding angles mean that lines are parallel. Corollary 1: Equal alternate interior angles mean that lines are parallel. Corollary 2: Supplementary interior angles on the same side

More information

Lectures on topology. S. K. Lando

Lectures on topology. S. K. Lando Lectures on topology S. K. Lando Contents 1 Reminder 2 1.1 Topological spaces and continuous mappings.......... 3 1.2 Examples............................. 4 1.3 Properties of topological spaces.................

More information

EXPLORATIONS ON THE DIMENSION OF A GRAPH

EXPLORATIONS ON THE DIMENSION OF A GRAPH EXPLORATIONS ON THE DIMENSION OF A GRAPH RYAN KAVANAGH Abstract. Erdős, Harary and Tutte first defined the dimension of a graph G as the minimum number n such that G can be embedded into the Euclidean

More information

Abstract Construction Projects and the Imagination

Abstract Construction Projects and the Imagination Abstract Construction Projects and the Imagination Hands-on projects for understanding abstract mathematical concepts through the use of polyhedral models and planar designs The 3-dimensional projects

More information

Characterizing Finite Frobenius Rings Via Coding Theory

Characterizing Finite Frobenius Rings Via Coding Theory Characterizing Finite Frobenius Rings Via Coding Theory Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra and Communications Seminar University

More information

Note on Group Distance Magic Graphs G[C 4 ]

Note on Group Distance Magic Graphs G[C 4 ] DOI 10.1007/s00373-013-1294-z ORIGINAL PAPER Note on Group Distance Magic Graphs G[C 4 ] Sylwia Cichacz Received: 10 May 2012 / Revised: 25 January 2013 The Author(s) 2013. This article is published with

More information

Normal all pseudo-anosov subgroups of mapping class groups

Normal all pseudo-anosov subgroups of mapping class groups ISSN 1364-0380 (on line) 1465-3060 (printed) 293 Geometry & Topology Volume 4 (2000) 293 307 Published: 10 October 2000 G G G G T T T G T T T G T G T GG TT G G G G GG T T T TT Normal all pseudo-anosov

More information

Vertex-Transitive Polyhedra of Higher Genus, I

Vertex-Transitive Polyhedra of Higher Genus, I Vertex-Transitive Polyhedra of Higher Genus, I Undine Leopold arxiv:1502.07497v1 [math.mg] 26 Feb 2015 Since Grünbaum and Shephard s investigation of self-intersection-free polyhedra with positive genus

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

Homology of Simplicial Complexes

Homology of Simplicial Complexes Homology of Simplicial Complexes Math, David Perkinson Introduction. This is an introduction to the homology of simplicial complexes suitable for a first course in linear algebra. It uses little more than

More information

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( )

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( ) Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers (1879 1935) Investigation Exercise 3.1. (a) Construct a tessellation. (Directions for construction.)

More information

Simplicial Complexes

Simplicial Complexes CHAPTER 7 Simplicial Complexes 1. Simplicial Complexes Singular homology is defined for arbitrary spaces, but as we have seen it may be quite hard to calculate. Also, if the spaces are bizarre enough,

More information

Generating Functions for Hyperbolic Plane Tessellations

Generating Functions for Hyperbolic Plane Tessellations Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in

More information

Chapter. Triangles. Copyright Cengage Learning. All rights reserved.

Chapter. Triangles. Copyright Cengage Learning. All rights reserved. Chapter 3 Triangles Copyright Cengage Learning. All rights reserved. 3.3 Isosceles Triangles Copyright Cengage Learning. All rights reserved. In an isosceles triangle, the two sides of equal length are

More information

KNOTTED SYMMETRIC GRAPHS

KNOTTED SYMMETRIC GRAPHS proceedings of the american mathematical society Volume 123, Number 3, March 1995 KNOTTED SYMMETRIC GRAPHS CHARLES LIVINGSTON (Communicated by Ronald Stern) Abstract. For a knotted graph in S* we define

More information

Two-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014

Two-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 Two-graphs revisited Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 History The icosahedron has six diagonals, any two making the same angle (arccos(1/

More information

Discovering 5-Valent Semi-Symmetric Graphs

Discovering 5-Valent Semi-Symmetric Graphs Discovering 5-Valent Semi-Symmetric Graphs Berkeley Churchill NSF REU in Mathematics Northern Arizona University Flagstaff, AZ 86011 July 27, 2011 Groups and Graphs Graphs are taken to be simple (no loops,

More information

Lecture 008 (November 13, 2009)

Lecture 008 (November 13, 2009) Lecture 008 (November 13, 2009) 17 The Dold-Kan correspondence Suppose that A : op R Mod is a simplicial R-module. Examples to keep in mind are the free simplicial objects R(X) associated to simplicial

More information

Categorical equivalence of some algebras

Categorical equivalence of some algebras ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ Categorical equivalence of some algebras Oleg Košik Abstract. We show that

More information

arxiv: v2 [math.gt] 15 Jan 2014

arxiv: v2 [math.gt] 15 Jan 2014 Finite rigid sets and homologically non-trivial spheres in the curve complex of a surface Joan Birman, Nathan Broaddus and William Menasco arxiv:1311.7646v2 [math.gt] 15 Jan 2014 January 15, 2014 Abstract

More information

arxiv: v1 [math.co] 28 Nov 2016

arxiv: v1 [math.co] 28 Nov 2016 Trees with distinguishing number two arxiv:1611.09291v1 [math.co] 28 Nov 2016 Saeid Alikhani May 15, 2018 Samaneh Soltani Department of Mathematics, Yazd University, 89195-741, Yazd, Iran alikhani@yazd.ac.ir,

More information

MATH 215B MIDTERM SOLUTIONS

MATH 215B MIDTERM SOLUTIONS MATH 215B MIDTERM SOLUTIONS 1. (a) (6 marks) Show that a finitely generated group has only a finite number of subgroups of a given finite index. (Hint: Do it for a free group first.) (b) (6 marks) Show

More information

Representations of Convex Geometries

Representations of Convex Geometries Representations of Convex Geometries K. Adaricheva Nazarbayev University, Astana Algebra Seminar Warsaw University of Technology, June 2015 K.Adaricheva (Nazarbayev University) Convex Geometries 1 / 28

More information

FRUCHT S THEOREM FOR THE DIGRAPH FACTORIAL

FRUCHT S THEOREM FOR THE DIGRAPH FACTORIAL Discussiones Mathematicae Graph Theory 33 (2013) 329 336 doi:10.7151/dmgt.1661 FRUCHT S THEOREM FOR THE DIGRAPH FACTORIAL Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth

More information

arxiv: v1 [math.co] 7 Oct 2012

arxiv: v1 [math.co] 7 Oct 2012 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 REGULAR POLYGONAL COMPLEXES IN SPACE, II DANIEL PELLICER AND EGON SCHULTE arxiv:1210.2061v1 [math.co]

More information

COVERING SPACES AND SUBGROUPS OF THE FREE GROUP

COVERING SPACES AND SUBGROUPS OF THE FREE GROUP COVERING SPACES AND SUBGROUPS OF THE FREE GROUP SAMANTHA NIEVEEN AND ALLISON SMITH Adviser: Dennis Garity Oregon State University Abstract. In this paper we will use the known link between covering spaces

More information

Spaces with algebraic structure

Spaces with algebraic structure University of California, Riverside January 6, 2009 What is a space with algebraic structure? A topological space has algebraic structure if, in addition to being a topological space, it is also an algebraic

More information

Independence Complexes of Certain Families of Graphs

Independence Complexes of Certain Families of Graphs Independence Complexes of Certain Families of Graphs Rickard Fors rifo0@kth.se Master thesis in Mathematics at KTH Presented August 19, 011 Supervisor: Jakob Jonsson Abstract The focus of this report

More information

NOTES ON EULER CHARACTERISTIC

NOTES ON EULER CHARACTERISTIC NOTES ON EULER CHARACTERISTIC JOHN KOPPER Contents 1. Introduction 1 2. Euler characteristic on manifolds 3 3. Gauss-Bonnet 7 4. Singular (co)homology 8 5. De Rham cohomology and Lefschetz theory 11 6.

More information

or else take their intersection. Now define

or else take their intersection. Now define Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P. Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version

More information

Computations of unitary groups in characteristic 2

Computations of unitary groups in characteristic 2 Computations of unitary groups in characteristic 2 15. February 2015 Mohamed Barakat http://www.mathematik.uni-kl.de/~barakat/forjpserre/unitarygroup.pdf Contents 1 Introduction 3 1.1 The package Blocks...................................

More information

Homework 8: Question 1: N and Parity Parity Parity zero one Even Odd Even Odd Even Even Odd Odd Parity ker ker ker ker

Homework 8: Question 1: N and Parity Parity Parity zero one Even Odd Even Odd Even Even Odd Odd Parity ker ker ker ker Homework 8: Question 1: N and Parity Let Ω = {zero, one,, +}. N is an Ω-algebra with the set of natural numbers ø ={0, 1, 2, 3, } as carrier, and with + and defined as usual. Parity is an Ω-algebra with

More information