DOCSLIB.ORG

40 DM16 Abstracts

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
40 DM16 Abstracts 40 DM16 Abstracts IP1 [email protected] Accuracy, Privacy, and Validity: When Right is Wrong and Wrong is Right IP4 In 2008 a simple pen-and-paper privacy attack on aggre- Mathematical Models: Uses, Abuses, and Non-uses gate allele frequency statistics in a Genome-Wide Asso- ciation Study rocked the world of genomics research and Models are indispensable, but have to be used with caution. resulted in a change in access policy for aggregate statistics Some early quantitative models, drawn from the early his- in studies funded by the US National Institutes of Health. tory of British railways and related to the ubiquitous grav- After describing the original attack and summarizing re- ity models of transportation, urban planning, spacial eco- cent advances in attack strategies, we shift to the defense, nomics, and related areas, will be presented. They demon- discussing differential privacy, a notion of privacy tailored strate how even clearly false models can be useful, and how to statistical analysis of large datasets. Signal properties of sometimes they are misused or tragically not used. differential privacy include its resilience to arbitrary side in- formation and the ability to understand cumulative privacy Andrew M. Odlyzko loss over multiple statistical analyses. Finally, we describe University of Minnesota a tight connection between differential privacy and statis- [email protected] tical validity under adaptive (exploratory) data analysis. IP5 Cynthia Dwork Microsoft Research, USA Tangles and the Mona Lisa: Connectivity Versus [email protected] Tree Structure Tangles, first introduced by Robertson and Seymour in IP2 their work on graph minors, are a radically new way to define regions of high connectivity in a graph. The idea From Algorithm to Theorem (in Probabilistic is that, whatever that highly connected region might ‘be’, Combinatorics) low-order separations of the graph cannot cut through it, and so it will orient them: towards the side of the separa- The general question is let X be a set of interesting ”things” tion on which it lies. A tangle, thus, is simply a consistent (permutations, graphs, partitions, ...). Pick x in X at way of orienting all the low-order separations in a graph. random; what does x ”look like”? There are a host of The new paradigm this brings to connectivity theory is that results for taking theorems(e.g., the Gale-Ryser theorem) such consistent orientations of all the low-order separations and turning them into algorithms for efficient generation. may, in themselves, be thought of as highly connected re- This talk goes in the opposite direction: given an algorithm gions: rather than asking exactly which vertices or edges for random generation, what (limit) theorems does it im- belong to such a region, we only ask where it is, collect- ply? One key example, drawn from joint work with Chern, ing pointers to it from all sides. Pixellated images share Kane, and Rhoades—there is a clever algorithm for gener- this property: we cannot tell exactly which pixels belong ating a random set partition due to Stam. This allowed us to the Mona Lisa’s nose, rather than her cheek, but we can to prove the limiting normality of the number of crossings identify ‘low-order’ separations of the picture that do not (and many other functionals), a long-open problem. cut right through such features, and which can therefore be used collectively to delineate them. This talk will outline Persi Diaconis a general theory of tangles that applies not only to graphs Stanford University and matroids but to a broad range of discrete structures. [email protected] Including, perhaps, the pixellated Mona Lisa. Reinhard Diestel IP3 Univeritat Hamburg [email protected] Stabilisation in Algebra, Geometry, and Combina- torics IP6 Throughout mathematics, one encounters sequences of al- gebraic varieties—geometric structures defined by polyno- Induced Matchings, Arithmetic Progressions and mial equations. As the dimension of the variety grows, Communication typically so does its complexity, measured, for instance, by the degrees of its defining equations. And yet, many se- Extremal combinatorics is one of the central branches of quences stabilise in the sense that from some member of the discrete mathematics that deals with the problem of es- sequence on, all complexity is inherited from the smaller timating the maximum possible size of a combinatorial members by applying symmetries. I will present several structure which satisfies certain restrictions. Often, such examples of this, as yet, only partially understood phe- problems also have applications to other areas including nomenon. Beautiful combinatorics of well-quasi-ordered theoretical computer science, additive number theory and sets plays a key role in the proofs. The hope is that, con- information theory. In his talk, we will illustrate this fact versely, algebraic stabilisation may in the future also shed using several closely related examples, focusing on the re- new light on well-quasi-orders. cent works with Alon, Fox, Huang and Moitra. Jan Draisma Benny Sudakov Eindhoven University of Technology, The Netherlands ETH Zurich Department of Mathematics and Computer Science D-Math DM16 Abstracts 41 [email protected] [email protected] IP7 SP2 Quasirandomness, Sidorenko’s Conjecture and Hot Topics Session: Graph Isomorphism in Graph Norms Quasipolynomial Time - Part I of II Using the theory of quasirandomness as an underlying In the first talk I will sketch the main ingredients of the theme, we will discuss recent progress on a number of prob- algorithm and indicate how they lead to quasipolynomial lems in extremal graph theory, including Sidorenko’s con- recurrence. Familiarity with basic concepts of group theory jecture and a question of Lov´asz asking for a classification (such as kernel of a homomorphism) will be assumed. of graphs that define norms. L´aszl´o Babai David Conlon University of Chicago University of Oxford [email protected] [email protected] CP1 IP8 The Family of Plane Graphs with Face Sizes 3 or 4 Excluded Grid Theorem: Improved and Simplified A reduction theorem will be proved for the family of plane One of the key results in Robertson and Seymour’s seminal graphs with faces sizes 3 or 4. Each reduction produces work on graph minors is the Excluded Grid Theorem. The large proper minors in the same family. Each reduction is theorem states that there is a function f, such that for every shown to be necessary. positive integer g, every graph whose treewidth is at least f(g) contains the (gxg)-grid as a minor. This theorem has Sheng Bau found many applications in graph theory and algorithms. University of Natal, Pietermaritzburg An important open question is establishing tight bounds on Private Bag X01, Scottsville 3209 f(g) for which the theorem holds. Robertson and Seymour [email protected] showed that f(g) ≥ Ω(g2logg), and this remains the best current lower bound on f(g). Until recently, the best upper bound was super-exponential in g. In this talk, we will give CP1 an overview of a recent sequence of results, that has lead to Bijections to Split Graphs the best current upper bound of f(g)=O(g19polylog(g)). AgraphG is a split graph if its vertices can be partitioned into a clique and a stable set. We call a split graph balanced Julia Chuzhoy if its partition is unique and unbalanced otherwise. In this Toyota Technological Institute at Chicago talk, we present several proofs, using natural bijections, [email protected] that the number of unbalanced split graphs on n vertices is equal to the number of split graphs on n−1vertices.These proofs demonstrate connections between split graphs and SP0 other well-known combinatorial families. Hot Topics Session: Graph Isomorphism in Quasipolynomial Time - Part II of II Karen Collins Wesleyan University I will explain the core “Local Certificates’ algorithm in de- [email protected] tail and sketch the aggregation of the local certificates. Familiarity with basic concepts of group theory (such as Ann N. Trenk kernel of a homomorphism) will be assumed. Wellesley College L´aszl´o Babai [email protected] University of Chicago [email protected] Christine T. Cheng University of Wisconsin-Milwaukee [email protected] SP1 2016 Dnes Knig Prize Lecture - Phase Transitions CP1 in Random Graph Processes Unhinging Cycles: An Approach to Universal Cy- One of the most interesting features of Erd˝os-R´enyi ran- cles Under Equivalence Relations dom graphs is the ‘percolation phase transition’, where the global structure intuitively changes from only small compo- For all prime numbers p, we investigate universal cycles nents to a single giant component plus small ones. In this of string equivalence classes of length-p under equivalence talk, we discuss the percolation phase transition of Achliop- relations based on non-transitive group actions. We offer tas processes, which are a class of time-evolving variants of two types of equivalences which admit a universal cycle Erd˝os-R´enyi random graphs that (i) can exhibit somewhat of all length-p equivalence classes: first any equivalence surprising phenomena, and (ii) are difficult to analyze due with p greater than a constant dependent on the group to dependencies between the edges. action, second for any p and an equivalence satisfying cer- tain orbit space conditions. We will also introduce a new Lutz Warnke method, called unhinging, to construct the De Bruijn-like University of Cambridge graph that is used to prove the existence of universal cycles. 42 DM16 Abstracts haviour in Grids Melinda Lanius The Prisoner’s Dilemma is played on a graph by assigning Department of Mathematics to each vertex a strategy and the sum of the payoffs of a University of Illinois at Urbana-Champaign single round of the game played with each of the vertex’s [email protected] neighbours.
Load more

