DOCSLIB.ORG

Jennifer Beineke & Jason Rosenhouse

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Jennifer Beineke & Jason Rosenhouse The Mathematics of Various Entertaining Subjects THE MATHEMATICS OF VARIOUS ENTERTAINING SUBJECTS Volume 2 RESEARCH IN GAMES, GRAPHS, COUNTING, AND COMPLEXITY EDITED BY Jennifer Beineke & Jason Rosenhouse WITH A FOREWORD BY RON GRAHAM National Museum of Mathematics, New York • Princeton University Press, Princeton and Oxford Copyright c 2017 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu In association with the National Museum of Mathematics, 11 East 26th Street, New York, New York 10010 Jacket art: Top row (left to right) Fig. 1: Courtesy of Eric Demaine and William S. Moses. Fig. 2: Courtesy of Aviv Adler, Erik Demaine, Adam Hesterberg, Quanquan Liu, and Mikhail Rudoy. Fig. 3: Courtesy of Peter Winkler. Middle row (left to right) Fig. 1: Courtesy of Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Quanquan Liu, Ron Taylor, and Ryuhei Uehara. Fig. 2: Courtesy of Robert Bosch, Robert Fathauer, and Henry Segerman. Fig. 3: Courtesy of Jason Rosenhouse. Bottom row (left to right) Fig. 1: Courtesy of Noam Elkies. Fig. 2: Courtesy of Richard K. Guy. Fig. 3: Courtesy of Jill Bigley Dunham and Gwyn Whieldon. Excerpt from “Macavity: The Myster Cat” from Old Possum’s Book of Cats by T. S. Eliot. Copyright 1939 by T. S. Eliot. Copyright c Renewed 1967 by Esme Valerie Eliot. Reprinted by permission of Houghton Mifflin Harcourt Publishing Company and Faber & Faber Ltd. All rights reserved. All Rights Reserved Library of Congress Cataloging-in-Publication Data Names: Beineke, Jennifer Elaine, 1969– editor. | Rosenhouse, Jason, editor. Title: The mathematics of various entertaining subjects : research in games, graphs, counting, and complexity / edited by Jennifer Beineke & Jason Rosenhouse ; with a foreword by Ron Graham. Description: Princeton : Princeton University Press ; New York : Published in association with the National Museum of Mathematics, [2017] | Copyright 2017 by Princeton University Press. | Includes bibliographical references and index. Identifiers: LCCN 2017003240 | ISBN 9780691171920 (hardcover : alk. paper) Subjects: LCSH: Mathematical recreations-Research. Classification: LCC QA95 .M36874 2017 | DDC 793.74–dc23 LC record available at https://lccn.loc.gov/2017003240 British Library Cataloging-in-Publication Data is available This book has been composed in Minion Pro Printed on acid-free paper. ∞ Typeset by Nova Techset Private Limited, Bangalore, India Printed in the United States of America 13579108642 Contents Foreword by Ron Graham vii Preface and Acknowledgments xi PART I PUZZLES AND BRAINTEASERS 1 The Cyclic Prisoners 3 Peter Winkler 2 Dragons and Kasha 11 Tanya Khovanova 3 The History and Future of Logic Puzzles 23 Jason Rosenhouse 4 The Tower of Hanoi for Humans 52 Paul K. Stockmeyer 5 Frenicle’s 880 Magic Squares 71 John Conway, Simon Norton, and Alex Ryba PART II GEOMETRY AND TOPOLOGY 6 A Triangle Has Eight Vertices But Only One Center 85 Richard K. Guy 7 Enumeration of Solutions to Gardner’s Paper Cutting and Folding Problem 108 Jill Bigley Dunham and Gwyneth R. Whieldon 8 The Color Cubes Puzzle with Two and Three Colors 125 Ethan Berkove, David Cervantes-Nava, Daniel Condon, Andrew Eickemeyer, Rachel Katz, and Michael J. Schulman 9 Tangled Tangles 141 Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Quanauan Liu, Ron Taylor, and Ryuhei Uehara vi • Contents PART III GRAPH THEORY 10 Making Walks Count: From Silent Circles to Hamiltonian Cycles 157 Max A. Alekseyev and Gérard P. Michon 11 Duels, Truels, Gruels, and Survival of the Unfittest 169 Dominic Lanphier 12 Trees, Trees, So Many Trees 195 Allen J. Schwenk 13 Crossing Numbers of Complete Graphs 218 Noam D. Elkies PART IV GAMES OF CHANCE 14 Numerically Balanced Dice 253 Robert Bosch, Robert Fathauer, and Henry Segerman 15 A TROUBLE-some Simulation 269 Geoffrey D. Dietz 16 A Sequence Game on a Roulette Wheel 286 Robert W. Vallin PART V COMPUTATIONAL COMPLEXITY 17 Multinational War Is Hard 301 Jonathan Weed 18 Clickomania Is Hard, Even with Two Colors and Columns 325 Aviv Adler, Erik D. Demaine, Adam Hesterberg, Quanquan Liu, and Mikhail Rudoy 19 Computational Complexity of Arranging Music 364 Erik D. Demaine and William S. Moses About the Editors 379 About the Contributors 381 Index 387 Foreword Ron Graham recreation—something people do to relax or have fun. —Merriam–Webster Dictionary One of the strongest human instincts is the overwhelming urge to “solve puzzles.” Whether this means how to make fire, avoid being eaten by wolves, keep dry in the rain, or predict solar eclipses, these “puzzles” have been with us since before civilization. Of course, people who were better at successfully dealing with such problems had a better chance of surviving, and then, as a consequence, so did their descendants. (A current (fictional) solver of problems like this is the character played by Matt Damon in the recent film The Martian). On a more theoretical level, mathematical puzzles have been around for thousands of years. The Palimpsest of Archimedes contains several pages de- voted to the so-called Stomachion, a geometrical puzzle consisting of fourteen polygonal pieces which are to be arranged into a 12 × 12 square. It is believed that the problem given was to enumerate the number of different ways this could be done, but since a number of the pages of the Palimpsest are missing, we are not quite sure. It is widely acknowledged by now that many recreational puzzles have led to quite deep mathematical developments as researchers delved more deeply into some of these problems. For example, the existence of Pythagorean triples, such as 32 + 42 = 52, and quartic quadruples, such as 26824404 + 153656394 + 187967604 = 206156734, led to questions, such as whether xn + yn = zn could ever hold for positive integers x, y,andz when n ≥ 3. (The answer: No! This was Andrew Wiles’ resolution of Fermat’s Last Theorem, which spurred the development of even more powerful tools for attacking even more difficult viii • Foreword TABLE 1. Numbers expressible in the form n = 6xy ± x ± y x y 6xy + x + y 6xy + x − y 6xy − x + y 6xy − x − y 1 1 8 6 6 4 2 1 15 13 11 9 2 2 28 24 24 20 3 1 22 20 16 14 3 2 41 37 35 31 3 3 60 54 54 48 4 1 29 27 21 19 . questions.) Similar stories could be told in a variety of other areas, such as the analysis of games of chance in the Middle Ages leading to the development of probability theory, and the study of knots leading to fundamental work on von Neumann algebras. In 1900, at the International Congress of Mathematicians in Paris, the legendary mathematician David Hilbert gave his celebrated list of twenty-three problems which he felt would keep the mathematicians busy for the remainder of the century. He was right! Many of these problems are still unsolved. (Actually, he only mentioned eight of the problems during his talk. The full list of twenty-three was only published later.) In that connection, Hilbert also wrote about the role of problems in mathematics. Paraphrasing, he said that problems are the core of any mathematical discipline. It is with problems that you can “test the temper of your steel.” However, it is often difficult to judge the difficulty (or importance) of a particular problem in advance. Let me give two of my favorite examples. Problem 1. Consider the set of positive integers n which can be represented as n = 6xy ± x ± y, where x ≥ y ≥ 0. Some such numbers are displayed in Table 1. It seems like most of the small numbers occur in the table, although some are missing. The list of the missing numbers begins {1, 2, 3, 5, 7, 10, 12, 17, 18, 23,...}. Are there infinitely many numbers m that are not in the table? I will give the answer at the end. Here is another problem. Foreword • ix Problem 2. A well-studied function in number theory is the divisor function d(n), which denotes the sum of the divisors of the integer n. For example, d(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28, and d(100) = 1 + 2 + 4 + 5 + 10 + 20 + 25 + 50 + 100 = 217. Another common function in mathematics is the harmonic number H(n).Itis defined by n 1 H(n) = . k k=1 In other words, H(n) is the sum of the reciprocals of the first n integers. Is it true that d(n) ≤ H(n) + e H(n) log H(n), for n ≥ 1? How hard could this be? Actually, pretty hard (or so it seems!). Readers of this volume will find an amazing assortment of brainteasers, challenges, problems, and “puzzles” arising in a variety of mathematical (and non-mathematical) domains. And who knows whether some of these problems will be the acorns from which mighty mathematical oaks will someday emerge! As for the problems, the answer to each is that no one knows! For Problem 1, each number m that is missing from the table corresponds to a pair of twin primes 6m − 1, 6m + 1. Furthermore, every pair of twin primes (except 3 and 5) occur this way. Recall, a pair of twin primes is a set of two prime numbers which differ by two. Thus, Problem 1 is really asking whether there are infinitely many pairs of twin primes. As Paul Erdos˝ liked to say, “Every right-thinking person knows the answer is yes,” but so far no one has been able to prove this. It is known that there exist infinitely many pairs of primes which differ by at most 246, the establishment of which was actually a major achievement in itself! For Problem 2, it is known that the answer is yes if and only if the Riemann Hypothesis holds! As I said, this appears to be a rather difficult problem at present (to say the least).
Load more

