A few families of non-schurian association schemes 1
|
|
- Miles Joseph
- 6 years ago
- Views:
Transcription
1 A few families of non-schurian association schemes 1 Štefan Gyürki Slovak University of Technology in Bratislava, Slovakia Ben-Gurion University of the Negev, Beer Sheva, Israel CSD6, Portorož Joint work with M. Klin Štefan Gyürki A few families of non-schurian association schemes 1/ 40
2 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points Color graph Under a color graph Γ we will mean an ordered pair (V, R), where V is a set of vertices and R a partition of V V into binary relations. The elements of R will be called as colors, and the number of colors is the rank of Γ. Štefan Gyürki A few families of non-schurian association schemes 2/ 40
3 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points Coherent configuration A coherent configuration is a color graph N = (Ω, R), R = {R i i I }, such that the following axioms are satisfied: (i) The diagonal relation Ω = {(x, x) x Ω} is a union of relations i I R i, for a suitable subset I I. (ii) For each i I there exists i I such that Ri T = R i, where Ri T = {(y, x) (x, y) R i } is the relation transposed to R i. (iii) For any i, j, k I, the number c k i,j of elements z Ω such that (x, z) R i and (z, y) R j is a constant depending only on i, j, k, and independent on the choice of (x, y) R k. Štefan Gyürki A few families of non-schurian association schemes 3/ 40
4 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points The numbers c k i,j are called intersection numbers, or sometimes structure constants of N. An association scheme N = (Ω, R) is a homogeneous coherent configuration, i.e. where the diagonal relation Ω does belong to R. A coherent configuration N is called commutative, if for all i, j, k I we have c k ij = c k ji ; and it is called symmetric if R i = R T i for all i I. Štefan Gyürki A few families of non-schurian association schemes 4/ 40
5 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points The orbits of a group G on the set Ω Ω are called 2-orbits, or orbitals. If 2 Orb(G, Ω) is the set of 2-orbits of a permutation group (G, Ω), then (Ω, 2 Orb(Ω)) is a coherent configuration. Those coherent configurations which can be obtained in this manner are called Schurian, otherwise non-schurian. Thus, Schurian association schemes are coming from transitive permutation groups. Štefan Gyürki A few families of non-schurian association schemes 5/ 40
6 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points The (combinatorial) group of automorphisms Aut(N ) consists of permutations φ : Ω Ω which preserve the relations, i.e. R φ i = R i for all R i R. The color automorphisms preserve relations setwise, i.e. for φ : Ω Ω we have φ CAut(N ) if and only if for all i I there exists j I such that R φ i = R j. An algebraic automorphism is a bijection φ : R R which satisfies c k ij = c kφ i φ j φ. Štefan Gyürki A few families of non-schurian association schemes 6/ 40
7 Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points Let G be a subgroup of the group of algebraic automorphisms of a coherent configuration. Let R/G denote the set of orbits of G on R. For each O R/G define O + to be the union of all relations from O. Then the set of relations {O + O R/G} forms a coherent configuration on Ω. We will call it as algebraic merging of R with respect to G. Štefan Gyürki A few families of non-schurian association schemes 7/ 40
8 Definitions Computer facilities Non-Schurian association schemes on 18 points Why to study association schemes? Applications codes Algebra designs statistical questions. It is a nice table algebra. Transitive group actions on finite sets, distance-regular graphs, finite buildings can be viewed as association schemes. Štefan Gyürki A few families of non-schurian association schemes 8/ 40
9 Computer facilities Definitions Computer facilities Non-Schurian association schemes on 18 points The main results are obtained as theoretical generalizations of observations, which were earned with the aid of a computer. We used the computer algebra system GAP, in conjunction with GRAPE and nauty, packages COCO (Faradžev-Klin, 1991), COCO II (Reichard) and a package of elementary functions for association schemes on GAP (Hanaki, Miyamoto). Štefan Gyürki A few families of non-schurian association schemes 9/ 40
10 Computer facilities Definitions Computer facilities Non-Schurian association schemes on 18 points COCO was the first computer package for computing with coherent configurations developped in 1991 in Moscow by Faradžev s team. induced action of a permutation group on a combinatorial structure; the centralizer algebra of a permutation group; the intersection numbers; to find fusions; to calculate the (combinatorial) automorphism group. Štefan Gyürki A few families of non-schurian association schemes 10/ 40
11 Computer facilities Definitions Computer facilities Non-Schurian association schemes on 18 points COCO II (S. Reichard) Works under GAP. New functions (color automorphisms, algebraic automorphisms,... ). Still under construction. Štefan Gyürki A few families of non-schurian association schemes 11/ 40
12 Definitions Computer facilities Non-Schurian association schemes on 18 points Computer facilities Webpage of Hanaki and Miyamoto Classification of association schemes with small number of vertices (< 39, but not 31, 35, 36, 37). Elementary functions for association schemes on GAP. Štefan Gyürki A few families of non-schurian association schemes 12/ 40
13 Definitions Computer facilities Non-Schurian association schemes on 18 points Non-Schurian association schemes on 18 points A careful analysis of known association schemes on 18 points, which are available from the homepage of Hanaki and Miyamoto, was our starting point. The main interest was to understand two non-schurian association schemes. Štefan Gyürki A few families of non-schurian association schemes 13/ 40
14 Definitions Computer facilities Non-Schurian association schemes on 18 points Non-Schurian association schemes on 18 points The color matrix of the non-schurian association scheme on 18 points of rank 8 (nr. 62 in the catalogue). Štefan Gyürki A few families of non-schurian association schemes 14/ 40
15 Definitions Computer facilities Non-Schurian association schemes on 18 points Non-Schurian association schemes on 18 points The color matrix of the non-schurian association scheme on 18 points of rank 6 (nr. 41 in the catalogue). Štefan Gyürki A few families of non-schurian association schemes 15/ 40
16 What was done? Preliminaries Definitions Computer facilities Non-Schurian association schemes on 18 points Finally, we realized that, for each prime p, we can: work with an intransitive permutation group G of order p 3, acting on two orbits of length p 2, construct a corresponding coherent configuration M of rank 6p 2 with two fibers, detect in M four association schemes. Štefan Gyürki A few families of non-schurian association schemes 16/ 40
17 Biaffine planes Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M The biaffine plane B p consists of two copies of Z p Z p : points P and non-vertical lines L. Points: P = [x, y]. Lines: l = (k, q), y = k x + q. Incidence: P = [x, y] is incident to l = (k, q) if and only if y = k x + q. Štefan Gyürki A few families of non-schurian association schemes 17/ 40
18 Biaffine planes Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M P oints : Lines l k = 0 : Lines l k = 1 : Lines l k = 2 : [0, 2] [1, 2] [2, 2] [0, 1] [1, 1] [2, 1] [0, 0] [1, 0] [2, 0] Figure: The objects of the biaffine plane B 3. Štefan Gyürki A few families of non-schurian association schemes 18/ 40
19 The biaffine coherent configuration Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Take an action of the permutation group G = (Z p ) 2 Z p on the set Ω = P L. At this stage it appears as deus ex machina. Štefan Gyürki A few families of non-schurian association schemes 19/ 40
20 The biaffine coherent configuration Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M G = t 1,0, t 0,1, φ, where t a,b : [x, y] [x + a, y + b], φ : [x, y] [x, y x], (k, q) (k, b + q ak), (k, q) (k 1, q). Štefan Gyürki A few families of non-schurian association schemes 20/ 40
21 The biaffine coherent configuration Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M The group G has 6p 2 orbits on Ω Ω: (P 1, P 2 ) A i x 1 = x 2 and y 2 y 1 = i, where i Z p, (P 1, P 2 ) B i x 2 x 1 = i 0, where i Z p \ {0}, (l 1, l 2 ) C i k 1 = k 2 and q 2 q 1 = i, where i Z p, (l 1, l 2 ) D i k 2 k 1 = i 0, where i Z p \ {0}, (P 1, l 1 ) E i k 1 x 1 + q 1 y 1 = i, where i Z p, (l 1, P 1 ) F i y 1 k 1 x 1 q 1 = i, where i Z p. Štefan Gyürki A few families of non-schurian association schemes 21/ 40
22 The biaffine coherent configuration Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Definition The structure M = (Ω, 2 Orb(G)) is called as a biaffine coherent configuration. Štefan Gyürki A few families of non-schurian association schemes 22/ 40
23 Four color graphs Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M R 0 = A 0 C 0, S i = A i C i, where i = 1, 2,..., p 1, T i = B i D i, where i = 1, 2,..., p 1, U i = E i F i, where i = 0, 1, 2,..., p 1. S i = S i S p i, T i = T i T p i, U i = U i U p i. S = S 1 S 2... S p 1, U = U 1 U 2... U p 1. Štefan Gyürki A few families of non-schurian association schemes 23/ 40
24 Four color graphs Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Color graph M 1 colors: R 0, S 1,..., S p 1, T 1,..., T p 1, U 0, U 1,..., U p 1 Color graph M 2 colors: R 0, S 1, S 2,..., S (p 1)/2, T 1, T 2,..., T p 1, U 0, U 1, U 2,..., U (p 1)/2 Color graph M 3 colors: R 0, S, T 1, T 2,..., T p 1, U 0, U Color graph M 4 : colors: R 0, S, T 1, T 2,..., T (p 1)/2, U 0, U. Štefan Gyürki A few families of non-schurian association schemes 24/ 40
25 Theorem 1 Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Theorem 1 The following holds: (a) M 1, M 2, M 3, M 4 are association schemes. (b) Combinatorial groups of automorphisms of M 1, M 2, M 3, M 4 contain a subgroup isomorphic to G = Z 2 p Z p. Štefan Gyürki A few families of non-schurian association schemes 25/ 40
26 Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Groups of combinatorial automorphisms Theorem 2 Let Aut(M 1 ), Aut(M 2 ), Aut(M 3 ) and Aut(M 4 ) are the combinatorial groups of automorphisms of M 1, M 2, M 3 and M 4, respectively. Then the followings hold: (a) Aut(M 1 ) Aut(M 2 ) = Aut(M 3 ) Aut(M 4 ), (b) Aut(M 1 ) = p 3, (c) Aut(M 2 ) = 2p 3, (d) Aut(M 3 ) = 2p 3, (e) Aut(M 4 ) = 8p 3. Štefan Gyürki A few families of non-schurian association schemes 26/ 40
27 Corollary Preliminaries Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Corollary 3 For each p > 3 there exist at least four non-schurian association schemes M 1, M 2, M 3, and M 4 with ranks 3p 1, 2p, p + 3, and (p + 7)/2, respectively. Štefan Gyürki A few families of non-schurian association schemes 27/ 40
28 The second model of M Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Let V 1 = {(1, x 1, x 2 ) x 1, x 2 Z p }, x 1 V 2 = x 2 x 1, x 2 Z p. 1 Scalar product (1, x 1, x 2 ) y 1 y 2 1 = y 1 + x 1 y 2 x 2. Štefan Gyürki A few families of non-schurian association schemes 28/ 40
29 The second model of M Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Let G = g abc = 1 a b + ac 0 1 c a, b, c Z p. Matrix g abc is invertible, and g 1 abc = 1 a b 0 1 c Štefan Gyürki A few families of non-schurian association schemes 29/ 40
30 The second model of M Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Proposition 4 The set G together with the operation of matrix-multiplication form a group, which is isomorphic to (Z p ) 2 Z p, and, in fact, it is the Sylow subgroup of SL(3, p). Define{ an action of G on Ω = V 1 V 2 by: x g x g if x V 1 = g 1 x if x V 2, for all g G. x g y g = (x g) (g 1 y) = x gg 1 y = x y. Štefan Gyürki A few families of non-schurian association schemes 30/ 40
31 The second model of M Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Proposition 5 Groups G and G are isomorphic. Corollary 6 The scalar product defined in the second model is invariant with respect to G. Thus, all association schemes may be redefined in these new terms. Štefan Gyürki A few families of non-schurian association schemes 31/ 40
32 Some observations and recent proofs Biaffine planes The biaffine coherent configuration Four color graphs Groups of combinatorial automorphisms The second model of M Observation 7 Association schemes M 1, M 2, M 3, M 4 are algebraic mergings of M. Observation 8 AAut(M) = (Z 2 p 1 Z 2 ) AGL(1, p). Theorem 9 AAut(M 1 ) = Z 2 p 1. Štefan Gyürki A few families of non-schurian association schemes 32/ 40
33 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs The graph defined by the relation U 0 for p = 3 is the Pappus graph. Štefan Gyürki A few families of non-schurian association schemes 33/ 40
34 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs McKay-Miller-Širáň graphs Let p be an odd prime and put V p = Z 2 Z p Z p as vertex set of H p. Let ω be a primitive element. If p = 4r + 1 then define X = {1, ω 2, ω 4,..., ω p 3 }, X = {ω, ω 3,..., ω p 2 }. If p = 4r + 3 then define X = {±1, ±ω 2,..., ±ω 2r }, X = {±ω, ±ω 3,..., ±ω 2r+1 }. Štefan Gyürki A few families of non-schurian association schemes 34/ 40
35 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs The adjacency in the graph H p is defined as follows: (0, x, y) is adjacent to (0, x, y ) if and only if y y X, (1, k, q) is adjacent to (1, k, q ) if and only if q q X, (0, x, y) is adjacent to (1, k, q) if and only if y = kx + q. H p = E 0 F 0 A i i X j X C j. H 5 is the well-known Hoffman-Singleton graph. Štefan Gyürki A few families of non-schurian association schemes 35/ 40
36 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs P 0 P 1 P 2 P 3 P Q 0 Q 1 Q 2 Q 3 Q Adjacencies are between i in P j and i jk in Q k for all 0 i, j, k 4. (Robertson) Štefan Gyürki A few families of non-schurian association schemes 36/ 40
37 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs Wenger graphs The graph W n (q) has as vertex set two copies P and L of the (n + 1)-dimensional vector space over F q. The adjacency between points P = [p 1,..., p n+1 ] and lines L = (l 1,..., l n+1 ) is given by the system: l 2 + p 2 = p 1 l 1 l 3 + p 3 = p 1 l 2 l n+1 + p n+1 = p 1 l n.. Štefan Gyürki A few families of non-schurian association schemes 37/ 40
38 The Pappus graph McKay-Miller-Širáň graphs Wenger graphs n = 1 Wenger graphs W 1 (p) are isomorphic to the graphs defined by U 0. For example, W 1 (3) is isomorphic to the Pappus graph. Wenger graphs belong to a richer family of graphs defined by a system of equations. Štefan Gyürki A few families of non-schurian association schemes 38/ 40
39 Preliminaries Faradžev I.A., Klin M.H.:Computer package for computations with coherent configurations, Proc. ISSAC-91, pp Groups, algorithms and programming (GAP), Hafner P.R.: Geometric realization of the graphs of McKay-Miller-Širáň, J. Comb. Th. B, 90(2) (2004), Klin M.H., Muzychuk M.E., Pech C., Woldar A.J., Zieschang P-H.: Association schemes on 28 points as mergings of a half-homogeneous coherent configuration, Eur. J. Combin. 28(7) (2007), Wild P.: Biaffine planes and divisible semiplanes, J. Geom., 25(2) (1985), Štefan Gyürki A few families of non-schurian association schemes 39/ 40
40 Thank you Preliminaries Thank you for your attention. Štefan Gyürki A few families of non-schurian association schemes 40/ 40
The Hoffman-Singleton Graph and its Automorphisms
Journal of Algebraic Combinatorics, 8, 7, 00 c 00 Kluwer Academic Publishers. Manufactured in The Netherlands. The Hoffman-Singleton Graph and its Automorphisms PAUL R. HAFNER Department of Mathematics,
More informationComputer Algebra Investigation of Known Primitive Triangle-Free Strongly Regular Graphs
Computer Algebra Investigation of Known Primitive Triangle-Free Strongly Regular Graphs Matan Ziv-Av (Jointly with Mikhail Klin) Ben-Gurion University of the Negev SCSS 2013 RISC, JKU July 5, 2013 Ziv-Av
More informationComputer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs
Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs Matan Ziv-Av Department of Mathematics, Ben-Gurion University of the Negev,
More informationHoffman-Singleton Graph
Hoffman-Singleton Graph Elena Ortega Fall 2007 MATH 6023 Topics: Design and Graph Theory Graph Project Properties of the Hoffman-Singleton graph If we consider a specified vertex in a graph with order
More informationThe Paulus-Rozenfeld-Thompson strongly regular graph on 26 vertices: animated logo of WL 2018
The Paulus-Rozenfeld-Thompson strongly regular graph on 26 vertices: animated logo of WL 28 July 5 28 This graph T was discovered a few times: { by A. J. L. Paulus in []; { by M. Z. Rozenfeld in [5]; {
More informationEndomorphisms 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 informationDefinition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.
Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is
More informationIs there a McLaughlin geometry?
Is there a McLaughlin geometry? Leonard H. Soicher School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK email: L.H.Soicher@qmul.ac.uk February 9, 2006 Dedicated
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationEndomorphisms 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 informationCLASSIFICATION OF REGULAR DIGRAPHS, NORMALLY REGULAR DIGRAPHS, AND STRONGLY REGULAR DIGRAPHS
International Journal of Pure and Applied Mathematics Volume 78 No. 3 2012, 379-393 ISSN: 1311-8080 (printed version) url: http://www.ijpam.eu PA ijpam.eu CLASSIFICATION OF REGULAR DIGRAPHS, NORMALLY REGULAR
More informationConstructing self-dual chiral polytopes
Constructing self-dual chiral polytopes Gabe Cunningham Northeastern University, Boston, MA October 25, 2011 Definition of an abstract polytope Let P be a ranked poset, whose elements we call faces. Then
More informationBiquasiprimitive 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 informationTwo-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 informationResolutions 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 informationThe normal quotient philosophy. for edge-transitive graphs. Cheryl E Praeger. University of Western Australia
The normal quotient philosophy for edge-transitive graphs Cheryl E Praeger University of Western Australia 1 Edge-transitive graphs Graph Γ = (V, E): V = vertex set E = edge set { unordered pairs from
More informationGENERALIZED 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 information4. 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 informationStructures with lots of symmetry
Structures with lots of symmetry (one of the things Bob likes to do when not doing semigroup theory) Robert Gray Centro de Álgebra da Universidade de Lisboa NBSAN Manchester, Summer 2011 Why? An advertisement
More informationMODELS OF CUBIC THEORIES
Bulletin of the Section of Logic Volume 43:1/2 (2014), pp. 19 34 Sergey Sudoplatov MODELS OF CUBIC THEORIES Abstract Cubic structures and cubic theories are defined on a base of multidimensional cubes.
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationOn 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 informationAutomorphism 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 informationBase size and separation number
Base size and separation number Peter J. Cameron CSG notes, April 2005 Brief history The concept of a base for a permutation group was introduced by Sims in the 1960s in connection with computational group
More informationDiscovering 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 informationThe full automorphism group of a Cayley graph
The full automorphism group of a Cayley graph Gabriel Verret The University of Western Australia Banff, Canada, July 22nd, 2013 Digraphs A digraph Γ is an ordered pair (V, A) where the vertex-set V is
More informationCayley graphs and coset diagrams/1
1 Introduction Cayley graphs and coset diagrams Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X, written Cay(G, X) has two different definitions in the literature.
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationNotation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.
Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)
More informationSynthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry
Synthetic Geometry 1.1 Foundations 1.2 The axioms of projective geometry Foundations Def: A geometry is a pair G = (Ω, I), where Ω is a set and I a relation on Ω that is symmetric and reflexive, i.e. 1.
More informationGraphs associated to CAT(0) cube complexes
Graphs associated to CAT(0) cube complexes Mark Hagen McGill University Cornell Topology Seminar, 15 November 2011 Outline Background on CAT(0) cube complexes The contact graph: a combinatorial invariant
More informationCombinatorial Maps. Francis Lazarus. GIPSA-Lab, CNRS, Grenoble
GIPSA-Lab, CNRS, Grenoble A combinatorial map encodes a graph cellularly embedded in a surface. It is also called a combinatorial surface or a cellular embedding of a graph. Combinatorial (oriented) Maps
More informationGenerating 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 informationGraphs Coverings 1. Roman Nedela. August 7, University of West Bohemia. Novosibirsk State University, Novosibirsk. Graphs Coverings 1
, Pilsen Novosibirsk State University, Novosibirsk August 7, 2018 What is a graph covering? Roughtly speaking a covering X Y is a graph epimorphism that is locally bijective. What is a graph covering?
More informationPERIODS OF ALGEBRAIC VARIETIES
PERIODS OF ALGEBRAIC VARIETIES OLIVIER DEBARRE Abstract. The periods of a compact complex algebraic manifold X are the integrals of its holomorphic 1-forms over paths. These integrals are in general not
More informationGroups 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 informationSymmetry vs. Regularity
(University of Chicago) WL50, Pilsen 6 July 2018 regularity local, easy to verify symmetry global, hard to verify regularity local, easy to verify symmetry global, hard to verify regularity: combinatorial
More informationON 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 informationCube-like Regular Incidence Complexes. by Andrew Cameron Duke
Cube-like Regular Incidence Complexes by Andrew Cameron Duke B.S in Mathematics, Union College M.S. in Electrical Engineering, Lehigh University M.S. in Mathematics, Northeastern University A dissertation
More informationAbout the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design
Preface About the Author Dependency Chart xiii xix xxi Chapter 1: Logic and Sets 1 1.1: Logical Operators: Statements and Truth Values, Negations, Conjunctions, and Disjunctions, Truth Tables, Conditional
More informationToric Cohomological Rigidity of Simple Convex Polytopes
Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationOn vertex-transitive non-cayley graphs
On vertex-transitive non-cayley graphs Jin-Xin Zhou Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China SODO, Queenstown, 2012 Definitions Vertex-transitive graph: A graph is vertex-transitive
More informationRegular polytopes with few flags
Regular polytopes with few flags Marston Conder University of Auckland mconder@aucklandacnz Introduction: Rotary and regular maps A map M is a 2-cell embedding of a connected graph or multigraph (graph
More informationTopological 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 informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationCluster algebras and infinite associahedra
Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the
More informationEDGE-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 informationHC IN (2, 4k, 3)-CAYLEY GRAPHS
HAMILTON CYCLES IN (2, 4k, 3)-CAYLEY GRAPHS University of Primorska November, 2008 Joint work with Henry Glover and Dragan Marušič Definitions An automorphism of a graph X = (V, E) is an isomorphism of
More informationMath 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 informationPolytopes derived from. cubic tessellations
Polytopes derived from cubic tessellations Asia Ivić Weiss York University including joint work with Isabel Hubard, Mark Mixer, Alen Orbanić and Daniel Pellicer TESSELLATIONS A Euclidean tessellation is
More informationArithmetic in Quaternion Algebras
Arithmetic in Quaternion Algebras 31st Automorphic Forms Workshop Jordan Wiebe University of Oklahoma March 6, 2017 Jordan Wiebe (University of Oklahoma) Arithmetic in Quaternion Algebras March 6, 2017
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationCombinatorial and computational group-theoretic methods in the study of graphs and maps with maximal symmetry Banff (November 2008)
Combinatorial and computational group-theoretic methods in the study of graphs and maps with maximal symmetry Banff (November 2008) Marston Conder University of Auckland mconder@aucklandacnz Outline of
More informationFLIP 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 informationGraph Theory Problem Ideas
Graph Theory Problem Ideas April 15, 017 Note: Please let me know if you have a problem that you would like me to add to the list! 1 Classification Given a degree sequence d 1,...,d n, let N d1,...,d n
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationThe optimal routing of augmented cubes.
The optimal routing of augmented cubes. Meirun Chen, Reza Naserasr To cite this version: Meirun Chen, Reza Naserasr. The optimal routing of augmented cubes.. Information Processing Letters, Elsevier, 28.
More information1.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 informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationMissouri 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 informationAxioms for polar spaces
7 Axioms for polar spaces The axiomatisation of polar spaces was begun by Veldkamp, completed by Tits, and simplified by Buekenhout, Shult, Hanssens, and others. In this chapter, the analogue of Chapter
More informationVLSI System Design Part II : Logic Synthesis (1) Oct Feb.2007
VLSI System Design Part II : Logic Synthesis (1) Oct.2006 - Feb.2007 Lecturer : Tsuyoshi Isshiki Dept. Communications and Integrated Systems, Tokyo Institute of Technology isshiki@vlsi.ss.titech.ac.jp
More informationThe Joy of GAP Packages. Leonard H. Soicher Queen Mary, University of London
The Joy of GAP Packages Leonard H. Soicher Queen Mary, University of London Groups in Galway 2009 GAP is an internationally developed system for Computational Group Theory and related areas; is Open Source,
More informationUNIVERSIDAD POLITÉCNICA DE MADRID Escuela Universitaria de Ingeniería Técnica de Telecomunicaciones
UNIVERSIDAD POLITÉCNICA DE MADRID Escuela Universitaria de Ingeniería Técnica de Telecomunicaciones PROYECTO FIN DE CARRERA Use of Automorphisms in Conauto-20 Luis Felipe Núñez Chiroque October, 2011 Acknowledgements
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationCLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE
CLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE DHRUBAJIT CHOUDHURY, SUHYOUNG CHOI, AND GYE-SEON LEE Abstract. The aim of this work is to investigate properties
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationON 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 informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationModule 1. Preliminaries. Contents
Module 1 Preliminaries Contents 1.1 Introduction: Discovery of graphs............. 2 1.2 Graphs.............................. 3 Definitions........................... 4 Pictorial representation of a graph..............
More informationOn the number of optimal surfaces.
On the number of optimal surfaces. Alina Vdovina School of Mathematics and Statistics Newcastle University Newcastle-upon-Tyne NE1 7RU, UK e-mail: alina.vdovina@ncl.ac.uk Abstract Let X be a compact Riemann
More informationThe 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 informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationUniqueness triples from the diamond axiom
Uniqueness triples from the diamond axiom Ari Meir Brodsky Ariel University 11 Iyyar, 5778 Thursday, April 26, 2018 Set Theory, Model Theory and Applications Ben-Gurion University of the Negev, Eilat Campus
More informationProblem Set 3. MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009
Problem Set 3 MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009 1. Show directly that P 1 (s) P 1 (t) for all t s. Proof. Given G, let H s be a subgraph of G on s vertices such that
More informationAlex 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 informationArboreal Dessins D enfants David P. Roberts University of Minnesota, Morris. 2. Rational functions and moduli algebras
Arboreal Dessins D enfants David P. Roberts University of Minnesota, Morris 1. Warm-up activity: a tree game 2. Rational functions and moduli algebras 3. Dessins d enfants 4. The arboreal case 5. The discriminant
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationContinuous 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 informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More informationON 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 informationCharacterizing 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 informationAlgebraic 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 informationThe Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007
The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007 The Gewirtz Graph is the unique strongly regular graph having parameters (56, 10, 0, 2). We will call this graph Γ. This graph was actually discovered
More informationAn 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 informationTORIC VARIETIES JOAQUÍN MORAGA
TORIC VARIETIES Abstract. This is a very short introduction to some concepts around toric varieties, some of the subsections are intended for more experienced algebraic geometers. To see a lot of exercises
More informationRandom strongly regular graphs?
Graphs with 3 vertices Random strongly regular graphs? Peter J Cameron School of Mathematical Sciences Queen Mary, University of London London E1 NS, U.K. p.j.cameron@qmul.ac.uk COMB01, Barcelona, 1 September
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationMAT 3271: Selected Solutions to the Assignment 6
Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically
More informationthe projective completion of the affine plane with four points
Math 3181 Dr. Franz Rothe November 23, 20 1 Test Name: 50 Problem 1.1. Here are once more: a highly symmetric illustration for the Fano plane based on an equilateral triangle the projective completion
More informationFace two-colourable triangulations of K 13
Face two-colourable triangulations of K 13 M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department of Mathematics
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationLecture Notes in Computer Science
Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis 136 Christoph M. Hoffmann IIIIII IIIIIIIll Group-Theoretic Algorithms and Graph Isomorphism IIII I Springer-Verlag Berlin Heidelberg
More informationChapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.
Chapter 3 Quadric hypersurfaces 3.1 Quadric hypersurfaces. 3.1.1 Denition. Denition 1. In an n-dimensional ane space A; given an ane frame fo;! e i g: A quadric hypersurface in A is a set S consisting
More information