Recommended publications
  • Contemporary Mathematics 352
    CONTEMPORARY MATHEMATICS 352 Graph Colorings Marek Kubale Editor http://dx.doi.org/10.1090/conm/352 Graph Colorings CoNTEMPORARY MATHEMATICS 352 Graph Colorings Marek Kubale Editor American Mathematical Society Providence, Rhode Island Editorial Board Dennis DeTurck, managing editor Andreas Blass Andy R. Magid Michael Vogeli us This work was originally published in Polish by Wydawnictwa Naukowo-Techniczne under the title "Optymalizacja dyskretna. Modele i metody kolorowania graf6w", © 2002 Wydawnictwa N aukowo-Techniczne. The present translation was created under license for the American Mathematical Society and is published by permission. 2000 Mathematics Subject Classification. Primary 05Cl5. Library of Congress Cataloging-in-Publication Data Optymalizacja dyskretna. English. Graph colorings/ Marek Kubale, editor. p. em.- (Contemporary mathematics, ISSN 0271-4132; 352) Includes bibliographical references and index. ISBN 0-8218-3458-4 (acid-free paper) 1. Graph coloring. I. Kubale, Marek, 1946- II. Title. Ill. Contemporary mathematics (American Mathematical Society); v. 352. QA166 .247.06813 2004 5111.5-dc22 2004046151 Copying and reprinting. Material in this book may be reproduced by any means for edu- cational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledg- ment of the source is given. This consent does not extend to other kinds of copying for general distribution, for advertising or promotional purposes, or for resale. Requests for permission for commercial use of material should be addressed to the Acquisitions Department, American Math- ematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to reprint-permissien@ams.
    [Show full text]
  • Prizes and Awards
    DENVER • JAN 15–18, 2020 January 2020 Prizes and Awards 4:25 PM, Thursday, January 16, 2020 PROGRAM OPENING REMARKS Michael Dorff, Mathematical Association of America AWARD FOR DISTINGUISHED PUBLIC SERVICE American Mathematical Society BÔCHER MEMORIAL PRIZE American Mathematical Society CHEVALLEY PRIZE IN LIE THEORY American Mathematical Society FRANK NELSON COLE PRIZE IN NUMBER THEORY American Mathematical Society LEONARD EISENBUD PRIZE FOR MATHEMATICS AND PHYSICS American Mathematical Society LEVI L. CONANT PRIZE American Mathematical Society JOSEPH L. DOOB PRIZE American Mathematical Society LEROY P. S TEELE PRIZE FOR MATHEMATICAL EXPOSITION American Mathematical Society LEROY P. S TEELE PRIZE FOR SEMINAL CONTRIBUTION TO RESEARCH American Mathematical Society LEROY P. S TEELE PRIZE FOR LIFETIME ACHIEVEMENT American Mathematical Society LOUISE HAY AWARD FOR CONTRIBUTION TO MATHEMATICS EDUCATION Association for Women in Mathematics M. GWENETH HUMPHREYS AWARD FOR MENTORSHIP OF UNDERGRADUATE WOMEN IN MATHEMATICS Association for Women in Mathematics MICROSOFT RESEARCH PRIZE IN ALGEBRA AND NUMBER THEORY Association for Women in Mathematics SADOSKY RESEARCH PRIZE IN ANALYSIS Association for Women in Mathematics FRANK AND BRENNIE MORGAN PRIZE FOR OUTSTANDING RESEARCH IN MATHEMATICS BY AN UNDERGRADUATE STUDENT American Mathematical Society Mathematical Association of America Society for Industrial and Applied Mathematics COMMUNICATIONS AWARD Joint Policy Board for Mathematics CHAUVENET PRIZE Mathematical Association of America DAVID P. R OBBINS PRIZE Mathematical Association of America EULER BOOK PRIZE Mathematical Association of America DEBORAH AND FRANKLIN TEPPER HAIMO AWARDS FOR DISTINGUISHED COLLEGE OR UNIVERSITY TEACHING OF MATHEMATICS Mathematical Association of America YUEH-GIN GUNG AND DR.CHARLES Y. HU AWARD FOR DISTINGUISHED SERVICE TO MATHEMATICS Mathematical Association of America CLOSING REMARKS Jill C.
    [Show full text]
  • Deborah and Franklin Tepper Haimo Awards for Distinguished College Or University Teaching of Mathematics
    MATHEMATICAL ASSOCIATION OF AMERICA DEBORAH AND FRANKLIN TEPPER HAIMO AWARDS FOR DISTINGUISHED COLLEGE OR UNIVERSITY TEACHING OF MATHEMATICS In 1991, the Mathematical Association of America instituted the Deborah and Franklin Tepper Haimo Awards for Distinguished College or University Teaching of Mathematics in order to honor college or university teachers who have been widely recognized as extraordinarily successful and whose teaching effectiveness has been shown to have had influence beyond their own institutions. Deborah Tepper Haimo was President of the Association, 1991–1992. Citation Jacqueline Dewar In her 32 years at Loyola Marymount University, Jackie Dewar’s enthusiasm, extraordinary energy, and clarity of thought have left a deep imprint on students, colleagues, her campus, and a much larger mathematical community. A student testifies, “Dr. Dewar has engaged the curious nature and imaginations of students from all disciplines by continuously providing them with problems (and props!), whose solutions require steady devotion and creativity….” A colleague who worked closely with her on the Los Angeles Collaborative for Teacher Excellence (LACTE) describes her many “watch and learn” experiences with Jackie, and says, “I continue to hear Jackie’s words, ‘Is this your best work?’—both in the classroom and in all professional endeavors. ...[she] will always listen to my ideas, ask insightful and pertinent questions, and offer constructive and honest advice to improve my work.” As a 2003–2004 CASTL (Carnegie Academy for the Scholarship
    [Show full text]
  • Final Program and Abstracts
    Final Program and Abstracts Sponsored by the SIAM Activity Group on Discrete Mathematics The SIAG on Discrete Mathematics focuses on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing. This activity group provides an opportunity to unify pure discrete mathematics and areas of applied research such as computer science, operations research, combinatorics, and the social sciences. It organizes the SIAM Conference on Discrete Mathematics; co-sponsors, with ACM SIGACT, the annual Symposium on Discrete Algorithms; and sponsors minisymposia at SIAM meetings and conferences. The activity group also runs DM-Net, an electronic forum; publishes an electronic newsletter; and maintains a website and a member directory. Every two years, the activity group also awards the Dénes König Prize to a young researcher for outstanding research in the area of discrete mathematics. Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215-386-7999 Conference Email: [email protected] Conference Web: www.siam.org/meetings/ Membership and Customer Service: (800) 447-7426 (US& Canada) or +1-215-382-9800 (worldwide) www.siam.org/meetings/dm16 2 2016 SIAM Conference on Discrete Mathematics Table of Contents Local Organizing Committee Corporate Members and Affiliates Program-At-A-Glance ..Separate handout Albert Bush SIAM corporate members provide General Information ............................. 2 Georgia State University, USA their employees with knowledge about, Get-togethers ........................................ 4 Yi Zhao access to, and contacts in the applied Invited Plenary Presentations ..............
    [Show full text]
  • Frank and Brennie Morgan Prize for Outstanding Research by An
    FROM THE AMS SECRETARY 2019 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student RAVI JAGADEESAN was awarded the 2019 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student at the 125th Annual Meeting of the AMS in Baltimore, Maryland, in January 2019. Citation Nihal Gowravaram). Then he went on to derive a new The recipient of the 2019 AMS- invariant for the action of the absolute Galois group of Q MAA-SIAM Frank and Brennie on the set of isomorphism classes of the so-called dessins Morgan Prize for Outstanding d’enfants (children’s drawings). In another paper, he gave Research in Mathematics by an a new proof of Serre’s characterization of regular local Undergraduate Student is Ravi rings (joint with Aaron Landesman). At Harvard, he has Jagadeesan of Harvard Univer- worked on the birational geometry of elliptic fibrations sity. Jagadeesan was selected and its connections to the combinatorics of hyperplane as the winner of the Prize for arrangements. His resulting award-winning senior thesis “[his] fundamental contribu- and three related papers (joint with Mboyo Esole, Steven tions across several topics in Jackson, Monica Kang, and Alfred Noël) lie at the interface pure and applied mathematics, of algebraic geometry, combinatorics, and string theory. Ravi Jagadeesan including algebraic geometry, Jagadeesan’s work in mathematical economics is in statistical theory, mathemati- the fields of matching theory, market design, and pub- cal economics, number theory, and combinatorics” from lic finance. In the view of his references, he brings deep a pool with outstanding candidates who impressed the mathematical insights and connections from multiple selection committee.
    [Show full text]
  • The List Distinguishing Number Equals the Distinguishing Number
    The List Distinguishing Number Equals the Distinguishing Number for Interval Graphs Poppy Immel∗ and Paul S. Wenger∗ July 15, 2021 Abstract A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring where each vertex is assigned a color from {1,...,k}. A list assignment to G is an assignment L = {L(v)}v∈V (G) of lists of colors to the vertices of G. A distinguishing L-coloring of G is a distinguishing coloring of G where the color of each vertex v comes from L(v). The list distinguishing number of G is the minimum k such that every list assignment to G in which |L(v)| = k for all v ∈ V (G) yields a distinguishing L-coloring of G. We prove that if G is an interval graph, then its distinguishing number and list distinguishing number are equal. Keywords: 05C60; distinguishing; distinguishing number; list distin- guishing; interval graph 1 Introduction All graphs considered in this paper are finite and simple. We denote the vertex set of a graph G by V (G). An isomorphism from a graph G to a graph H is an adjacency-preserving arXiv:1509.04327v1 [math.CO] 14 Sep 2015 bijection from V (G) to V (H). An automorphism is an isomorphism from a graph to itself. A k-coloring of a graph G is a labeling of the vertices φ : V (G) →{1, 2,...,k} (henceforth we adopt the standard notation [k] for {1,...,k}).
    [Show full text]
  • The List Distinguishing Number Equals the Distinguishing Number for Interval Graphs
    Discussiones Mathematicae Graph Theory 37 (2017) 165–174 doi:10.7151/dmgt.1927 THE LIST DISTINGUISHING NUMBER EQUALS THE DISTINGUISHING NUMBER FOR INTERVAL GRAPHS Poppy Immel and Paul S. Wenger School of Mathematical Sciences Rochester Institute of Technology Rochester, NY, USA e-mail: [email protected] [email protected] Abstract A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring where each vertex is assigned a color from {1,...,k}. A list assignment to G is an assignment L = {L(v)}v∈V (G) of lists of colors to the vertices of G. A distinguishing L-coloring of G is a distinguishing coloring of G where the color of each vertex v comes from L(v). The list distinguishing number of G is the minimum k such that every list assignment to G in which |L(v)| = k for all v ∈ V (G) yields a distinguishing L-coloring of G. We prove that if G is an interval graph, then its distinguishing number and list distinguishing number are equal. Keywords: distinguishing, distinguishing number, list distinguishing, in- terval graph. 2010 Mathematics Subject Classification: 05C60. 1. Introduction All graphs considered in this paper are finite and simple. We denote the vertex set of a graph G by V (G). An isomorphism from a graph G to a graph H is an adjacency-preserving bijection from V (G) to V (H).
    [Show full text]
  • Dhruv Mubayi
    DHRUV MUBAYI Department of Mathematics, Statistics and Computer Science University of Illinois Chicago, IL 60607 Tel: (312) 413-8036; Fax: (312) 996-149 E-mail: [email protected] web: http://homepages.math.uic.edu/~mubayi/ PERSONAL • Born on August 20, 1973 in Bombay (now Mumbai), India MATHEMATICAL INTERESTS • Combinatorics, especially extremal and probabilistic questions on graphs and hypergraphs, with applications to Theoretical Computer Science EMPLOYMENT HISTORY • 2008{: Professor, University of Illinois at Chicago • 2007{2008: Associate Professor, Department of Mathematical Sciences, Carnegie Mellon University • 2005{2008: Associate Professor, University of Illinois at Chicago • 2002{2005: Assistant Professor, University of Illinois at Chicago • 2001{2002: Postdoctoral Researcher, Theory Group, Microsoft Research • 1998{2001: Visiting Assistant Professor, School of Mathematics, Georgia Institute of Technology EDUCATION • 1998: Ph.D. in Mathematics, University of Illinois at Urbana-Champaign • 1995: B.S. in Mathematics, Magna cum Laude, Davidson College Second person in the history of Davidson College to graduate with High Honors in mathematics AWARDS/FELLOWSHIPS • 2019: Fellow of the American Mathematical Society (class of 2020) • 2005: Alfred P. Sloan Research Fellowship • 1998: Phi Kappa Phi, University of Illinois • 1998: Trjitzinski and Parker Fellowships, University of Illinois • 1996: Liberal Arts Scholarship and Trjitzinski Fellowship, University of Illinois • 1995: Phi Beta Kappa, Davidson College • 1995: William G. McGavock
    [Show full text]
  • Groups, Graphs, and Symmetry-Breaking
    Groups, Graphs, and Symmetry-Breaking Karen S. Potanka Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of Master of Science in Mathematics Dr. Ezra Brown, Chair Dr. Joseph Ball Dr. Monte Boisen April 16, 1998 Blacksburg, Virginia Keywords: Petersen Graph, Symmetry-Breaking, Graph Theory Copyright 1998, Karen S. Potanka Groups, Graphs, and Symmetry-Breaking Karen S. Potanka (ABSTRACT) A labeling of a graph G is said to be r-distinguishing if no automorphism of G preserves all of the vertex labels. The smallest such number r for which there is an r-distinguishing labeling on G is called the distinguishing number of G.Thedistinguishing set of a group Γ, D(Γ), is the set of distinguishing numbers of graphs G in which Aut(G) ∼= Γ. It is shown that D(Γ) is non-empty for any finite group Γ. In particular, D(Dn) is found where Dn is the dihedral group with 2n elements. From there, the generalized Petersen graphs, GP (n, k), are defined and the automorphism groups and distinguishing numbers of such graphs are given. Contents 1 Introduction 1 2 Representation of Graphs 2 3 Automorphism Groups and Group Actions 3 3.1Automorphisms.................................. 3 3.2GroupActions................................... 4 4 Distinguishing Number of a Graph 7 5 Groups and Graphs 10 5.1CayleyGraphs.................................. 10 5.2Frucht’sConstruction............................... 11 6 Distinguishing the Orbits of a Graph 14 6.1DistinguishingtheOrbits............................. 16 6.2SizeoftheOrbit................................. 17 6.3NumberofOrbits................................. 17 7 Dihedral Groups 18 7.1 Subgroups of Dn ................................. 18 7.1.1 Types of Subgroups of Dn .......................
    [Show full text]
  • A Vizing-Like Theorem for Union Vertex-Distinguishing Edge Coloring Nicolas Bousquet, Antoine Dailly, Eric Duchene, Hamamache Kheddouci, Aline Parreau
    A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Eric Duchene, Hamamache Kheddouci, Aline Parreau To cite this version: Nicolas Bousquet, Antoine Dailly, Eric Duchene, Hamamache Kheddouci, Aline Parreau. A Vizing- like theorem for union vertex-distinguishing edge coloring. Discrete Applied Mathematics, Elsevier, 2017, 232, pp.88-98. 10.1016/j.dam.2017.07.002. hal-01313088v2 HAL Id: hal-01313088 https://hal.archives-ouvertes.fr/hal-01313088v2 Submitted on 17 Jul 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousqueta, Antoine Daillyb,∗, Eric´ Duch^eneb, Hamamache Kheddoucib, Aline Parreaub aG-SCOP (CNRS, Univ. Grenoble-Alpes), Grenoble, France. bUniv Lyon, Universit´eLyon 1, LIRIS UMR CNRS 5205, F-69621, Lyon, France. Abstract We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the problem of finding a coloring with the minimum number of colors where every vertex receives a distinct label.
    [Show full text]
  • Trinity College Bulletin, 1962-1963 (Report of the Dean) Trinity College
    Trinity College Trinity College Digital Repository Trinity College Bulletins and Catalogues Trinity serial publications (1850 - present) 12-1-1963 Trinity College Bulletin, 1962-1963 (Report of the Dean) Trinity College Follow this and additional works at: http://digitalrepository.trincoll.edu/bulletin Recommended Citation Trinity College, "Trinity College Bulletin, 1962-1963 (Report of the Dean)" (1963). Trinity College Bulletins and Catalogues. 257. http://digitalrepository.trincoll.edu/bulletin/257 This Book is brought to you for free and open access by the Trinity serial publications (1850 - present) at Trinity College Digital Repository. It has been accepted for inclusion in Trinity College Bulletins and Catalogues by an authorized administrator of Trinity College Digital Repository. EPORT OF THE DEAN r the Academic Year 1962-1963 Corporation ALBERT CHARLES JACOB , LL.D., President* Hartford JAMES LIPPINCOTT GooDWIN, M.F. * Hartford MARTIN WITHINGTON CLEMENT, D.ENG., LL.D. Philadelphia Pa. RoBERT BARNARD O'CoNNOR, D.F.A. New York, N.Y. LYMAN BusHNELL BRAINERD, B.A., V ice Chairman* Hartford ARNOLD HENRY Mo E , B.A., Secretary* Hartford JEROME PIERCE WEB TER, M.D.* New York, N.Y. JOHN RicHARD CooK, B.s.* Hartford ROBERT SEYMOUR MORRIS, M .. Hartford KARL WILLIAM HALLDEN, C.D. * Thomaston JOHN REINHART REITEMEYER, B.A. Hartford THE RT. REv. WALTER HENRY GRAY, .T.D. Hartford GEORGE KEITH FuN TON, L.H.D. * New York, N.Y. RAYMOND JOHN WEAN, SC.D. Warren, Ohio HENRY SAMUEL BEERS, B.A.* Hartford OsTROM ENDERS, B.A.* Avon GEORGE MALLETTE FERRIS, B.A.* Washington, D.C. ALLERTON CUSHMAN HICKMOTT, LITT.D. West Hartford GEORGE WARREN WYCKOFF, B.A.
    [Show full text]
  • Number of Distinguishing Colorings and Partitions
    Number of Distinguishing Colorings and Partitions Bahman Ahmadi, Fatemeh Alinaghipour and Mohammad Hadi Shekarriz∗ Department of Mathematics, Shiraz University, 71454, Shiraz, Iran. bahman.ahmadi, fatemeh.naghipour, [email protected] Abstract A vertex coloring of a graph G is called distinguishing (or symmetry breaking) if no non-identity automorphism of G preserves it, and the distinguishing number, shown by D(G), is the smallest number of colors required for such a coloring. This paper is about counting non-equivalent distinguishing colorings of graphs with k colors. A parameter, namely Φk(G), which is the number of non-equivalent distinguishing colorings of a graph G with at most k colors, is shown here to have an application in calculating the distinguishing number of the lexicographic product and the X-join of graphs. We study this index (and some other similar indices) which is generally difficult to calculate. Then, we show that if one knows the distinguishing threshold of a graph G, which is the smallest number of colors θ(G) so that, for k ≥ θ(G), every k-coloring of G is distinguishing, then, in some special cases, counting the number of distinguishing colorings with k colors is very easy. We calculate θ(G) for some classes of graphs including the Kneser graph K(n, 2). We then turn to vertex partitioning by studying the distinguishing coloring partition of a graph G; a partition of vertices of G which induces a distinguishing coloring for G. There, we introduce Ψk(G) as the number of non-equivalent distinguishing coloring partitions with at most k cells, which is a generalization to its distinguishing coloring counterpart.
    [Show full text]