Recommended publications
  • COMPUTING the TOPOLOGICAL INDICES for CERTAIN FAMILIES of GRAPHS 1Saba Sultan, 2Wajeb Gharibi, 2Ali Ahmad 1Abdus Salam School of Mathematical Sciences, Govt
    Sci.Int.(Lahore),27(6),4957-4961,2015 ISSN 1013-5316; CODEN: SINTE 8 4957 COMPUTING THE TOPOLOGICAL INDICES FOR CERTAIN FAMILIES OF GRAPHS 1Saba Sultan, 2Wajeb Gharibi, 2Ali Ahmad 1Abdus Salam School of Mathematical Sciences, Govt. College University, Lahore, Pakistan. 2College of Computer Science & Information Systems, Jazan University, Jazan, KSA. [email protected], [email protected], [email protected] ABSTRACT. There are certain types of topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. Among degree based topological indices, the so-called atom-bond connectivity (ABC), geometric arithmetic (GA) are of vital importance. These topological indices correlate certain physico-chemical properties such as boiling point, stability and strain energy etc. of chemical compounds. In this paper, we compute formulas of General Randi´c index ( ) for different values of α , First zagreb index, atom-bond connectivity (ABC) index, geometric arithmetic GA index, the fourth ABC index ( ABC4 ) , fifth GA index ( GA5 ) for certain families of graphs. Key words: Atom-bond connectivity (ABC) index, Geometric-arithmetic (GA) index, ABC4 index, GA5 index. 1. INTRODUCTION AND PRELIMINARY RESULTS Cheminformatics is a new subject which relates chemistry, is connected graph with vertex set V(G) and edge set E(G), du mathematics and information science in a significant manner. The is the degree of vertex and primary application of cheminformatics is the storage, indexing and search of information relating to compounds. Graph theory has provided a vital role in the aspect of indexing. The study of ∑ Quantitative structure-activity (QSAR) models predict biological activity using as input different types of structural parameters of where .
    [Show full text]
  • Some Families of Convex Polytopes Labeled by 3-Total Edge Product Cordial Labeling
    Punjab University Journal of Mathematics (ISSN 1016-2526) Vol. 49(3)(2017) pp. 119-132 Some Families of Convex Polytopes Labeled by 3-Total Edge Product Cordial Labeling Umer Ali Department of Mathematics, UMT Lahore, Pakistan. Email: [email protected] Muhammad bilal Department of Mathematics, UMT Lahore, Pakistan. Email: [email protected] Sohail Zafar Department of Mathematics, UMT Lahore, Pakistan. Email: [email protected] Zohaib Zahid Department of Mathematics, UMT Lahore, Pakistan. Email: zohaib [email protected] Received: 03 January, 2017 / Accepted: 10 April, 2017 / Published online: 18 August, 2017 Abstract. For a graph G = (VG;EG), consider a mapping h : EG ! ∗ f0; 1; 2; : : : ; k − 1g, 2 ≤ k ≤ jEGj which induces a mapping h : VG ! ∗ Qn f0; 1; 2; : : : ; k − 1g such that h (v) = i=1 h(ei)( mod k), where ei is an edge incident to v. Then h is called k-total edge product cordial ( k- TEPC) labeling of G if js(i) − s(j)j ≤ 1 for all i; j 2 f1; 2; : : : ; k − 1g: Here s(i) is the sum of all vertices and edges labeled by i. In this paper, we study k-TEPC labeling for some families of convex polytopes for k = 3. AMS (MOS) Subject Classification Codes: 05C07 Key Words: 3-TEPC labeling, The graphs of convex polytopes. 119 120 Umer Ali, Muhammad Bilal, Sohail Zafar and Zohaib Zahid 1. INTRODUCTION AND PRELIMINARIES Let G be an undirected, simple and finite graph with vertex-set VG and edge-set EG. Order of a graph G is the number of vertices and size of a graph G is the number of edges.
    [Show full text]
  • 13. Mathematics University of Central Oklahoma
    Southwestern Oklahoma State University SWOSU Digital Commons Oklahoma Research Day Abstracts 2013 Oklahoma Research Day Jan 10th, 12:00 AM 13. Mathematics University of Central Oklahoma Follow this and additional works at: https://dc.swosu.edu/ordabstracts Part of the Animal Sciences Commons, Biology Commons, Chemistry Commons, Computer Sciences Commons, Environmental Sciences Commons, Mathematics Commons, and the Physics Commons University of Central Oklahoma, "13. Mathematics" (2013). Oklahoma Research Day Abstracts. 12. https://dc.swosu.edu/ordabstracts/2013oklahomaresearchday/mathematicsandscience/12 This Event is brought to you for free and open access by the Oklahoma Research Day at SWOSU Digital Commons. It has been accepted for inclusion in Oklahoma Research Day Abstracts by an authorized administrator of SWOSU Digital Commons. An ADA compliant document is available upon request. For more information, please contact [email protected]. Abstracts from the 2013 Oklahoma Research Day Held at the University of Central Oklahoma 05. Mathematics and Science 13. Mathematics 05.13.01 A simplified proof of the Kantorovich theorem for solving equations using scalar telescopic series Ioannis Argyros, Cameron University The Kantorovich theorem is an important tool in Mathematical Analysis for solving nonlinear equations in abstract spaces by approximating a locally unique solution using the popular Newton-Kantorovich method.Many proofs have been given for this theorem using techniques such as the contraction mapping principle,majorizing sequences, recurrent functions and other techniques.These methods are rather long,complicated and not very easy to understand in general by undergraduate students.In the present paper we present a proof using simple telescopic series studied first in a Calculus II class.
    [Show full text]
  • Simple Variations on the Tower of Hanoi to Guide the Study Of
    Simple Variations on the Tower of Hanoi to Guide the Study of Recurrences and Proofs by Induction Saad Mneimneh Department of Computer Science Hunter College, The City University of New York 695 Park Avenue, New York, NY 10065 USA [email protected] Abstract— Background: The Tower of Hanoi problem was The classical solution for the Tower of Hanoi is recursive in formulated in 1883 by mathematician Edouard Lucas. For over nature and proceeds to first transfer the top n − 1 disks from a century, this problem has become familiar to many of us peg x to peg y via peg z, then move disk n from peg x to peg in disciplines such as computer programming, data structures, algorithms, and discrete mathematics. Several variations to Lu- z, and finally transfer disks 1; : : : ; n − 1 from peg y to peg z cas’ original problem exist today, and interestingly some remain via peg x. Here’s the (pretty standard) algorithm: unsolved and continue to ignite research questions. Research Question: Can this richness of the Tower of Hanoi be Hanoi(n; x; y; z) explored beyond the classical setting to create opportunities for if n > 0 learning about recurrences and proofs by induction? then Hanoi(n − 1; x; z; y) Contribution: We describe several simple variations on the Tower Move(1; x; z) of Hanoi that can guide the study and illuminate/clarify the Hanoi(n − 1; y; x; z) pitfalls of recurrences and proofs by induction, both of which are an essential component of any typical introduction to discrete In general, we will have a procedure mathematics and/or algorithms.
    [Show full text]
  • A 2-Parametric Generalization of Sierpinski Gasket Graphs
    A 2-parametric generalization of Sierpi´nski gasket graphs Marko Jakovac Faculty of Natural Sciences and Mathematics University of Maribor Koroˇska cesta 160, 2000 Maribor, Slovenia [email protected] Abstract Graphs S[n; k] are introduced as the graphs obtained from the Sierpi´nskigraphs S(n; k) by contracting edges that lie in no complete subgraph Kk. The family S[n; k] is a generalization of a previously studied class of Sierpi´nskigasket graphs Sn. Several properties of graphs S[n; k] are studied in particular, hamiltonicity and chromatic number. Key words: Sierpi´nskigraphs; Sierpi´nskigasket graphs; Hamiltonicity; Chromatic number AMS subject classification (2000): 05C15, 05C45 1 Introduction Sierpi´nski-like graphs appear in many different areas of graph theory, topol- ogy, probability ([8, 11]), psychology ([16]), etc. The special case S(n; 3) turns out to be only a step away of the famous Sierpi´nskigasket graphs Sn|the graphs obtained after a finite number of iterations that in the limit give the Sierpi´nskigasket, see [10]. This connection was introduced by Grundy, Scorer and Smith in [23] and later observed in [24]. Graphs S(n; 3) are also important for the Tower of Hanoi game since they are isomorphic to Hanoi graphs with n discs and 3 pegs. Metric properties, planarity, vertex and edge coloring were studied by now, see, for instance [1, 5, 6, 7, 14, 22]. Furthermore, in [12] it is proved that graphs S(n; 3) are uniquely 3-edge-colorable and have unique Hamiltonian cycles. Graphs S(n; 3) can be generalized to Sierpi´nski graphs S(n; k), k ≥ 3, which are also called Klavˇzar-Milutinovi´cgraphs and denoted KMnk 1 [17].
    [Show full text]
  • Arxiv:0905.0015V3 [Math.CO] 20 Mar 2021
    The Tower of Hanoi and Finite Automata Jean-Paul Allouche and Jeff Shallit Abstract Some of the algorithms for solving the Tower of Hanoi puzzle can be applied “with eyes closed” or “without memory”. Here we survey the solution for the classical Tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy Tower of Hanoi. 1 Introduction A huge literature in mathematics and theoretical computer science deals with the Tower of Hanoi and generalizations. The reader can look at the references given in the bibliography of the present paper, but also at the papers cited in these references (in particular in [5, 13]). A very large bibliography was provided by Stockmeyer [27]. Here we present a survey of the relations between the Tower of Hanoi and monoid morphisms or finite automata. We also give a new result on morphisms generating the classical and the lazy Tower of Hanoi (Theorem 4). Recall that the Tower of Hanoi puzzle has three pegs, labeled I, II,III,and N disks of radii 1,2,...,N. At the beginning the disks are placed on peg I, in decreasing order of size (the smallest disk on top). A move consists of taking the topmost disk from one peg and moving it to another peg, with the condition that no disk should cover a smaller one. The purpose is to transfer all disks from the initial peg arXiv:0905.0015v3 [math.CO] 20 Mar 2021 to another one (where they are thus in decreasing order as well).
    [Show full text]
  • Graphs, Random Walks, and the Tower of Hanoi
    Rose-Hulman Undergraduate Mathematics Journal Volume 20 Issue 1 Article 6 Graphs, Random Walks, and the Tower of Hanoi Stephanie Egler Baldwin Wallace University, Berea, [email protected] Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Egler, Stephanie (2019) "Graphs, Random Walks, and the Tower of Hanoi," Rose-Hulman Undergraduate Mathematics Journal: Vol. 20 : Iss. 1 , Article 6. Available at: https://scholar.rose-hulman.edu/rhumj/vol20/iss1/6 Rose-Hulman Undergraduate Mathematics Journal VOLUME 20, ISSUE 1, 2019 Graphs, Random Walks, and the Tower of Hanoi By Stephanie Egler Abstract. The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and computing. Typically used as a classroom example of the important phenomenon of recursion, the puzzle has also been intensively studied its own right, using graph theory, probability, and other tools. The subject of this paper is “Hanoi graphs”,that is, graphs that portray all the possible arrangements of the puzzle, together with all the possible moves from one arrangement to another. These graphs are not only fascinating in their own right, but they shed considerable light on the nature of the puzzle itself. We will illustrate these graphs for different versions of the puzzle, as well as describe some important properties, such as planarity, of Hanoi graphs. Finally, we will also discuss random walks on Hanoi graphs. 1 The Tower of Hanoi The Tower of Hanoi is a famous puzzle originally introduced by a “Professor Claus” in 1883.
    [Show full text]
  • I Note on the Cyclic Towers of Hanoi
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 123 (1994) 3-7 Elsevier I Note on the cyclic towers of Hanoi Jean-Paul Allouche CNRS Mathkmatiques et Informatique. lJniversit& Bordeaux I. 351 cows de la Lib&ration, 33405 Talence Cedex, France Abstract Allouche, J.-P., Note on the cyclic towers of Hanoi, Theoretical Computer Science 123 (1994) 3-7. Atkinson gave an algorithm for moving N disks from a peg to another one in the cyclic towers of Hanoi. We prove that the resulting infinite sequence obtained as N goes to infinity is not k-automatic for any k>2. 0. Introduction The well-known tower of Hanoi puzzle consists of three pegs and N disks of radius 1,2, I.. ) N. At the beginning, all the disks are stacked on the first peg in decreasing order (1 being the topmost disk). At each step one is allowed to pick up the topmost disk of a peg and to put it on another peg, provided a disk is never on a smaller one. The game is ended when all disks are on the same (new) peg. The classical (recursive) algorithm for solving this problem provides us with an infinite sequence of moves (with values in the set of the 6 possible moves), whose prefixes of length 2N - 1 give the moves which carry N disks from the first peg to the second one (if N is odd) or to the third one (if N is even).
    [Show full text]
  • Hanoi, Counting and Sierpinski's Triangle Infinite Complexity in Finite
    Hanoi, Counting and Sierpinski's triangle Infinite complexity in finite area Math Circle December 5, 2017 1. Per usual we are going to be watching a video today, but we aren't going to be watching it right at the beginning. Before we start the video, let's play a game. Figure 1: A schemetic for the Towers of Hanoi Puzzle. Taken from http://www. cs.brandeis.edu/~storer/JimPuzzles/ZPAGES/zzzTowersOfHanoi.html The towers of Hanoi is a very simple game, here are the rules. Start with three wooden pegs, and five disks with holes drilled through the center. Place the disks on the first peg such that the radius of the disks is de- scending. The goal of this game is to move all of the disks onto the very last peg so that they are all in the same order that they started. Here are the rules: • You can only move 1 disk at a time from one peg to another. • You can only move the top disk on a peg. If you want to move the bottom disk, you first have to move all of the other disks. • You can never place a larger disk on top of a smaller peg. For exam- ple, if in the picture above if you moved the top disk of peg A onto peg B, you could not then move top new top disk from A into peg B. 1 The question is, is it possible to move all of the disks from peg A to peg C? If it is, what is the minimum number of moves that you have to do? (a) Before we get into the mathematical analysis, let's try and get our hands dirty.
    [Show full text]
  • Amplitudes and Correlators to Ten Loops Using Simple, Graphical Bootstraps
    Amplitudes and Correlators to Ten Loops Using Simple, Graphical Bootstraps Paul Heslop September 7th Workshop on New formulations for scattering amplitudes ASC Munich based on: arXiv:1609.00007 with Bourjaily, Tran Outline Four-point stress-energy multiplet correlation function integrands in planar N = 4 SYM to 10 loops ) 10 loop 4-pt amplitude, 9 loop 5-point (parity even) amplitude, 8 loop 5-point (full) amplitude Method (Bootstrappy): Symmetries (extra symmetry of correlators), analytic properties, planarity ) basis of planar graphs Fix coefficients of these graphs using simple graphical rules: the triangle, square and pentagon rules Discussion of results to 10 loops [higher point correlators + correlahedron speculations] Correlators in N = 4 SYM (Correlation functions of gauge invariant operators) Gauge invariant operators: gauge invariant products (ie traces) of the fundamental fields Simplest operator O(x)≡Tr(φ(x)2) (φ one of the six scalars) The simplest non-trivial correlation function is G4(x1; x2; x3; x4) ≡ hO(x1)O(x2)O(x3)O(x4)i O(x) 2 stress energy supermultiplet. (We can consider correlators of all operators in this multiplet using superspace.) Correlators in N = 4 AdS/CFT 5 Supergravity/String theory on AdS5 × S = N =4 super Yang-Mills Correlation functions of gauge invariant operators in SYM $ string scattering in AdS Contain data about anomalous dimensions of operators and 3 point functions via OPE !integrability / bootstrap Finite Big Bonus more recently: Correlators give scattering amplitudes Method for computing correlation
    [Show full text]
  • From Silent Circles to Hamiltonian Cycles Arxiv:1602.01396V3
    Making Walks Count: From Silent Circles to Hamiltonian Cycles Max A. Alekseyev and G´erard P. Michon Leonhard Euler (1707{1783) famously invented graph theory in 1735, by solving a puzzle of interest to the inhabitants of K¨onigsberg. The city comprised three distinct land masses, connected by seven bridges. The residents sought a walk through the city that crossed each bridge exactly once, but were consistently unable to find one. Euler reduced the problem to its bare bones by representing each land mass as a node and each bridge as an edge connecting two nodes. He then showed that such a puzzle would have a solution if and only if every node was at the origin of an even number of edges, with at most two exceptions| which could only be at the start or the end of the journey. Since this was not the case in K¨onigsberg, the puzzle had no solution. The sort of diagram Euler employed, in which the nodes were represented by dots and the edges by line segments connecting the dots, is today referred to as a graph. Sometimes it is convenient to use arrows instead of line segments, to imply that the connection goes in only one direction. The resulting construct is now referred to as a directed graph, or digraph for short. Except for tiny examples like the one inspired by K¨onigsberg, a sketch on paper is rarely an adequate description of a graph. One convenient representation of a digraph is given by its adjacency matrix A, where the element Ai;j is the number of edges going from node i to node j (in a simple graph, that number is either 0 or 1).
    [Show full text]
  • Research Article Fibonacci Mean Anti-Magic Labeling Of
    Kong. Res. J. 5(1): 1-3, 2018 ISSN 2349-2694, All Rights Reserved, Publisher: Kongunadu Arts and Science College, Coimbatore. http://krjscience.com RESEARCH ARTICLE FIBONACCI MEAN ANTI-MAGIC LABELING OF SOME GRAPHS Ameenal Bibi, K. and T. Ranjani* P.G. and Research Department of Mathematics, D.K.M College for Women (Autonomous), Vellore - 632 001, Tamil Nadu, India. ABSTRACT In this paper, we introduced Fibonacci mean anti-magic labeling in graphs. A graph G with p vertices and q edges is said to have Fibonacci mean anti-magic labeling if there is an injective function 푓: 퐸(퐺) → 퐹푗 , ie, it is possible to label the edges with the Fibonacci number Fj where (j= 0,1,1,2…n) in such a way that the edge uv is labeled with ∣푓 푢 +푓 푣 ∣ 푖푓 ∣ 푓 푢 + 푓 푣 ∣ 푖푠 푒푣푒푛, 2 ∣ 푓 푢 +푓 푣 ∣+1 푖푓 ∣ 푓 푢 + 푓 푣 ∣ 푖푠 표푑푑 and the resulting vertex labels admit mean 2 anti-magic labeling. In this paper, we discussed the Fibonacci mean anti-magic labeling for some special classes of graphs. Keywords: Fibonacci mean labeling, circulant graph, Bistar, Petersen graph, Fibonacci mean anti-magic labeling. AMS Subject Classification (2010): 05c78. 1. INTRODUCTION The concept of Fibonacci labeling was Definition 1.2. introduced by David W. Bange and Anthony E. A graph G with p vertices and q edges Barkauskas in the form Fibonacci graceful (1). The admits mean anti-magic labeling if there is an concept of skolem difference mean labeling was injective function 푓from the edges 퐸 퐺 → introduced by Murugan and Subramanian (2).
    [Show full text]