DOCSLIB.ORG

The Unity of Combinatorics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Unity of Combinatorics AMS / MAA THE CARUS MATHEMATICAL MONOGRAPHS VOL 36 The Unity of Combinatorics Ezra Brown Richard K. Guy 10.1090/car/036 The Unity of Combinatorics AMS/MAA THE CARUS MATHEMATICAL MONOGRAPHS VOL 36 The Unity of Combinatorics Ezra Brown Richard K. Guy 2018–2019 Editorial Committee Bruce P. Palka, Editor Francis Bonahon Annalisa Crannel Alex Iosevich Kristin Estella Lauter Steven J. Miller Henry Sagerman 2010 Mathematics Subject Classification. Primary 05B05, 05B10, 05B35, 05C15, 11Bxx, 20B25, 51E10, 52C20, 91A46, 94Bxx. Photo credits: The photograph of Richard K. Guy on the back cover is from Wikimedia. This file is licensed under the Creative Commons Attribution 2.0 Generic (https://creativecommons.org/licenses/by/2.0/deed.en) li- cense. For additional information and updates on this book, visit www.ams.org/bookpages/car-36 Page 353 constitutes an extension of this copyright page. © 2020 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government. Printed in the United States of America. ⃝1 The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at https://www.ams.org/ 10 9 8 7 6 5 4 3 2 1 25 24 23 22 21 20 Contents Preface ix Credits and Permissions xiii Introduction 1 Chapter 1 Blocks, sequences, bow ties, and worms 5 1.1 Langford sequences 5 1.2 Partitioning sets of integers 7 1.3 Penrose tilings 12 Chapter 2 Combinatorial games 21 2.1 Wythoff’s game 21 2.2 Combinatorial games: rules and examples 22 2.3 Developing strategies: P-positions and N-positions 25 2.4 Nim, nimbers, and the Sprague–Grundy Theorem 27 2.5 Nim arithmetic and Nim algebra 35 Chapter 3 Fibonacci, Pascal, and Catalan 39 3.1 Fibonacci numbers 39 3.2 The triangle of Pingala, Al Karaji, Yang Hui, and Pascal 44 3.3 The Catalan numbers and the central column of Pascal’s triangle 54 Chapter 4 Catwalks, Sandsteps, and Pascal pyramids 61 Chapter 5 Unique rook circuits 77 Appendix 86 v vi Contents Chapter 6 Sums, colorings, squared squares, and packings 89 6.1 Triples satisfying 푥 + 푦 = 푧 89 6.2 Coil diagrams and the Ringel–Youngs Theorem 91 6.3 Squaring the square 94 6.4 Euler’s polyhedral formula 97 6.5 Packings and coverings of the complete graph 99 6.6 Steiner triple systems 103 Chapter 7 Difference sets and combinatorial designs 107 7.1 Difference sets 107 7.2 Multipliers 113 7.3 Difference sets, de Bruijn cycles, and de Bruijn graphs 115 7.4 Block designs 117 Chapter 8 Geometric connections 123 8.1 A quick tour of projective geometry 123 8.2 Finite projective geometries and Singer designs 132 8.3 Examples: 푛 = 2, 푞 = 2 and 3 137 8.4 Affine planes and magic squares 140 8.5 Heawood’s map on the torus revisited 142 8.6 (7, 3, 1) and Nim 144 8.7 The automorphism group of the Fano plane 148 Chapter 9 The groups 푃푆퐿(2, 7) and 퐺퐿(3, 2) and why they are isomorphic 155 9.1 The group 퐺퐿(3, 2) 157 9.2 The group 푃푆퐿(2, 7) 159 9.3 Constructing an isomorphism of 푃푆퐿(2, 7) onto 퐺퐿(3, 2) 161 Chapter 10 Incidence matrices, codes, and sphere packings 165 10.1 Introducing incidence matrices 165 10.2 Error-correcting codes 167 10.3 Sphere packing 174 10.4 Hadamard matrices and Hadamard difference sets 181 10.5 Hadamard matrices and projective geometries 183 Chapter 11 Kirkman’s schoolgirls, fields, spreads, and hats 187 11.1 Kirkman’s Schoolgirls Problem 187 Contents vii 11.2 Fifteen young ladies at school 188 11.3 Resolvable block designs and Kirkman triple systems 189 11.4 Kirkman’s schoolgirls and difference sets 191 11.5 퐾 = ℚ (√2, √3, √5, √7) and the designs it contains 194 11.6 Spreads in 푃퐺(3, 픽2) and the geometry of Kirkman 199 11.7 Fifteen schoolgirls, fifteen hats, and coding theory 202 11.8 Questions 205 Chapter 12 (7, 3, 1) and combinatorics 209 12.1 (7, 3, 1) and the Heawood graph 210 12.2 (7, 3, 1) and Latin squares 211 12.3 (7, 3, 1) and round-robin tournaments 212 Chapter 13 (7, 3, 1) and normed algebras 217 13.1 Sums of squares 217 13.2 The quaternions and the octonions 220 13.3 Beyond the octonions 225 Chapter 14 (7, 3, 1) and matroids 229 14.1 Why matroids? 230 14.2 Declaration of (in)dependence 230 14.3 Thus, matroids 234 14.4 Matroids and greed 239 Chapter 15 Coin-turning games and Mock Turtles 243 15.1 A review of some combinatorial game theory 243 15.2 Turning Turtles 245 15.3 Turning Corners: coins on a grid 247 15.4 Mock Turtles: more turtles in a line 250 15.5 More about turtle-turning games 252 Chapter 16 The (11, 5, 2) biplane, codes, designs, and groups 257 16.1 “How do you make math exciting for students?” 257 16.2 Difference sets, block designs, and biplanes 259 16.3 The automorphism group of the biplane 261 16.4 Incidence matrices, revisited 265 16.5 Error-correcting codes 266 16.6 Steiner systems 270 viii Contents 16.7 Automorphisms, transitivity, simplicity, and the Mathieu groups 274 Chapter 17 Rick’s Tricky Six Puzzle: More than meets the eye 279 17.1 Sliding-block puzzles 279 17.2 What is the exception? 282 17.3 Not much of a puzzle? 283 17.4 What is the automorphism group of the Tricky Six Puzzle? 286 17.5 Two different group actions 287 17.6 The projective plane of order 4 294 17.7 Buy one, get several free! 299 17.8 The Hoffman–Singleton graph 303 17.9 The Steiner system 푆(5, 6, 12) 305 17.10 A (12,132,4) binary code and Golay’s ternary code 풢12 307 17.11 Conclusions 309 Chapter 18 푆(5, 8, 24) 311 Chapter 19 The Miracle Octad Generator 317 19.1 The Miracle Octad Generator (MOG) 318 19.2 An elementary approach 319 19.3 A more mathematical approach 324 Bibliography 329 Index 338 Preface The Unity of Combinatorics, or TUoC, began as Richard K. Guy’s ple- nary lecture at the combinatorics session of an international conference in 1994. Richard wrote up the lecture as a 30-page paper that appeared in the 1995 session proceedings “Combinatorics Advances”. TUoC was framed as an outline for a series of expository lectures on the various top- ics in the paper. It was a quick but fascinating survey of many different combinatorial problems and their relations to one another. Some years later, Don Albers, Publications Director of the Mathe- matical Association of America (the MAA) approached Richard with a proposal that the MAA publish an expanded version of TUoC in their Carus Monograph Series. Some time later, Don and Richard—now in his 90s—decided to take on a younger coauthor to help get the project moving to completion. That younger author turned out to be the 70ish Ezra (Bud) Brown, a number theorist, combinatorialist, and expository writer of mathematics. Their combined efforts resulted in the book you are now reading. We have divided Richard’s original paper into chapters, expanded the exposition, added explanations, examples, and references, built up back- ground material as needed, and augmented the original paper with ad- ditional connections as seemed appropriate. Eleven chapters consist of previously published articles or excerpts of articles relevant to the topics outlined in TUoC; here is a list of their titles and (authors). • Chapter 4: “Catwalks, Sandsteps, and Pascal pyramids” (Richard K. Guy) • Chapter 5: “Unique rook circuits” (Richard K. Guy and Mark Paul- hus) ix x Preface • Chapter 9: “The groups 푃푆퐿(2, 7) and 퐺퐿(3, 2) and why they are iso- morphic” (Ezra Brown and Nicholas Loehr) • Chapter 11: “Kirkman’s schoolgirls, fields, spreads, and hats” (Ezra Brown and Keith Mellinger) • Chapter 12:“(7, 3, 1) and combinatorics” (Ezra Brown) • Chapter 13:“(7, 3, 1) and normed algebras” (Ezra Brown) • Chapter 14:“(7, 3, 1) and matroids” (David Neel and Nancy Neu- dauer) • Chapter 16: “The (11, 5, 2) biplane, codes, designs, and groups” (Ezra Brown) • Chapter 17: “Rick’s Tricky Six Puzzle: more than meets the eye” (Alex Fink and Richard K. Guy) • Chapter 18:“푆(5, 8, 24)” (Ian Anderson) • Chapter 19: “The Miracle Octad Generator” (Robert Curtis) Chapters 1, 2, 3, 6, 7, 8, 10, and 15 are Guy–Brown collaborations. Thus, we have modeled the structure on John H. Conway and Neil J. A. Sloane’s classic reference work, “Sphere Packings, Lattices and Groups” (see [46]). We begin with sequences, including Langford sequences, Beatty se- quences, the Fibonacci numbers, Pascal’s triangle, and the Catalan num- bers. Topics from graph theory include colorings, packings, embeddings, Kirchoff’s current graphs, and perfect squared squares. Topics from com- binatorial designs include finite projective planes, block designs, Steiner systems, Kirkman’s resolvable designs, difference sets, and symmetries of combinatorial designs. Other topics include Penrose tilings, combi- natorial game theory, matroids, error-correcting codes, matrices with interesting combinatorial properties, and finite geometries. Along the way, we identify and describe some of the many connections between and among these topics. Chapter 15, which treats such curious combinatorial games as Mock Turtles, Turning Corners, Moebius, and Mogul is a bridge between the Preface xi topics treated in Richard’s original paper and the more advanced Chap- ter 17 on Rick’s Tricky Six Puzzle by Alex Fink and Richard.
Load more

Recommended publications
  • Forbidding Subgraphs
    Graph Theory and Additive Combinatorics Lecturer: Prof. Yufei Zhao 2 Forbidding subgraphs 2.1 Mantel’s theorem: forbidding a triangle We begin our discussion of extremal graph theory with the following basic question. Question 2.1. What is the maximum number of edges in an n-vertex graph that does not contain a triangle? Bipartite graphs are always triangle-free. A complete bipartite graph, where the vertex set is split equally into two parts (or differing by one vertex, in case n is odd), has n2/4 edges. Mantel’s theorem states that we cannot obtain a better bound: Theorem 2.2 (Mantel). Every triangle-free graph on n vertices has at W. Mantel, "Problem 28 (Solution by H. most bn2/4c edges. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff). Wiskundige Opgaven 10, 60 —61, 1907. We will give two proofs of Theorem 2.2. Proof 1. G = (V E) n m Let , a triangle-free graph with vertices and x edges. Observe that for distinct x, y 2 V such that xy 2 E, x and y N(x) must not share neighbors by triangle-freeness. Therefore, d(x) + d(y) ≤ n, which implies that d(x)2 = (d(x) + d(y)) ≤ mn. ∑ ∑ N(y) x2V xy2E y On the other hand, by the handshake lemma, ∑x2V d(x) = 2m. Now by the Cauchy–Schwarz inequality and the equation above, Adjacent vertices have disjoint neigh- borhoods in a triangle-free graph. !2 ! 4m2 = ∑ d(x) ≤ n ∑ d(x)2 ≤ mn2; x2V x2V hence m ≤ n2/4.
    [Show full text]
  • The History of Degenerate (Bipartite) Extremal Graph Problems
    The history of degenerate (bipartite) extremal graph problems Zolt´an F¨uredi and Mikl´os Simonovits May 15, 2013 Alfr´ed R´enyi Institute of Mathematics, Budapest, Hungary [email protected] and [email protected] Abstract This paper is a survey on Extremal Graph Theory, primarily fo- cusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions. 1 Contents 1 Introduction 4 1.1 Some central theorems of the field . 5 1.2 Thestructureofthispaper . 6 1.3 Extremalproblems ........................ 8 1.4 Other types of extremal graph problems . 10 1.5 Historicalremarks . .. .. .. .. .. .. 11 arXiv:1306.5167v2 [math.CO] 29 Jun 2013 2 The general theory, classification 12 2.1 The importance of the Degenerate Case . 14 2.2 The asymmetric case of Excluded Bipartite graphs . 15 2.3 Reductions:Hostgraphs. 16 2.4 Excluding complete bipartite graphs . 17 2.5 Probabilistic lower bound . 18 1 Research supported in part by the Hungarian National Science Foundation OTKA 104343, and by the European Research Council Advanced Investigators Grant 267195 (ZF) and by the Hungarian National Science Foundation OTKA 101536, and by the European Research Council Advanced Investigators Grant 321104. (MS). 1 F¨uredi-Simonovits: Degenerate (bipartite) extremal graph problems 2 2.6 Classification of extremal problems . 21 2.7 General conjectures on bipartite graphs . 23 3 Excluding complete bipartite graphs 24 3.1 Bipartite C4-free graphs and the Zarankiewicz problem . 24 3.2 Finite Geometries and the C4-freegraphs .
    [Show full text]
  • Projective Planarity of Matroids of 3-Nets and Biased Graphs
    AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 76(2) (2020), Pages 299–338 Projective planarity of matroids of 3-nets and biased graphs Rigoberto Florez´ ∗ Deptartment of Mathematical Sciences, The Citadel Charleston, South Carolina 29409 U.S.A. [email protected] Thomas Zaslavsky† Department of Mathematical Sciences, Binghamton University Binghamton, New York 13902-6000 U.S.A. [email protected] Abstract A biased graph is a graph with a class of selected circles (“cycles”, “cir- cuits”), called “balanced”, such that no theta subgraph contains exactly two balanced circles. A 3-node biased graph is equivalent to an abstract partial 3-net. We work in terms of a special kind of 3-node biased graph called a biased expansion of a triangle. Our results apply to all finite 3-node biased graphs because, as we prove, every such biased graph is a subgraph of a finite biased expansion of a triangle. A biased expansion of a triangle is equivalent to a 3-net, which, in turn, is equivalent to an isostrophe class of quasigroups. A biased graph has two natural matroids, the frame matroid and the lift matroid. A classical question in matroid theory is whether a matroid can be embedded in a projective geometry. There is no known general answer, but for matroids of biased graphs it is possible to give algebraic criteria. Zaslavsky has previously given such criteria for embeddability of biased-graphic matroids in Desarguesian projective spaces; in this paper we establish criteria for the remaining case, that is, embeddability in an arbitrary projective plane that is not necessarily Desarguesian.
    [Show full text]
  • Finite Geometries
    Finite Geometries Gy¨orgyKiss June 26th, 2012, Rogla gyk Finite Geometries Chain of length h : x0 I x1 I ::: I xh where xi 2 P [ L: The distance of two elements d(x; y) : length of the shortest chain joining them. Generalized polygons Let S = (P; L; I) be a connected, finite point-line incidence geometry. P and L are two distinct sets, the elements of P are called points, the elements of L are called lines. I ⊂ (P × L) [ (L × P) is a symmetric relation, called incidence. gyk Finite Geometries The distance of two elements d(x; y) : length of the shortest chain joining them. Generalized polygons Let S = (P; L; I) be a connected, finite point-line incidence geometry. P and L are two distinct sets, the elements of P are called points, the elements of L are called lines. I ⊂ (P × L) [ (L × P) is a symmetric relation, called incidence. Chain of length h : x0 I x1 I ::: I xh where xi 2 P [ L: gyk Finite Geometries Generalized polygons Let S = (P; L; I) be a connected, finite point-line incidence geometry. P and L are two distinct sets, the elements of P are called points, the elements of L are called lines. I ⊂ (P × L) [ (L × P) is a symmetric relation, called incidence. Chain of length h : x0 I x1 I ::: I xh where xi 2 P [ L: The distance of two elements d(x; y) : length of the shortest chain joining them. gyk Finite Geometries Generalized polygons Definition Let n > 1 be a positive integer.
    [Show full text]
  • Octonion Multiplication and Heawood's
    CONFLUENTES MATHEMATICI Bruno SÉVENNEC Octonion multiplication and Heawood’s map Tome 5, no 2 (2013), p. 71-76. <http://cml.cedram.org/item?id=CML_2013__5_2_71_0> © Les auteurs et Confluentes Mathematici, 2013. Tous droits réservés. L’accès aux articles de la revue « Confluentes Mathematici » (http://cml.cedram.org/), implique l’accord avec les condi- tions générales d’utilisation (http://cml.cedram.org/legal/). Toute reproduction en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation á fin strictement personnelle du copiste est constitutive d’une infrac- tion pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Confluentes Math. 5, 2 (2013) 71-76 OCTONION MULTIPLICATION AND HEAWOOD’S MAP BRUNO SÉVENNEC Abstract. In this note, the octonion multiplication table is recovered from a regular tesse- lation of the equilateral two timensional torus by seven hexagons, also known as Heawood’s map. Almost any article or book dealing with Cayley-Graves algebra O of octonions (to be recalled shortly) has a picture like the following Figure 0.1 representing the so-called ‘Fano plane’, which will be denoted by Π, together with some cyclic ordering on each of its ‘lines’. The Fano plane is a set of seven points, in which seven three-point subsets called ‘lines’ are specified, such that any two points are contained in a unique line, and any two lines intersect in a unique point, giving a so-called (combinatorial) projective plane [8,7].
    [Show full text]
  • The Fact of Modern Mathematics: Geometry, Logic, and Concept Formation in Kant and Cassirer
    THE FACT OF MODERN MATHEMATICS: GEOMETRY, LOGIC, AND CONCEPT FORMATION IN KANT AND CASSIRER by Jeremy Heis B.A., Michigan State University, 1999 Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Pittsburgh 2007 UNIVERSITY OF PITTSBURGH COLLEGE OF ARTS AND SCIENCES This dissertation was presented by Jeremy Heis It was defended on September 5, 2007 and approved by Jeremy Avigad, Associate Professor, Philosophy, Carnegie Mellon University Stephen Engstrom, Associate Professor, Philosophy, University of Pittsburgh Anil Gupta, Distinguished Professor, Philosophy, University of Pittsburgh Kenneth Manders, Associate Professor, Philosophy, University of Pittsburgh Thomas Ricketts, Professor, Philosophy, University of Pittsburgh Dissertation Advisor: Mark Wilson, Professor, Philosophy, University of Pittsburgh ii Copyright © by Jeremy Heis 2007 iii THE FACT OF MODERN MATHEMATICS: GEOMETRY, LOGIC, AND CONCEPT FORMATION IN KANT AND CASSIRER Jeremy Heis, PhD University of Pittsburgh, 2007 It is now commonly accepted that any adequate history of late nineteenth and early twentieth century philosophy—and thus of the origins of analytic philosophy—must take seriously the role of Neo-Kantianism and Kant interpretation in the period. This dissertation is a contribution to our understanding of this interesting but poorly understood stage in the history of philosophy. Kant’s theory of the concepts, postulates, and proofs of geometry was informed by philosophical reflection on diagram-based geometry in the Greek synthetic tradition. However, even before the widespread acceptance of non-Euclidean geometry, the projective revolution in nineteenth century geometry eliminated diagrams from proofs and introduced “ideal” elements that could not be given a straightforward interpretation in empirical space.
    [Show full text]
  • Matroids You Have Known
    26 MATHEMATICS MAGAZINE Matroids You Have Known DAVID L. NEEL Seattle University Seattle, Washington 98122 [email protected] NANCY ANN NEUDAUER Pacific University Forest Grove, Oregon 97116 nancy@pacificu.edu Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day. —Gian Carlo Rota [10] Why matroids? Have you noticed hidden connections between seemingly unrelated mathematical ideas? Strange that finding roots of polynomials can tell us important things about how to solve certain ordinary differential equations, or that computing a determinant would have anything to do with finding solutions to a linear system of equations. But this is one of the charming features of mathematics—that disparate objects share similar traits. Properties like independence appear in many contexts. Do you find independence everywhere you look? In 1933, three Harvard Junior Fellows unified this recurring theme in mathematics by defining a new mathematical object that they dubbed matroid [4]. Matroids are everywhere, if only we knew how to look. What led those junior-fellows to matroids? The same thing that will lead us: Ma- troids arise from shared behaviors of vector spaces and graphs. We explore this natural motivation for the matroid through two examples and consider how properties of in- dependence surface. We first consider the two matroids arising from these examples, and later introduce three more that are probably less familiar. Delving deeper, we can find matroids in arrangements of hyperplanes, configurations of points, and geometric lattices, if your tastes run in that direction.
    [Show full text]
  • The Turan Number of the Fano Plane
    Combinatorica (5) (2005) 561–574 COMBINATORICA 25 Bolyai Society – Springer-Verlag THE TURAN´ NUMBER OF THE FANO PLANE PETER KEEVASH, BENNY SUDAKOV* Received September 17, 2002 Let PG2(2) be the Fano plane, i.e., the unique hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. In this paper we prove that for sufficiently large n, the maximum number of edges in a 3-uniform hypergraph on n vertices not containing a Fano plane is n n/2 n/2 ex n, P G (2) = − − . 2 3 3 3 Moreover, the only extremal configuration can be obtained by partitioning an n-element set into two almost equal parts, and taking all the triples that intersect both of them. This extends an earlier result of de Caen and F¨uredi, and proves an old conjecture of V. S´os. In addition, we also prove a stability result for the Fano plane, which says that a 3-uniform hypergraph with density close to 3/4 and no Fano plane is approximately 2-colorable. 1. Introduction Given an r-uniform hypergraph F,theTur´an number of F is the maximum number of edges in an r-uniform hypergraph on n vertices that does not contain a copy of F. We denote this number by ex(n,F). Determining these numbers is one of the central problems in Extremal Combinatorics, and it is well understood for ordinary graphs (the case r =2). It is completely solved for many instances, including all complete graphs. Moreover, asymptotic results are known for all non-bipartite graphs.
    [Show full text]
  • Finite Projective Geometry 2Nd Year Group Project
    Finite Projective Geometry 2nd year group project. B. Doyle, B. Voce, W.C Lim, C.H Lo Mathematics Department - Imperial College London Supervisor: Ambrus Pal´ June 7, 2015 Abstract The Fano plane has a strong claim on being the simplest symmetrical object with inbuilt mathematical structure in the universe. This is due to the fact that it is the smallest possible projective plane; a set of points with a subsets of lines satisfying just three axioms. We will begin by developing some theory direct from the axioms and uncovering some of the hidden (and not so hidden) symmetries of the Fano plane. Alternatively, some projective planes can be derived from vector space theory and we shall also explore this and the associated linear maps on these spaces. Finally, with the help of some theory of quadratic forms we will give a proof of the surprising Bruck-Ryser theorem, which shows that if a projective plane has order n congruent to 1 or 2 mod 4, then n is the sum of two squares. Thus we will have demonstrated fascinating links between pure mathematical disciplines by incorporating the use of linear algebra, group the- ory and number theory to explain the geometric world of projective planes. 1 Contents 1 Introduction 3 2 Basic Defintions and results 4 3 The Fano Plane 7 3.1 Isomorphism and Automorphism . 8 3.2 Ovals . 10 4 Projective Geometry with fields 12 4.1 Constructing Projective Planes from fields . 12 4.2 Order of Projective Planes over fields . 14 5 Bruck-Ryser 17 A Appendix - Rings and Fields 22 2 1 Introduction Projective planes are geometrical objects that consist of a set of elements called points and sub- sets of these elements called lines constructed following three basic axioms which give the re- sulting object a remarkable level of symmetry.
    [Show full text]
  • Geometry of the Mathieu Groups and Golay Codes
    Proc. Indian Acad. Sci. (Math. Sci.), Vol. 98, Nos 2 and 3, December 1988, pp. 153-177. 9 Printed in India. Geometry of the Mathieu groups and Golay codes ERIC A LORD Centre for Theoretical Studies and Department of Applied Mathematics, Indian Institute of Science, Bangalore 560012, India MS received 11 January 1988 Abstraet. A brief review is given of the linear fractional subgroups of the Mathieu groups. The main part of the paper then deals with the proj~x-~tiveinterpretation of the Golay codes; these codes are shown to describe Coxeter's configuration in PG(5, 3) and Todd's configuration in PG(11, 2) when interpreted projectively. We obtain two twelve-dimensional representations of M24. One is obtained as the coUineation group that permutes the twelve special points in PC,(11, 2); the other arises by interpreting geometrically the automorphism group of the binary Golay code. Both representations are reducible to eleven-dimensional representations of M24. Keywords. Geometry; Mathieu groups; Golay codes; Coxeter's configuration; hemi- icosahedron; octastigms; dodecastigms. 1. Introduction We shall first review some of the known properties of the Mathieu groups and their linear fractional subgroups. This is mainly a brief resum6 of the first two of Conway's 'Three Lectures on Exceptional Groups' [3] and will serve to establish the notation and underlying concepts of the subsequent sections. The six points of the projective line PL(5) can be labelled by the marks of GF(5) together with a sixth symbol oo defined to be the inverse of 0. The symbol set is f~ = {0 1 2 3 4 oo}.
    [Show full text]
  • Spanning Sets and Scattering Sets in Steiner Triple Systems
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY, %XieS A 57, 4659 (1991) Spanning Sets and Scattering Sets in Steiner Triple Systems CHARLESJ. COLBOURN Department of Combinatorics and Optimization, University of Waterloo, Waterloo. Ontario, N2L 3G1, Canada JEFFREYH. DMTZ Department of Mathematics, University of Vermont, Burlington, Vermont 05405 AND DOUGLASR. STINSON Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada Communicated by the Managing Editors Received August 15, 1988 A spanning set in a Steiner triple system is a set of elements for which each element not in the spanning set appears in at least one triple with a pair of elements from the spanning set. A scattering set is a set of elements that is independent, and for which each element not in the scattering set is in at most one triple with a pair of elements from the scattering set. For each v = 1,3 (mod 6), we exhibit a Steiner triple system with a spanning set of minimum cardinality, and a Steiner triple system with a scattering set of maximum cardinality. In the process, we establish the existence of Steiner triple systems with complete arcs of the minimum possible cardinality. 0 1991 Academic Press, Inc. 1. BACKGROUND A Steiner triple system of order u, or STS(u), is a v-element set V, and a set g of 3-element subsets of V called triples, for which each pair of elements from V appears in precisely one triple of 9% For XG V, the spannedsetV(X)istheset {~EV\X:{~,~,~)E~,~,~EX}.A~~~XEV 46 0097-3165/91 $3.00 Copyright 0 1991 by Academic Press, Inc.
    [Show full text]
  • Weak Orientability of Matroids and Polynomial Equations
    WEAK ORIENTABILITY OF MATROIDS AND POLYNOMIAL EQUATIONS J.A. DE LOERA1, J. LEE2, S. MARGULIES3, AND J. MILLER4 Abstract. This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over F2, originally alluded to by Bland and Jensen in their seminal paper on weak orientability. The Bland-Jensen linear equations for a matroid M have a solution if and only if M is weakly orientable. We use the Bland-Jensen system to determine weak orientability for all matroids on at most nine elements and all matroids between ten and twelve elements having rank three. Our experiments indicate that for small rank, about half the time, when a simple matroid is not orientable, it is already non-weakly orientable, and further this may happen more often as the rank increases. Thus, about half of the small simple non-orientable matroids of rank three are not representable over fields having order congruent to three modulo four. For binary matroids, the Bland-Jensen linear systems provide a practical way to check orientability. Second, we present two extensions of the Bland-Jensen equations to slightly larger systems of non-linear polynomial equations. Our systems of polynomial equations have a solution if and only if the associated matroid M is orientable. The systems come in two versions, one directly extending the Bland-Jensen system for F2, and a different system working over other fields. We study some basic algebraic properties of these systems. Finally, we present an infinite family of non-weakly-orientable matroids, with growing rank and co-rank.
    [Show full text]