DOCSLIB.ORG

Downloadable PDF Program

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Downloadable PDF Program Program and Abstracts CanaDAM 2021 The Canadian Discrete and Algorithmic Mathematics Conference 2021.canadam.math.ca May 25 – May 28, 2021 This program was generated on: May 19, 2021 Table of Contents List of Abbreviations 1 Plenary Talks 3 Invited Minisymposia 4 Contributed Minisymposia 5 Contributed Talks 6 Schedule Overview 7 Detailed Daily Schedule – Tuesday May 25 8 Detailed Daily Schedule – Wednesday May 26 11 Detailed Daily Schedule – Thursday May 27 15 Detailed Daily Schedule – Friday May 28 18 Detailed Daily Schedule – by Session 22 Abstracts 40 Plenary Speakers 40 IM1: Combinatorial Optimization - Part I 43 IM2: Invitation to distributed graph algorithms 45 CM1: Algebraic and Combinatorial Approaches to Designs and Codes - Part I 47 CM2: Arithmetic Combinatorics - Part I 49 CM3: Chemical Graph Theory - Part I 51 CM4: Computational proof techniques for combinatorics on words 53 CM5: Extremal problems for hypergraphs 55 CM6: Graph Searching 57 CT1: Random graphs 59 IM3: Approximation Algorithms 61 CM7: Algebraic and Combinatorial Approaches to Designs and Codes - Part II 63 CM8: Chemical Graph Theory - Part II 65 CM9: Cycles in Planar Graphs 67 CM10: Graph Product Structure Theory 69 CM11: Movement and symmetry in graphs - Part I 71 CT2: Broadcasting and Domination 73 CT3: Spectral graph theory and distance-regular graphs 75 IM4: Discrete Geometry 77 IM5: Extremal Combinatorics 79 IM6: In honour of Pavol Hell - Part I 81 IM7: Invitation to Sparsity 83 CM12: Algebraic and Combinatorial Approaches to Designs and Codes - Part III 85 CM13: Arithmetic Combinatorics - Part II 87 CM14: Chemical Graph Theory - Part III 89 CM15: The Metric Dimension of a Graph and its Variants - Part I 91 CT4: Hamiltonicity 93 CT5: Scheduling and Algorithms 95 IM8: Combinatorial Optimization - Part II 97 IM9: Discrete and algorithmic mathematics in biology and epidemiology - Part I 99 IM10: In honour of Pavol Hell - Part II 101 CM16: Average Graph Parameters - Part I 103 CM17: Graph Polynomials - Part I 105 CM18: Recent aspects of sphere packings - Part I 107 CT6: Game Theory 109 CT7: Graph Colouring I 111 CT8: Patterns and Compositions 113 CT9: Polynomials and groups 115 IM11: Discrete and algorithmic mathematics in biology and epidemiology - Part II 117 IM12: Generating series and confined lattice walks - Part I 119 CM19: Coherent configurations with few fibers - Part I 121 CM20: Spectral Graph Theory - Part I 123 CM21: The Metric Dimension of a Graph and its Variants - Part II 125 CT10: Arithmetic Combinatorics 127 CT11: Hypergraphs 129 CT12: Orientations 131 CT13: Potage of algorithmic designs 133 CT14: Structures in Graphs 135 IM13: Combinatorics on Posets - Part I 137 IM14: Invitation to Reconfiguration - Part I 139 IM15: Probabilistic Approaches 141 CM22: Coherent configurations with few fibers - Part II 143 CM23: Graph Polynomials - Part II 145 CM24: New Trends in Analytic Combinatorics 147 CM25: Recent aspects of sphere packings - Part II 149 CT15: Graph Colouring II 151 CT16: Structural Graph Theory 153 PIL: Public Interest Lecture 155 IM16: Combinatorics on Posets - Part II 156 IM17: Generating series and confined lattice walks - Part II 158 CM26: Algorithms for interval graphs and related families - Part I 160 CM27: Flow polytopes of graphs 162 CM28: Graph Colouring – surfaces, homomorphisms, and distinguishing 164 CM29: Movement and symmetry in graphs - Part II 166 CM30: Practical Applications of Design Theory - Part I 168 CM31: Spectral Graph Theory - Part II 170 CT17: Contributed Talks II 172 IM18: Invitation to Reconfiguration - Part II 174 IM19: Structural Graph Theory 176 CM32: Algorithms for interval graphs and related families - Part II 178 CM33: Average Graph Parameters - Part II 180 CM34: Enumerative and Extremal Graph Theory 182 CM35: Practical Applications of Design Theory - Part II 184 CT18: Contributed Talks I 186 CT19: Contributed Talks III 188 CT20: Flows and signed graphs 190 CT21: Posets and lattices 192 Talk List in Order of Speaker’s Last Name 194 1 List of Abbreviations CM = Contributed Minisymposium CT = Contributed Talk IM = Invited Minisymposium SM = Special Minisymposium PIL Public Interest Lecture Plenary Plenary Speakers CM1 Algebraic and Combinatorial Approaches to Designs and Codes - Part I CM2 Arithmetic Combinatorics - Part I CM3 Chemical Graph Theory - Part I CM4 Computational proof techniques for combinatorics on words CM5 Extremal problems for hypergraphs CM6 Graph Searching CM7 Algebraic and Combinatorial Approaches to Designs and Codes - Part II CM8 Chemical Graph Theory - Part II CM9 Cycles in Planar Graphs CM10 Graph Product Structure Theory CM11 Movement and symmetry in graphs - Part I CM12 Algebraic and Combinatorial Approaches to Designs and Codes - Part III CM13 Arithmetic Combinatorics - Part II CM14 Chemical Graph Theory - Part III CM15 The Metric Dimension of a Graph and its Variants - Part I CM16 Average Graph Parameters - Part I CM17 Graph Polynomials - Part I CM18 Recent aspects of sphere packings - Part I CM19 Coherent configurations with few fibers - Part I CM20 Spectral Graph Theory - Part I CM21 The Metric Dimension of a Graph and its Variants - Part II CM22 Coherent configurations with few fibers - Part II CM23 Graph Polynomials - Part II CM24 New Trends in Analytic Combinatorics CM25 Recent aspects of sphere packings - Part II CM26 Algorithms for interval graphs and related families - Part I CM27 Flow polytopes of graphs CM28 Graph Colouring – surfaces, homomorphisms, and distinguishing CM29 Movement and symmetry in graphs - Part II CM30 Practical Applications of Design Theory - Part I CM31 Spectral Graph Theory - Part II CM32 Algorithms for interval graphs and related families - Part II CM33 Average Graph Parameters - Part II CM34 Enumerative and Extremal Graph Theory CM35 Practical Applications of Design Theory - Part II CT1 Random graphs CT2 Broadcasting and Domination CT3 Spectral graph theory and distance-regular graphs CT4 Hamiltonicity CT5 Scheduling and Algorithms CT6 Game Theory CT7 Graph Colouring I CT8 Patterns and Compositions CT9 Polynomials and groups CT10 Arithmetic Combinatorics CT11 Hypergraphs Back to Table of Contents 2 CT12 Orientations CT13 Potage of algorithmic designs CT14 Structures in Graphs CT15 Graph Colouring II CT16 Structural Graph Theory CT17 Contributed Talks II CT18 Contributed Talks I CT19 Contributed Talks III CT20 Flows and signed graphs CT21 Posets and lattices IM1 Combinatorial Optimization - Part I IM2 Invitation to distributed graph algorithms IM3 Approximation Algorithms IM4 Discrete Geometry IM5 Extremal Combinatorics IM6 In honour of Pavol Hell - Part I IM7 Invitation to Sparsity IM8 Combinatorial Optimization - Part II IM9 Discrete and algorithmic mathematics in biology and epidemiology - Part I IM10 In honour of Pavol Hell - Part II IM11 Discrete and algorithmic mathematics in biology and epidemiology - Part II IM12 Generating series and confined lattice walks - Part I IM13 Combinatorics on Posets - Part I IM14 Invitation to Reconfiguration - Part I IM15 Probabilistic Approaches IM16 Combinatorics on Posets - Part II IM17 Generating series and confined lattice walks - Part II IM18 Invitation to Reconfiguration - Part II IM19 Structural Graph Theory Back to Table of Contents 3 Plenary Talks Schedule Tuesday May 25 10:00 - 11:00 László Végh (London School of Economics), The circuit imbalance measure and its role in linear program- ming (p. 40) 14:10 - 15:10 Natasha Morrison (University of Victoria), Uncommon systems of equations (p. 40) Wednesday May 26 10:00 - 11:00 Yufei Zhao (Massachusetts Institute of Technology), Extremal problems in discrete geometry (p. 40) 14:10 - 15:10 Caroline Colijn (Simon Fraser University), Mathematics and policy in the COVID-19 pandemic (p. 41) Thursday May 27 10:00 - 11:00 Mireille Bousquet-Mélou (CNRS, Université de Bordeaux), Counting lattice walks confined to cones (p. 41) 14:10 - 15:10 William T. Trotter (Georgia Tech University), Posets with Planar Cover Graphs (p. 41) Friday May 28 14:10 - 15:10 Sergey Norin (McGill University), Recent progress towards Hadwiger’s conjecture (p. 42) Back to Table of Contents 4 Invited Minisymposia Topic Date Time IM1 Combinatorial Optimization - Part I Tuesday May 25 11:20 - 13:45 IM2 Invitation to distributed graph algorithms Tuesday May 25 11:20 - 13:45 IM3 Approximation Algorithms Tuesday May 25 15:30 - 17:55 IM4 Discrete Geometry Wednesday May 26 11:20 - 13:45 IM5 Extremal Combinatorics Wednesday May 26 11:20 - 13:45 IM6 In honour of Pavol Hell - Part I Wednesday May 26 11:20 - 13:45 IM7 Invitation to Sparsity Wednesday May 26 11:20 - 13:45 IM8 Combinatorial Optimization - Part II Wednesday May 26 15:30 - 17:55 IM9 Discrete and algorithmic mathematics in biology and epidemiology - Part I Wednesday May 26 15:30 - 17:25 IM10 In honour of Pavol Hell - Part II Wednesday May 26 15:30 - 17:55 IM11 Discrete and algorithmic mathematics in biology and epidemiology - Part II Thursday May 27 11:20 - 13:15 IM12 Generating series and confined lattice walks - Part I Thursday May 27 11:20 - 13:15 IM13 Combinatorics on Posets - Part I Thursday May 27 15:30 - 17:55 IM14 Invitation to Reconfiguration - Part I Thursday May 27 15:30 - 17:55 IM15 Probabilistic Approaches Thursday May 27 15:30 - 17:55 IM16 Combinatorics on Posets - Part II Friday May 28 11:20 - 13:15 IM17 Generating series and confined lattice walks - Part II Friday May 28 11:20 - 13:15 IM18 Invitation to Reconfiguration - Part II Friday May 28 15:30 - 17:55 IM19 Structural Graph Theory Friday May 28 15:30 - 17:55 Back to Table of
Load more

