Unsolved Problems in Intuitive Geometry
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students. -
Victor L. Klee 1925–2007 Peter Gritzmann and Bernd Sturmfels
Victor L. Klee 1925–2007 Peter Gritzmann and Bernd Sturmfels ictor L. Klee passed away on August student, respectively) edited the volume Applied 17, 2007, in Lakewood, Ohio. Born in Geometry and Discrete Mathematics, which was San Francisco in 1925, he received his published by the American Mathematical Society. Ph.D. in mathematics from the Univer- For this obituary, we invited a group of former sity of Virginia in 1949. In 1953 he colleagues and mentees to contribute short pieces Vmoved to the University of Washington in Seattle, on Klee’s mathematical life. This resulted in ten where he was a faculty member for 54 years. individual spotlights, followed by some person- Klee specialized in convex sets, functional anal- al remarks by the editors. The emphasis lies on ysis, analysis of algorithms, optimization, and Klee’s work in the more recent decades of his combinatorics, writing more than 240 research rich scientific life, and hence they focus on finite- papers. He received many honors, including a dimensional convexity, discrete mathematics, and Guggenheim Fellowship; the Ford Award (1972), optimization. His bibliography, however, makes it the Allendoerfer Award (1980 and 1999), and clear that by the late 1960s he already had more the Award for Distinguished Service (1977) from than a career’s worth of papers in continuous and the Mathematical Association of America; and the infinite dimensional convexity. Humboldt Research Award (1980); as well as hon- orary doctorates from Pomona College (1965) and the Universities of Liège (1984) and Trier (1995). Louis J. Billera For collaborations with the first listed editor he received the Max Planck Research Award (1992). -
Breakthrough in My Favorite Open Problem of Mathematics: Chromatic Number of the Plane Alexander Soifer
Breakthrough in My Favorite Open Problem of Mathematics: Chromatic Number of the Plane Alexander Soifer [I] can’t offer money for nice problems of other people because then I will really go broke… It is a very nice problem. If it were mine, I would offer $250 for it. – Paul Erdős Boca Raton, February 1992 1. Chromatic Number of the Plane: The Problem On behalf of all enthusiasts of this problem, let me express gratitude to my friend, the late Edward Nelson, who created this problem at a tender age of 18 in November 1950: What is the smallest number of colors sufficient for coloring the plane in such a way that no two points of the same color are unit distance apart? This number is called the chromatic number of the plane and is denoted by . In 1961, the Swiss geometer Hugo Hadwiger admitted that he was not the author of the problem, even though the name “Harwiger-Nelson” got stuck to the problem, just as Cardano did not author the Cardano Formula, and Pythagoras Theorem was known a millennium before the great Greek was born. Such is life with credits in mathematics. Right at problem’s birth, Eddie Nelson determined the lower bound of 4, and his 20-year old friend John Isbell, 20 figured out the upper bound of 7: = 4, or 5, or 6, or 7 A very broad spread. Which one is the value of ? Paul Erd"os thought 5. On May 28, 2009, during the DIMACS Ramsey Theory International Workshop that I organized on request of DIMACS Director Fred Roberts, I asked the distinguished audience to determine the chromatic number of the plane by democratic means of a vote. -
Some Remarks on Even-Hole-Free Graphs
Some remarks on even-hole-free graphs Zi-Xia Song∗ Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA Abstract A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph has a bisimplicial vertex. Both Hadwiger’s conjecture and the Erd˝os-Lov´asz Tihany conjecture have been shown to be true for quasi-line graphs, but are open for even-hole-free graphs. In this note, we prove that for all k ≥ 7, every even-hole-free graph with no Kk minor is (2k − 5)-colorable; every even-hole-free graph G with ω(G) < χ(G) = s + t − 1 satisfies the Erd˝os-Lov´asz Tihany conjecture provided that t ≥ s>χ(G)/3. Furthermore, we prove that every 9-chromatic graph G with ω(G) ≤ 8 has a K4 ∪ K6 minor. Our proofs rely heavily on the structural result of Chudnovsky and Seymour on even-hole-free graphs. 1 Introduction All graphs in this paper are finite and simple. For a graph G, we use V (G) to denote the vertex set, E(G) the edge set, |G| the number of vertices, e(G) the number of edges, δ(G) the minimum degree, ∆(G) the maximum degree, α(G) the independence number, ω(G) the clique number and χ(G) the chromatic number. A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. -
Majors in Mathematics and Chem Istry
Vita of Victor Klee Personal: Born in San Francisco, 1925 Education: B.A. (with high honors), Pomona College, 1945 (majors in Mathematics and Chem istry) Ph.D. (Mathematics), University of Virginia, 1949 Honorary Degrees: D.Sc., Universitat Trier, 1995 D.Sc., Universite de Liege, 1984 D.Sc., Pomona College, 1965 Awards: American Academy of Arts and Sciences " . Fellow, 1997 American Association for the Advancement of Science Fellow, 1976 Mathematical Association of America: Annual Award for Distinguished Service to Mathematics, 1977 C.B. Allendoerfer Award, 1980, 1999 L.R. Ford Award, 1972 Max-Planck-Gesellschaft: Max-Planck-Forschungspreis, 1992 Alexander von Humboldt Stiftung: Preistrager, 1980-81 Pomona College: David Prescott Barrows Award for Distinguished Achievement, 1988 Reed College: Vollum Award for Distinguished Accomplishment in Science and Technology, 1982 University of Virginia: President's and Visitor's Research Prize, 1952 1 "'lNf\""". 4 sZUA=eJUPLJ 2 Full-Time Employment: University of Washington: Professor of Mathematics, 1957-98, then Professor Emeritus; \ Associate Professor, 1954-57; Assistant Professor, 1953-54; Adjunct Professor of Computer Science, 1974-presentj Professor or Adjunct Professor of Applied Mathematics, 1976-84; University of Western Australia: Visiting Professor, 1979. University of Victoria: Visiting Professor, 1975. T.J. Watson Research Center, IBM: Full-Time Consultant, 1972. University of Colorado: Visiting Professor, 1971. University of California, Los Angeles: Visiting Associate Professor, 1955-56. University of Virginia: Assistant Professor, 1949-53; Instructor, 1947-48. Fellowships: Fulbright Research Scholar, University of Trier, 1992 Senior Fellow, Institute for Mathematics and its Applications, Minneapolis, 1987. Mathematical Sciences Research Institute, Berkeley, 1985-86. Guggenheim Fellow, University of Erlangen-Nurnberg, 1980-8l. -
Who Solved the Hirsch Conjecture?
Documenta Math. 75 Who Solved the Hirsch Conjecture? Gunter¨ M. Ziegler 2010 Mathematics Subject Classification: 90C05 Keywords and Phrases: Linear programming 1 Warren M. Hirsch, who posed the Hirsch conjecture In the section “The simplex interpretation of the simplex method” of his 1963 classic “Linear Programming and Extensions”, George Dantzig [5, p. 160] de- scribes “informal empirical observations” that While the simplex method appears a natural one to try in the n- dimensional space of the variables, it might be expected, a priori, to be inefficient as tehre could be considerable wandering on the out- side edges of the convex [set] of solutions before an optimal extreme point is reached. This certainly appears to be true when n − m = k is small, (...) However, empirical experience with thousands of practical problems indicates that the number of iterations is usually close to the num- ber of basic variables in the final set which were not present in the initial set. For an m-equation problem with m different variables in the final basic set, the number of iterations may run anywhere from m as a minimum, to 2m and rarely to 3m. The number is usually less than 3m/2 when there are less than 50 equations and 200 vari- ables (to judge from informal empirical observations). Some believe that on a randomly chosen problem with fixed m, the number of iterations grows in proportion to n. Thus Dantzig gives a lot of empirical evidence, and speculates about random linear programs, before quoting a conjecture about a worst case: Documenta Mathematica · Extra Volume ISMP (2012) 75–85 76 Gunter¨ M. -
SZAKDOLGOZAT Probabilistic Formulation of the Hadwiger
SZAKDOLGOZAT Probabilistic formulation of the Hadwiger–Nelson problem Péter Ágoston MSc in Mathematics Supervisor: Dömötör Pálvölgyi assistant professor ELTE TTK Institute of Mathematics Department of Computer Science ELTE 2019 Contents Introduction 3 1 Unit distance graphs 5 1.1 Introduction . .5 1.2 Upper bound on the number of edges . .6 2 (1; d)-graphs 22 3 The chromatic number of the plane 27 3.1 Introduction . 27 3.2 Upper bound . 27 3.3 Lower bound . 28 4 The probabilistic formulation of the Hadwiger–Nelson problem 29 4.1 Introduction . 29 4.2 Upper bounds . 30 4.3 Lower bounds . 32 5 Related problems 39 5.1 Spheres . 39 5.2 Other dimensions . 41 Bibliography 43 2 Introduction In 1950, Edward Nelson posed the question of determining the chromatic number of the graph on the plane formed by its points as vertices and having edges between the pairs of points with distance 1, which is now simply known as the chromatic number of the plane. It soon became obvious that at least 4 colours are needed, which can be easily seen thanks to a graph with 7 vertices, the so called Moser spindle, found by William and Leo Moser. There is also a relatively simple colouring by John R. Isbell, which shows that the chromatic number is at most 7. And despite the simplicity of the bounds, these remained the strongest ones until 2018, when biologist Aubrey de Grey found a subgraph which was not colourable with 4 colours. This meant that the chromatic number of the plane is at least 5. -
Chromatic Number of Euclidean Plane
Chromatic number of Euclidean plane Kai-Rui Wang ∗ Abstract: If the chromaticnumber of Euclidean planeis largerthan four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the chromatic number of the plane about its exact value. Mathematics Subject Classification (2010): 05C10, 05C55, 05D10. Keywords: Euclidean plane; Finite unit distance graphs; The chromatic number of the plane. 1 Introduction One of the most interesting unsolved problems in geometric graph theory or Euclidean Ramsey theory is as below: How many colors are needed to color the plane so that no two points at unit dis- tance are the same color? which is also called the Hadwiger-Nelson problem, named after Hugo Hadwiger and Edward Nelson.[1,2,3] As for the age of the emergence of it, according to Jensen and Toft’s investigation (1995),[4] the problem was first formulated by E. Nelson in 1950, and first published by Gardner in 1960.[3] Hadwiger in 1945 published a related result,[1] showing that any cover of the plane by five congruent closed sets contains a unit distance in one of the sets, and he also mentioned the problem in a later paper (Hadwiger 1961).[2] A. Soifer (2003,2008,2011) discusses the problem and its origin extensively.[5−8] Although the answer of this problem is unknown,it has been narrowed down to one of the numbers 4, 5, 6 or 7. The lower bound of four follows from a seven-vertex unit arXiv:1507.00025v1 [math.GM] 1 Jul 2015 distance graph with chromatic number four discovered by brothers William and Leo Moser in 1961,[9] named the Moser spindle. -
Colorful Results on Euclidean Distance Graphs and Their Chromatic Numbers
Colorful Results on Euclidean Distance Graphs and Their Chromatic Numbers by Matt Noble A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Doctor of Philosophy Auburn, Alabama May 7, 2012 Keywords: Euclidean distance graphs, chromatic number, coloring the rationals Copyright 2012 by Matt Noble Approved by Peter D. Johnson, Chair, Professor of Mathematics and Statistics Chris Rodger, C. Harry Knowles Professor of Mathematical Sciences Dean Hoffman, Professor of Mathematics and Statistics Abstract In this work, we study Euclidean distance graphs with vertex set Qn, the n-dimensional rational space. In particular, we deal with the chromatic numbers (and some related param- eters) of such graphs when n = 2 or n = 3. A short history of the topic is given before we approach a few open problems related to the subject. Some of these questions are resolved, either completely or partially. For the problems able to resist our advances, methods are given that hopefully will lead to answers in future work. ii Acknowledgments Professionally, I would like to thank the Auburn University Department of Mathematics { in particular, Peter D. Johnson for being a great advisor and a stand-up guy in general. Personally, I would like to thank Linda, Mark, Seth, and Abby. They know why. iii Table of Contents Abstract . ii Acknowledgments . iii List of Figures . vi List of Tables . vii 1 Introduction . 1 1.1 Definitions . 1 1.2 History . 2 1.3 Outline . 4 2 Single-distance Graphs in Q3 ............................ 6 2.1 Introduction and Preliminaries . 6 2.2 Results . -
Introduction to Ramsey Theory
Introduction to Ramsey Theory Lecture notes for undergraduate course Introduction to Ramsey Theory Lecture notes for undergraduate course Veselin Jungic Simon Fraser University Production Editor: Veselin Jungic Edition: Second Edition ©2014-–2021 Veselin Jungic This work is licensed under the Creative Commons Attribution-NonCommercialShareAlike 4.0 International License. Youcan view a copy of the license at http://creativecommons.org/ licenses/by-nc-sa/4.0/. To my sons, my best teachers. - Veselin Jungic Acknowledgements Drawings of Alfred Hale, Robert Jewett, Richard Rado, Frank Ramsey, Issai Schur, and Bartel van der Waerden were created by Ms. Kyra Pukanich under my directions. The drawing of Frank Ramsey displayed at the end of Section 1.3 was created by Mr. Simon Roy under my directions. I am grateful to Professor Tom Brown, Mr. Rashid Barket, Ms. Jana Caine, Mr. Kevin Halasz, Ms. Arpit Kaur, Ms. Ha Thu Nguyen, Mr. Andrew Poelstra, Mr. Michael Stephen Paulgaard, and Ms. Ompreet Kaur Sarang for their comments and suggestions which have been very helpful in improving the manuscript. I would like to acknowledge the following colleagues for their help in creating the PreTeXt version of the text. • Jana Caine, Simon Fraser University • David Farmer, American Institute of Mathematics • Sean Fitzpatrick , University of Lethbridge • Damir Jungic, Burnaby, BC I am particularly thankful to Dr. Sean Fitzpatrick for inspiring and encouraging me to use PreTeXt. Veselin Jungic vii Preface The purpose of these lecture notes is to serve as a gentle introduction to Ramsey theory for those undergraduate students interested in becoming familiar with this dynamic segment of contemporary mathematics that combines, among others, ideas from number theory and combinatorics. -
2007 Newsletter
AUTUMN 2007 NEWSLETTER OF THE DEPARTMENT OF MATHEMATICS AT THE UNIVERSITY OF WASHINGTON Mathematics NEWS 1 DEPARTMENT OF MATHEMATICS NEWS MESSAGE FROM THE CHAIR As you will read in the article a number of professorships and fellowships. This by Tom Duchamp, a concerted support beyond state funding and federal grants effort by the Department has adds greatly to our effectiveness in research, edu- transformed our graduate cation and outreach. program during the past de- I would also like to acknowledge a group of col- cade. A record number of 14 leagues who contribute to every aspect of our students completed the Ph.D. work: the Department’s ten members of staff. last academic year, and ten They deserve a large share of the credit for the students finished in the previ- Department’s successes. ous academic year. In fact, all indications are that we have entered a period in which we will Our educational activities go hand in hand with continue to average over ten doctorates a year, our research, each part of our mission benefiting compared to a historical average of about 6.5. from and strengthening the other. And everything One of our goals during the past decade has been we do rests on the efforts of the Department’s the broadening of the experience and prepara- faculty. During the past decade we have built tion of our students. While the majority of our research groups in algebraic geometry, combina- doctoral graduates go on to postdoctoral positions torics and number theory. In addition we have at research institutions, several choose to work recognized the important role computation now in industry or to teach at two-year or four-year plays in mathematics; with the appointments we colleges. -
An Interview with Bernd Sturmfels by Joe Gallian and Ivars Peterson
MAA FOCUS January 2008 “Mathematicians Have a Different Perspective” An Interview with Bernd Sturmfels By Joe Gallian and Ivars Peterson After receiving his PhD from the for very focused studies; students tend University of Washington in 1987, Ger- to reach a higher level rather quickly. man-born Bernd Sturmfels held positions In the traditional German system, the at Cornell University and New York first degree was called the “Diplom,” University before landing at the Univer- and one obtained this degree after about sity of California at Berkeley, where he five years. It used to be a rather rigorous currently teaches. Sturmfels has received program, comparable to a strong Masters numerous honors, including the MAA’s Lester R. Ford Award for expository writ- program with a written thesis. ing in 1999 and designation as a George Pólya Lecturer. Sturmfels served as the In the last 20 years, there have been Hewlett-Packard Research Professor at many changes in the university systems MSRI Berkeley in 2003/04, and was a in Europe, not just in Germany, and now Clay Institute Senior Scholar in Summer most schools offer Bachelor and Masters 2004. A leading experimentalist among Degrees more similar to the system in the mathematicians, Sturmfels has authored States. Not everyone is happy about these eight books and about 140 articles, in changes, needless to say. the areas of combinatorics, algebraic geometry, symbolic computation and FOCUS: How do you describe your their applications. He currently works research area? on algebraic methods in statistics and of Washington and the University of To- computational biology.