Every planar graph is 4-colourable a proof without computer
|
|
- Britton Bryant
- 5 years ago
- Views:
Transcription
1 Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject Classfcaton: 05C15 Abstract Colourng of planar graphs can be treated as a specal lst-colourng problem wth selected lsts for near-trangulatons. The new dea s to use sublsts of a common lst of four colours, to enforce a common colour n all lsts, and to admt on the boundng cycle at most one vertex wth a lst of at least two colours. By these condtons colours and lsts are excluded, whch have to be consdered n lstcolourng (leadng to the well-known result that planar graphs are 5-choosable). The essental applcaton s a proof of the 4-colour theorem. Keywords: planar graph; near-trangulaton; vertex colourng, chromatc number; 4-colourable, 5-choosable, lst-colourng wth selected lsts. 1 Introducton In response to Kempe s ncorrect proof of the 4-colour conjecture n 1879 [3], Heawood [2] publshed a proof of the 5-colour theorem for planar graphs, together wth a counter-example whch exposed an essental error n Kempe s approach. The 4-colour theorem was frst proved by Appel and Haken (see e.g. [1]) n 1976 wth the help of extensve computer calculatons. Robertson et al. [4] gave an mproved and ndependent verson of ths type of proof n The frst proof of the correspondng lst-colourng theorem for planar graphs every planar graph s 5-choosable was provded by Thomassen [5] n Ths theorem s best possble: e.g. Vogt [6] found planar graphs whch are not 4-choosable. 4CT_2008Dec23.doc page 1
2 Extensve use of computer programs as a proof-tool remans a source of controversy: such a type of proof s stll not unanmously accepted among mathematcans. Hence the search for old-fashoned proofs whch can be checked by hand should stll be consdered as a worthwhle enterprse, at least for a posteror verfcaton of a computer-based proof. Hopes that lst-colourng deas could be helpful to fnd such a proof have not been fulflled to date. In what follows such a proof by hand s presented. It does not yeld a colourng algorthm. The new dea s to use sublsts of a common lst of four colours, to enforce a common colour n all lsts, and to admt on the boundng cycle at most one vertex wth a lst of at least two colours. The strategy behnd ths dea s to avod counterexamples at low graph orders. 2 Theorems for the colourng of planar graphs Theorem 1. The chromatc number of a planar graph s not greater than four. The theorem s expressed n the vertex-colourng context wth the usual assumptons,.e. a coloured map n the plane or on a sphere s represented by ts dual (smple) graph G wth coloured vertces. When two vertces vk, vl G are connected by an edge vv k l (.e. the countres on the map have a common lne-shaped border), a (proper) colourng requres dstnct colours cv ( k ) and cv ( l ). Wthout loss of generalty the proof can be restrcted to (planar) near-trangulatons. A planar graph G s called a near-trangulaton f t s connected, wthout loops, and every nteror regon s (bounded by) a trangle. A regon s a trangle f t s ncdent wth exactly 3 edges. The exteror regon s bounded by the outer cycle. A (full) trangulaton s the specal case of a near-trangulaton, when also the nfnte exteror regon s bounded by a trangle (3-cycle). It follows from Euler s polyhedral formula that a planar graph wth n 3 vertces has at most 3n 6 edges, and the trangulaton s the edgemaxmal graph. Every planar graph H can be generated from a trangulaton G by removng edges and dsconnected vertces, therefore H G holds. As removal of edges reduces the number of restrctons for colourng, the chromatc number of H s not greater than the correspondng number of G. Instead of Theorem 1, t s convenent to prove the followng Theorem 2. Let G be a planar near-trangulaton wth outer cycle C = v1v2 vk 1vk v1, k 3. Assume that there s a common colour lst Lv ( ) = L0 = {1,2,3,4} of four colours for all vertces v G C, and a common colour α n all lsts of G. Assume further that there s a lst Lv ( ) { α} of at least three colours from L 0 for every vertex v C, wth the excepton of at most one arbtrarly selectable vertex w C, not adjacent to v 1, wth a lst of at least two colours, contanng α and not contanng another colour β Lv ( 2). Then there are always two dstnct colours α and β, such that two adjacent vertces v 1, v 2 C can be coloured wth cv ( 1) = α and cv ( 2) = β from ther lsts, and the colourng of v 1 and v 2 can be extended to a colourng of C and ts nteror G C. 4CT_2008Dec23.doc page 2
3 3 Proof of Theorem 2 We perform nducton wth respect to the number n = G of vertces. For n = k = 3 we have G = C = v1v2 v3v1, and the proof s trval. Let n 3 and the theorem be true for n vertces. Then consder n the nducton step a near-trangulaton G wth n + 1 vertces and k 3 vertces on the outer cycle C. Case 1. If C has a chord vv 1 j wth 3 j k 1 (see Fg. 1), the unon of vv 1 j wth each of the two components of G { v1, v j } yelds two nduced subgraphs G 1 and G 2 wth G1 G2 = v1vj. If there exsts a lst of only two colours, we may assume wthout loss of generalty that t belongs to a vertex on the outer cycle of G 1. If all vertces on cycles are enumerated n clockwse order, the outer cycles of G 1 and G 2 (each wth at least 3 vertces) are C1 = v1v2 vj v1 G1 and C2 = v1vj vk v1 G2, respectvely. If there s a lst of only two colours, we can always fnd a thrd colour β Lv ( 2) not contaned n ths lst, as Lv ( 2) 3. Otherwse, we choose β Lv ( 2) arbtrarly. Then we assgn cv ( 1) = α, cv ( 2) = β, and apply the nducton hypothess to C 1 and ts nteror. Next we fx the colours n G 1, such that cv ( 1) = α and a colour β Lv ( j ) s assgned to v j. As there s no vertex wth a lst of two colours n G 2 (hence there s no condton that cv ( j ) = β s not contaned n ths lst), we extend the colourng of v 1 and v l to a colourng of C 2 and ts nteror to obtan a colourng of G. v k v k 1 C 2 G 2 v 1 α v 2 β G 1 v j C 1 v k 1 v k P u 2 u l u 1 G v k v 1 C' v 2 α β Fg. 1: The outer cycle has a chord vv 1 j. Fg. 2: The case wthout a chord. Case 2. Now C has no chord (see Fg. 2). Let Nv ( k) = { v1, u1, u2,, ul, vk, l 1, be the set of neghbours of v k, enumerated n clockwse order. As the nteror of C s trangulated, vertces v 1 and vk 1 are connected by a path P = v1u1u2 ulvk 1. Then C = P ( C v k ) s a cycle (as C has no chord), and s the outer cycle of G = G v. k 4CT_2008Dec23.doc page 3
4 If G s a trangulaton, then vk 1 = v2, and a lst of two colours cannot exst. We begn wth settng cv ( 1) = α and cv ( k 1) = β, wth an arbtrary choce of β Lv ( k 1). Note that there s at least one colour γ Lv ( k ) \ { αβ, }. Next we defne new lsts of three colours L ( u ) = L( u )\{ γ } ( = 1,, l ), and set L ( v) = L( v) for the remanng vertces v G u1 u l {,, }. Now a lst wth at least 3 colours s avalable for every vertex v C, and a lst L ( v) = L0 s assgned to all vertces v n the nteror of C. We can therefore apply the nducton hypothess to C and ts nteror wth the new lsts L. In the resultng colourng of G, no neghbour of v k obtans the colour γ Lv ( k ). Hence we complete the colourng of G by assgnng t to v k. Now G s a near-trangulaton whch s not a trangulaton ( k 4 ). Frst assume that Lv ( k 1) = 3 and consder the colours n ths lst. Besdes α contaned n every lst, we always fnd always a second colour n the ntersecton Lv ( k 1) Lv ( 2), whch we denote by β and use for the colourng of v 2, together wth cv ( 1) = α. Then consder the colours n Lv ( k ) \ { α, β }: f there are two dstnct colours γ and δ, one of them can be removed from Lv ( k 1), such that the remanng lst stll contans three colours. Wthout loss of generalty let γ be ths colour,.e. Lv ( k 1) = { α, βδ, }. Next we contnue as n the case of a trangulaton by defnng new lsts L ( u ) = L( u ) \ { γ } ( = 1,, l ) and L ( v) = L( v) for the remanng vertces v G { u1,, u l }. Then we apply the nducton hypothess to C and ts nteror wth the new lsts L, and complete the colourng of G by assgnng γ to v k. Otherwse, f Lv ( k ) \ { α, β } s a lst of only one colour, say γ, then β Lv ( k ) holds, and we reserve β for v k. As β Lv ( k 1) holds, L ( vk 1) = L( vk 1)\{ β} can now be a lst of only two colours. Then there s at most one vertex w= vk 1, not adjacent to v 1, wth a lst L ( vk 1) of at least two colours, contanng α and another colour, other than β. Next we defne new lsts L ( u ) = L( u ) \ { β} ( = 1,, l ), and set L ( v) = L( v) for the remanng vertces v G { u1,, ul, vk. Then a lst wth at least 3 colours s avalable for every vertex v C { vk, and a lst L ( v) = L0 s assgned to all vertces v n the nteror of C. Agan we apply the nducton hypothess to C and ts nteror wth the new lsts L. In the resultng colourng of G, no neghbour of v k obtans the colour β Lv ( k ). Hence we complete the colourng of G by assgnng β to v k. Fnally assume that Lv ( k 1) = 2 holds from the begnnng. Then we always fnd a colour β n Lv ( 2) wth β Lv ( k 1), and hence assgn cv ( 1) = α and cv ( 2) = β. Now ether β Lv ( k ) or β Lv ( k ) holds. In the frst case, we reserve β for the colourng of v k, contnue wth defnng new lsts L and then perform the nducton step, as was descrbed n the last paragraph. Otherwse, β Lv ( k ) mples that there are two dstnct colours γ and δ 4CT_2008Dec23.doc page 4
5 n Lv ( k ) \ { α, β }. One of them, say γ, s not n Lv ( k 1), such that the new lst L ( vk 1) = L( vk 1)\{ γ } remans a lst of two colours, namely α and δ. Next we reserve γ for the colourng of v k, and contnue as n the prevous case wth Lv ( k 1) = 3 and two dstnct colours γ and δ n Lv ( k ) \ { α, β }. Acknowledgments Many deas employed n ths paper orgnate from the elegant and sophstcated constructon of Thomassen s proof that planar graphs are 5-choosable [5]. The author s ndebted to all who contrbuted to the progress of ths work by fndng errors n prevous versons. References [1] K. Appel and W. Haken: The soluton of the four-color-map problem. Sc. Amer. 237 (1977), [2] P. J. Heawood: Map-colour theorem. Quart. J. Pure Appl. Math. 24 (1890), [3] A. B. Kempe: On the geographcal problem of the four colors, Amer. J. Math. 2 (1879), [4] N. Robertson, D. P. Sanders, P. D. Seymour and R. Thomas: A new proof of the four colour theorem. Electron. Res. Announc. Amer. Math. Soc. 2 (1996), (electronc) [5] C. Thomassen: Every planar graph s 5-choosable. J. Combn. Theory Ser. B 62 (1994), [6] M. Vogt: Lst colourngs of planar graphs. Dscrete Math. 120 (1993), CT_2008Dec23.doc page 5
Problem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationPAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationarxiv: v3 [cs.dm] 7 Jul 2012
Perfect matchng n -unform hypergraphs wth large vertex degree arxv:1101.580v [cs.dm] 7 Jul 01 Imdadullah Khan Department of Computer Scence College of Computng and Informaton Systems Umm Al-Qura Unversty
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More information42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples.
42. Mon, Dec. 8 Last tme, we were dscussng CW complexes, and we consdered two d erent CW structures on S n. We contnue wth more examples. (2) RP n. Let s start wth RP 2. Recall that one model for ths space
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationarxiv: v2 [cs.ds] 1 Feb 2017
Polynomal-tme Algorthms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutaton Graphs Chars Papadopoulos Spyrdon Tzmas arxv:170104634v2 [csds] 1 Feb 2017 Abstract Gven a vertex-weghted
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationZ 4p - Magic labeling for some special graphs
Internatonal Journal of Mathematcs and Soft Computng Vol., No. (0, 6-70. ISSN Prnt : 49-8 Z 4p - Magc labelng for some specal graphs ISSN Onlne: 9-55 V.L. Stella Arputha Mary Department of Mathematcs,
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationGeometric drawings of K n with few crossings
Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationThe Second Eigenvalue of Planar Graphs
Spectral Graph Theory Lecture 20 The Second Egenvalue of Planar Graphs Danel A. Spelman November 11, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationDistribution of subgraphs of random regular graphs
Dstrbuton of subgraphs of random regular graphs Zhcheng Gao Faculty of Busness Admnstraton Unversty of Macau Macau Chna zcgao@umac.mo N. C. Wormald Department of Combnatorcs and Optmzaton Unversty of Waterloo
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
More informationNeryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija
Neryškoj dchotomnų testo klausmų r socalnų rodklų dferencjavmo savybų klasfkacja Aleksandras KRYLOVAS, Natalja KOSAREVA, Julja KARALIŪNAITĖ Technologcal and Economc Development of Economy Receved 9 May
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationDiscrete Mathematics
Dscrete Mathematcs 3 (0) 6 40 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Hamltonan cycles wth all small even chords Guantao Chen a, Katsuhro
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationDifferential Polynomials
JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationDiscrete Mathematics
Dscrete Mathematcs 311 (2011) 544 559 Contents lsts avalable at ScenceDrect Dscrete Mathematcs ournal homepage: www.elsever.com/locate/dsc Loose Hamlton cycles n hypergraphs Peter Keevash a, Danela Kühn
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationarxiv: v1 [math.co] 7 Apr 2015
Ranbow connecton n some dgraphs Jesús Alva-Samos 1 Juan José Montellano-Ballesteros Abstract arxv:1504.0171v1 [math.co] 7 Apr 015 An edge-coloured graph G s ranbow connected f any two vertces are connected
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More information3rd Bay Area Mathematical Olympiad
2001 3rd Bay Area Mathematcal Olympad February 27, 2001 Problems and Solutons 1 Each vertex of a regular 17-gon s colored red, blue, or green n such a way that no two adacent vertces have the same color.
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationBasic Regular Expressions. Introduction. Introduction to Computability. Theory. Motivation. Lecture4: Regular Expressions
Introducton to Computablty Theory Lecture: egular Expressons Prof Amos Israel Motvaton If one wants to descrbe a regular language, La, she can use the a DFA, Dor an NFA N, such L ( D = La that that Ths
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationOn intransitive graph-restrictive permutation groups
J Algebr Comb (2014) 40:179 185 DOI 101007/s10801-013-0482-5 On ntranstve graph-restrctve permutaton groups Pablo Spga Gabrel Verret Receved: 5 December 2012 / Accepted: 5 October 2013 / Publshed onlne:
More information(k,?)-sandwich Problems: why not ask for special kinds of bread?
Couto-Fara-Klen-Prott-Noguera MC 2014/4/9 19:04 page 17 #1 Matemátca Contemporânea, Vol. 42, 17 26 c?2014, Socedade Braslera de Matemátca (k,?)-sandwch Problems: why not ask for specal knds of bread? F.
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationVertex Graceful Labeling-Some Path Related Graphs
Internatonal J.Math. Combn. Vol.3013), 44-49 Vertex Graceful Labelng-Some Path Related Graphs P.Selvaraju 1, P.Balaganesan and J.Renuka 3 1 Department of Mathematcs, Vel Tech Engneerng College, Avad, Chenna-
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationTuring Machines (intro)
CHAPTER 3 The Church-Turng Thess Contents Turng Machnes defntons, examples, Turng-recognzable and Turng-decdable languages Varants of Turng Machne Multtape Turng machnes, non-determnstc Turng Machnes,
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA permuted random walk exits faster
A permuted random wal exts faster Rchard Pymar Perla Sous Aprl 4, 013 Abstract Let σ be a permutaton of {0,..., n}. We consder the Marov chan X whch jumps from 0, n to σ( + 1) or σ( 1), equally lely. When
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More information