Recommended publications
  • On the Circuit Diameter Conjecture
    On the Circuit Diameter Conjecture Steffen Borgwardt1, Tamon Stephen2, and Timothy Yusun2 1 University of Colorado Denver [email protected] 2 Simon Fraser University {tamon,tyusun}@sfu.ca Abstract. From the point of view of optimization, a critical issue is relating the combina- torial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper bound of f − d was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron U4 with 8 facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos [San12]. We consider analogous properties for a variant of the combinatorial diameter called the circuit diameter. In this variant, the walks are built from the circuit directions of the poly- hedron, which are the minimal non-trivial solutions to the system defining the polyhedron. We are able to prove that circuit variants of the so-called non-revisiting conjecture and d-step conjecture both imply the circuit analogue of the Hirsch conjecture. For the equiva- lences in [KW67], the wedge construction was a fundamental proof technique. We exhibit why it is not available in the circuit setting, and what are the implications of losing it as a tool. Further, we show the circuit analogue of the non-revisiting conjecture implies a linear bound on the circuit diameter of all unbounded polyhedra – in contrast to what is known for the combinatorial diameter. Finally, we give two proofs of a circuit version of the 4-step conjecture.
    [Show full text]
  • Diameter of Simplicial Complexes, a Computational Approach
    University of Cantabria Master’s thesis. Masters degree in Mathematics and Computing Diameter of simplicial complexes, a computational approach Author: Advisor: Francisco Criado Gallart Francisco Santos Leal 2015-2016 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Desvarío laborioso y empobrecedor el de componer vastos libros; el de explayar en quinientas páginas una idea cuya perfecta exposición oral cabe en pocos minutos. Mejor procedimiento es simular que esos libros ya existen y ofrecer un resumen, un comentario. Borges, Ficciones Acknowledgements First, I would like to thank my advisor, professor Francisco Santos. He has been supportive years before I arrived in Santander, and even more when I arrived. Also, I want to thank professor Michael Joswig and his team in the discrete ge- ometry group of the Technical University of Berlin, for all the help and advice that they provided during my (short) visit to their department. Finally, I want to thank my friends at Cantabria, and my “disciples”: Álvaro, Ana, Beatriz, Cristina, David, Esther, Jesús, Jon, Manu, Néstor, Sara and Susana. i Diameter of simplicial complexes, a computational approach Abstract The computational complexity of the simplex method, widely used for linear program- ming, depends on the combinatorial diameter of the edge graph of a polyhedron with n facets and dimension d. Despite its popularity, little is known about the (combinatorial) diameter of polytopes, and even for simpler types of complexes. For the case of polytopes, it was conjectured by Hirsch (1957) that the diameter is smaller than (n − d), but this was disproved by Francisco Santos (2010).
    [Show full text]
  • The Geodesic $2 $-Center Problem in a Simple Polygon
    The geodesic 2-center problem in a simple polygon∗ Eunjin Ohy Jean-Lou De Carufelz Hee-Kap Ahny§ Abstract The geodesic k-center problem in a simple polygon with n vertices consists in the follow- ing. Find a set S of k points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in S. In this paper, we focus on the case where k = 2 and present an exact algorithm that returns a geodesic 2-center in O(n2 log2 n) time. 1 Introduction The geodesic k-center problem in a simple polygon P with n vertices consists in the following. Find a set S of k points in P that minimizes max min d(s; p); p2P s2S where d(x; y) is the length of the shortest path between x and y lying in P (also called geodesic distance). The set S is called a k-center of P . Geometrically, this is equivalent to find k smallest-radius geodesic disks with the same radius whose union contains P . The 2-dimensional Euclidean k-center problem is similar to the geodesic k-center problem in a simple polygon P . The only difference is that in the Euclidean k-center problem, the distance between two points x and y is their Euclidean distance, denoted by x y . That is, given a k − k set of n points in the plane, find a set S of k points in R2 that minimizes P max min p s : p2P s2S k − k Computing a k-center of points is a typical problem in clustering.
    [Show full text]
  • Report on 8Th EUROPT Workshop on Advances in Continuous
    8th EUROPT Workshop on Advances in Continuous Optimization Aveiro, Portugal, July 9-10, 2010 Final Report The 8th EUROPT Workshop on Advances in Continuous Optimization was hosted by the Univer- sity of Aveiro, Portugal. Workshop started with a Welcome Reception of the participants on July 8, fol- lowed by two working days, July 9 and July 10. This Workshop continued the line of the past EUROPT workshops. The first one was held in 2000 in Budapest, followed by the workshops in Rotterdam in 2001, Istanbul in 2003, Rhodes in 2004, Reykjavik in 2006, Prague in 2007, and Remagen in 2009. All these international workshops were organized by the EURO Working Group on Continuous Optimization (EUROPT; http://www.iam.metu.edu.tr/EUROPT) as a satellite meeting of the EURO Conferences. This time, the 8th EUROPT Workshop, was a satellite meeting before the EURO XXIV Conference in Lisbon, (http://www.euro2010lisbon.org/). During the 8th EUROPT Workshop, the organizational duties were distributed between a Scientific Committee, an Organizing Committee, and a Local Committee. • The Scientific Committee was composed by Marco Lopez (Chair), Universidad de Alicante; Domin- gos Cardoso, Universidade de Aveiro; Emilio Carrizosa, Universidad de Sevilla; Joaquim Judice, Uni- versidade de Coimbra; Diethard Klatte, Universitat Zurich; Olga Kostyukova, Belarusian Academy of Sciences; Marco Locatelli, Universita’ di Torino; Florian Potra, University of Maryland Baltimore County; Franz Rendl, Universitat Klagenfurt; Claudia Sagastizabal, CEPEL (Research Center for Electric Energy); Oliver Stein, Karlsruhe Institute of Technology; Georg Still, University of Twente. • The Organizing Committee was composed by Domingos Cardoso (Chair), Universidade de Aveiro; Tatiana Tchemisova (co-Chair), Universidade de Aveiro; Miguel Anjos, University of Waterloo; Edite Fernandes, Universidade do Minho; Vicente Novo, UNED (Spain); Juan Parra, Universidad Miguel Hernandez´ de Elche; Gerhard-Wilhelm Weber, Middle East Technical University.
    [Show full text]
  • Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers, Eric Colin De Verdire, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
    Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers, Eric Colin de Verdire, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite To cite this version: Erin Wolf Chambers, Eric Colin de Verdire, Jeff Erickson, Sylvain Lazard, Francis Lazarus, et al.. Walking Your Dog in the Woods in Polynomial Time. SoCG 2008 - 24th Annual Sympo- sium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.101–109, 10.1145/1377676.1377694. inria-00336497 HAL Id: inria-00336497 https://hal.inria.fr/inria-00336497 Submitted on 4 Nov 2008 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. WALKING YOUR DOG IN THE WOODS IN POLYNOMIAL TIME ERIN WOLF CHAMBERS, ERIC´ COLIN DE VERDIERE,` JEFF ERICKSON, SYLVAIN LAZARD, FRANCIS LAZARUS, AND SHRIPAD THITE Abstract. The Fr´echet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Fr´echet distance to more general metric spaces, which requires the leash itself to move continuously over time.
    [Show full text]
  • Arxiv:Math/0403494V1
    ONE-POINT SUSPENSIONS AND WREATH PRODUCTS OF POLYTOPES AND SPHERES MICHAEL JOSWIG AND FRANK H. LUTZ Abstract. It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and topological properties. In particular, infinitely many non-PL spheres as well as contractible simplicial complexes with a vertex-transitive group of automorphisms can be obtained in this way. 1. Introduction McMullen [34] constructed projectively unique convex polytopes as the joint convex hulls of polytopes in mutually skew affine subspaces which are attached to the vertices of yet another polytope. It is immediate that if the polytopes attached are pairwise isomorphic one can obtain polytopes with a large group of automorphisms. In fact, if the polytopes attached are simplices, then the resulting polytope can be obtained by successive wedging (or rather its dual operation). This dual wedge, first introduced and exploited by Adler and Dantzig [1] in 1974 for the study of the Hirsch conjecture of linear programming, is essentially the same as the one-point suspension in combinatorial topology. It is striking that this simple construction makes several appearances in the literature, while it seems that never before it had been the focus of research for its own sake. The purpose of this paper is to collect what is known (for the polytopal as well as the combinatorial constructions) and to fill in several gaps, most notably by introducing wreath products of simplicial complexes. In particular, we give a detailed analysis of wreath products in order to provide explicit descriptions of highly symmetric polytopes which previously had been implicit in McMullen’s construction.
    [Show full text]
  • Program of the Sessions San Diego, California, January 9–12, 2013
    Program of the Sessions San Diego, California, January 9–12, 2013 AMS Short Course on Random Matrices, Part Monday, January 7 I MAA Short Course on Conceptual Climate Models, Part I 9:00 AM –3:45PM Room 4, Upper Level, San Diego Convention Center 8:30 AM –5:30PM Room 5B, Upper Level, San Diego Convention Center Organizer: Van Vu,YaleUniversity Organizers: Esther Widiasih,University of Arizona 8:00AM Registration outside Room 5A, SDCC Mary Lou Zeeman,Bowdoin upper level. College 9:00AM Random Matrices: The Universality James Walsh, Oberlin (5) phenomenon for Wigner ensemble. College Preliminary report. 7:30AM Registration outside Room 5A, SDCC Terence Tao, University of California Los upper level. Angles 8:30AM Zero-dimensional energy balance models. 10:45AM Universality of random matrices and (1) Hans Kaper, Georgetown University (6) Dyson Brownian Motion. Preliminary 10:30AM Hands-on Session: Dynamics of energy report. (2) balance models, I. Laszlo Erdos, LMU, Munich Anna Barry*, Institute for Math and Its Applications, and Samantha 2:30PM Free probability and Random matrices. Oestreicher*, University of Minnesota (7) Preliminary report. Alice Guionnet, Massachusetts Institute 2:00PM One-dimensional energy balance models. of Technology (3) Hans Kaper, Georgetown University 4:00PM Hands-on Session: Dynamics of energy NSF-EHR Grant Proposal Writing Workshop (4) balance models, II. Anna Barry*, Institute for Math and Its Applications, and Samantha 3:00 PM –6:00PM Marina Ballroom Oestreicher*, University of Minnesota F, 3rd Floor, Marriott The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 34, Issue 1 of Abstracts is ten minutes.
    [Show full text]
  • Excluding a Ladder
    EXCLUDING A LADDER TONY HUYNH, GWENAEL¨ JORET, PIOTR MICEK, MICHALT. SEWERYN, AND PAUL WOLLAN Abstract. A ladder is a 2 × k grid graph. When does a graph class C exclude some ladder as a minor? We show that this is the case if and only if all graphs G in C admit a proper vertex coloring with a bounded number of colors such that for every 2-connected subgraph H of G, there is a color that appears exactly once in H. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph H of G, there must be a color that appears exactly once in H. The minimum number of colors in a centered coloring of G is the treedepth of G, and it is known that classes of graphs with bounded treedepth are exactly those that exclude a fixed path as a subgraph, or equivalently, as a minor. In this sense, the structure of graphs excluding a fixed ladder as a minor resembles the structure of graphs without long paths. Another similarity is as follows: It is an easy observation that every connected graph with two vertex-disjoint paths of length k has a path of length k + 1. We show that every 3-connected graph which contains as a minor a union of sufficiently many vertex-disjoint copies of a 2 × k grid has a 2 × (k + 1) grid minor. Our structural results have applications to poset dimension. We show that posets whose cover graphs exclude a fixed ladder as a minor have bounded dimension.
    [Show full text]
  • Cole's Parametric Search
    CCCG 2013, Waterloo, Ontario, August 8{10, 2013 Cole's Parametric Search Technique Made Practical Michael T. Goodrich Pawe lPszona Dept. of Computer Science Dept. of Computer Science University of California, Irvine University of California, Irvine Abstract the maximum for which B is true. To achieve this goal, the parametric search approach utilizes two algorithms. Parametric search has been widely used in geometric al- The first algorithm, C, is a sequential decision algorithm gorithms. Cole's improvement provides a way of saving for B that can determine if a given λ is less than, equal a logarithmic factor in the running time over what is to, or greater than λ∗. The second algorithm, A, is achievable using the standard method. Unfortunately, a generic parallel algorithm whose inner workings are this improvement comes at the expense of making an al- driven by \comparisons," which are either independent ready complicated algorithm even more complex; hence, of λ or depend on the signs of low-degree polynomi- this technique has been mostly of theoretical interest. In als in λ. Because A works in parallel, its comparisons this paper, we provide an algorithm engineering frame- come in batches, so there are several independent such work that allows for the same asymptotic complexity comparisons that occur at the same time. The idea, to be achieved probabilistically in a way that is both then, is to run A on the input that depends on the un- simple and practical (i.e., suitable for actual implemen- known value λ∗, which will result in actually finding tation). The main idea of our approach is to show that that value as a kind of by-product (even though we do a variant of quicksort, known as boxsort, can be used to not know λ∗, C can be used to resolve comparisons that drive comparisons, instead of using a sorting network, appear during the execution of A).
    [Show full text]
  • Minor-Minimal Non-Projective Planar Graphs with an Internal 3-Separation
    MINOR-MINIMAL NON-PROJECTIVE PLANAR GRAPHS WITH AN INTERNAL 3-SEPARATION A Thesis Presented to The Academic Faculty by Arash Asadi Shahmirzadi In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Algorithms, Combinatorics, and Optimization School of Mathematics Georgia Institute of Technology December, 2012 MINOR-MINIMAL NON-PROJECTIVE PLANAR GRAPHS WITH AN INTERNAL 3-SEPARATION Approved by: Dr. Robin Thomas, Advisor Dr. William T. Trotter School of Mathematics School of Mathematics Georgia Institute of Technology Georgia Institute of Technology Dr. William Cook Dr. Xingxing Yu School of Industrial and Systems School of Mathematics Engineering Georgia Institute of Technology Georgia Institute of Technology Dr. Prasad Tetali Date Approved: December, 2012 School of Mathematics Georgia Institute of Technology To my parents, for educating me in what truly matters. iii TABLE OF CONTENTS DEDICATION .................................. iii LIST OF FIGURES .............................. v SUMMARY .................................... vi I INTRODUCTION ............................. 1 1.1 GraphTheoreticPreliminaries . 1 1.2 GraphsonSurfaces ........................... 4 1.3 Embedding and Excluding Subgraphs and Minors . 5 1.4 Non-Planar Extensions of Planar Graphs . 9 1.5 Application of the list of minor minimal non-projective planar graphs 10 1.6 Previous approaches for finding the list of minor minimal non-projective planargraphs .............................. 13 1.7 Minor Minimal Non-Projective Planar Graphs . .. 15 1.8 MainResults .............................. 16 1.9 OutlineoftheProof .......................... 19 II NON-c-PLANAR EXTENSIONS OF A c-DISK SYSTEM .... 23 2.1 Definitions and Preliminaries . 23 2.2 Usefullemmas.............................. 31 III SOME APPLICATIONS OF THE THEORY TO ROOTED GRAPHS ......................................... 48 IV OBSTRUCTIONS FOR c-, ac-, abc-PLANARITY ......... 66 4.1 Obstructions for c-planarity .....................
    [Show full text]
  • 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]
  • Planar Emulators Conjecture Is Nearly True for Cubic Graphs
    Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa, Petr Hlinˇen´yb,1 aDavid R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada bFaculty of Informatics, Masaryk University, Botanick´a68a, 602 00 Brno, Czech Republic Abstract We prove that a cubic nonprojective graph cannot have a finite planar emu- lator, unless it belongs to one of two very special cases (in which the answer is open). This shows that Fellows' planar emulator conjecture, disproved for general graphs by Rieck and Yamashita in 2008, is nearly true on cubic graphs, and might very well be true there definitely. Keywords: planar emulator; projective planar graph; graph minor 1. Introduction A graph G has a finite planar emulator H if H is a planar graph and there is a graph homomorphism ' : V (H) ! V (G) where ' is locally surjective, i.e. for every vertex v 2 V (H), the neighbours of v in H are mapped surjectively onto the neighbours of '(v) in G. We also say that such a G is planar-emulable. If we insist on ' being locally bijective, we get H a planar cover. The concept of planar emulators was proposed in 1985 by M. Fellows [6], and it tightly relates (although of independent origin) to the better known planar cover conjecture of Negami [11]. Fellows also raised the main question: What is the class of graphs with finite planar emulators? Soon later he conjectured that the class of planar-emulable graphs coincides with the class of graphs with finite planar covers (conjectured to be the class of projective graphs by Negami [11]| still open nowadays).
    [Show full text]