Elementary Combinatorial Topology
|
|
- Chrystal Melina Griffith
- 5 years ago
- Views:
Transcription
1 Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, Marne-la-Vallée Cedex address:
2
3 Contents Motivation 1 Some results in combinatorics whose proofs are topological 1 Chapter 1. Basic notions 3 1. Geometric simplicial complexes 3 2. Abstract simplicial complexes 3 3. Simplicial maps 5 4. Barycentric subdivision and posets 5 5. Chain complexes and chain maps 6 Exercises 7 Chapter 2. Sperner s lemma, its relatives and applications 9 1. Statement 9 2. A hypergraph version of Hall s theorem 9 3. Dissection of a rectangle in triangles of same area 9 4. Brouwer s theorem 9 Chapter 3. Ky Fan s lemmas Ky Fan s lemma Coloring of Kneser graphs Splitting necklaces Borsuk-Ulam s theorem 12 Chapter 4. Scarf 13 Bibliography 15 iii
4
5 Motivation Topological combinatorics uses topological tools to prove combinatorial results. For a better understanding of such a result, purely combinatorial proofs are often desirable. A natural way to get such a proof consists in combinatorializing the topological tools. The combinatorial counterparts of classical theorems involving continuous structures belong to combinatorial topology, which actually was the name of what later became algebraic topology. This quest for a better understanding may have as a first motivation to find constructive or algorithmic proof for results [...]. Another motivation is to find a way to generalize the results, a thing that can not always be done through continuous tools. According to author s knowledge, there are at least two results in combinatorics that generalize result of topological combinatorics whose only known proofs are purely combinatorial and uses theorems from combinatorial topology. These results belongs to the area of Kneser graphs and hypergraphs. The first one is the complete proof by Chen [] of the equality between the usual chromatic number and the circular chromatic number of Kneser graphs [...]. The other one is the equality between the chromatic number of Kneser hypergraphs and that of quasi-stable Kneser hypergraphs. An interesting thing in Chen s approach is the new theorem in combinatorial topology he needed to prove, which has no counterpart in algebraic topology. Even if the backbone of this course is combinatorial topology, the applications in combinatorics will play a centrale role, for they ultimately remain the true motivation. Some results in combinatorics whose proofs are topological The most classical theorem in topological combinatorics is the Lovasz-Kneser theorem. [...] Theorem 1. χ(kg(n, k)) = n 2k + 2 In 1986, also with a clever use of the Borsuk-Ulam theorem, Alon proved the celebrated splitting necklace theorem. [...] Suppose that the necklace has n beads, each of a certain type i, where 1 i t. Suppose there is an even number 2a i of beads of type i, 1 i t, t i=1 2a i = n. A 2-splitting of the necklace is a partition of it into 2 parts, each consisting of a finite number of non-overlapping sub-necklaces of beads whose union captures either a i beads of type i, for every 1 i t. Theorem 2. Every necklace with an even number 2a i of beads of type i, 1 i t, has a 2-splitting requiring at most t cuts. Applicaton in discrete geometries are numerous. For instance Theorem 3. Any triangulation of a rectangle using triangles of same areas has an even number of triangles. In French, this theorem is called mmre-ppre, which would be something like???. It is a jeu de mot untranslatable mme-aire, p paire which means same area, even p : if the triangulation has p triangles of same area, p is even. A graph is perfect is, for it and all its induced subgraphs, the maximal size of a clique is equal to the chromatic number. A kernel in an oriented graph D = (V, A) is a independent subset K of vertices such that K N + (K) = V. A clique-acyclic orientation is an orientation of the edges of a graph in such a way that each clique is acyclic. The following theorem has been conjectured by Berge and Duchet [] and proved by Boros and Gurvich []. The original proof as well as a more recent and simpler one by Aharoni and Holtzmann uses toplogical results ([...]). Theorem 4. A graph is perfect if and only if for every clique-acyclic orientation there is a kernel. 1
6
7 CHAPTER 1 Basic notions 1. Geometric simplicial complexes 1.1. Simplices and complexes. A geometric simplex or simply simplex when there is no ambiguity is the convex hull of affinely independent points. It is a polytope and has as such facets, faces, edges and vertices. By definition, all faces of a geometric simplex are again geometric simplices. The dimension of a geometric simplex σ denoted dim(σ) is its number of vertices minus one. The empty set is considered as a 1-dimensional simplex. Geometric simplices in dimension 0, 1, 2, and 3 are explicited in Figure 1. For these values, the simplices have special names: a 0-dimensional simplex is a vertex, a 1-dimensional simplex in an edge, a 2-dimensional simplex is a triangle, and a 3-dimensional simplex is a tetrahedron. The set of vertices of a simplex σ is denoted V (σ). A geometric simplicial complex is a collection of simplices satsifying the following properties: if τ is a face of a simplex σ, then τ. if σ and σ are two simplices of, then their intersection σ σ is a face of both. Its dimension denoted dim( ) is max σ dim σ. Its vertex set is the set of vertices of it simplices: V ( ) = σ K V (σ). The set of its edges is denoted E( ) and is the set of its 1- dimensional simplices. The empty set is always one of the simplices of a geometric simplicial complex K. Figure 2 shows a geometric simplex of dimension 2, whereas Figure 3 shows a collection of geometric simplices that do not provide a geometric simplicial complex (the intersection of the two triangles is a face of none of them). The union σ σ of all simplices of a geometric simplicial complex is called the polyhedron of the simplicial complex. It is denoted. Let X be a topological space. A geometric simplicial complex T is a triangulation of X if T is homeomorphic to X. 2. Abstract simplicial complexes 2.1. Simplices and complexes. A collection K of subsets of a finite set V is called an abstract simplcial complex or simply simplicial complex if there is no ambiguity if for all F K and all F F we have F K. Each F K is called an (abstract) simplex. Again, the empty set is one of these simplices. The elements of V are called the vertices of K and is usually denote V (K). The dimension of an abstract simplex F is denoted dim(f ) and is defined d = 0 d = 1 d = 2 d = 3 Figure 1. d-dimensional geometric simplices for d = 0, 1, 2, 3 3
8 Figure 2. A geometric simplicial complex Figure 3. Not a geometric simplicial complex to be its number of vertices minus 1. The dimension of an abstract simplicial complex is the maximal dimension of its simplices. Example 1. Given a graph G = (V, E), the collection of subsets X V such that G[X] is a clique is an abstract simplicial complex, called the clique complex. The collection of subsets X V such that G[X] is independent is also an abstract simplicial complex, called the independence complex. Example 2. Given a graph G = (V, E), the collection of subsets F E such that F is a forest is an abstract simplicial complex. More generally, the collection of independent sets in a matroid forms an abstract simplicial complex. 4
9 Given a geometric simplicial complex, one gets a natural abstract simplicial complex K whose simplices are the V (σ) with σ. We say that induces the abstract simplicial complex K. Conversely, given an abstract simplicial complex K, we can build a geometric simplicial complex such that the V (σ) s for σ are precisely the simplices of K. Indeed, let N := V (K and let σ N 1 be the (N 1)-dimensional geometric simplex whose vertices are identified with the vertices of K. Keep from σ N 1 the faces whose vertices are the vertex set of a simplex of K. This collection of faces is the geometric simplicial complex we are looking for. It is called the (geometric) realization of K Pseudomanifold. An abstract simplicial complex K is a pseudomanifold of dimension d if each (d 1)-simplex is contained in at least one d-simplex and at most two d-simplices. It is said without boundary if each (d 1)-simplex is contained in exactly two d-simplices. 3. Simplicial maps Given two abstract simplicial complexes K and L, a map λ : V (K) V (L) is a simplicial map is for all F K, we have λ(f ) L. We will sometimes speak of simplicial maps with geometric simplicial complex. It will implicetly mean that the simplcial map are defined on the abstract simplicial complexes induced by the geometric ones. 4. Barycentric subdivision and posets Let P = (V, ) be a poset. From this poset, we define an abstract simplicial complex (P ), called the order complex, whose vertices are the elements of P and whose simplices are the subsets {v 0,..., v k } V for some k such that v 0 v 1... v k. An abstract simplicial complex can be seen as a poset whose elements are the simplices ordered by the inclusion. We define the barycentric subdivision of K as (K \ { }, ). It is denoted sd(k). Given a realization of K, we get easily a realization of sd(k) as follows: For each F K, we denote by v F the barycenter of the face of having F as vertex set. Then := {conv(v F0,..., v Fk ) : {F 0,..., F k } sd(k)} is a realization of sd(k). The fact that the simplices of sd(k) are associated to simplices of is obvious. The only thing that has to be checked is that is a geometric simplicial complex. Proposition 1. is a geometric simplicial complex. Proof. We first prove that two distinct simplices of cannot simultaneously intersect in their relative interiors. Suppose for a contradiction that we have conv(v F0,..., v Fk ) conv(v F 0,..., v F ), with intersection in their relative interiors and {F 0,..., F k } {F 0,..., F k }. Then there is an x such k that k k x = λ i v Fi = µ j v F j, i=0 with µ j, λ i > 0 and k i=0 λ i = k j=0 µ j = 1. We select such simplices so that k + k is as small as possible. Now, note that v Fi = 1 v F i F i v and v F j = 1 v F j F j v. The point x is in the faces of corresponding to F k and to F k. Since is a geometric simplicial complex, x is in the face corresponding to F k F k. By identifying for each v V its coefficient in k i=0 λ iv Fi and in k j=0 µ jv F j, we see that we necessarily have F k = F k (there is uniqueness of the writing of x as a convex combination of the vertices of a face in which it lies). Taking a vertex v in F k \ F k 1 5 j=0
10 shows that λ k µ k. Taking a vertex in v in F k \ F k 1 shows that λ k µ k. Hence λ k = µ k. Defining x 1 k 1 k 1 1 = k 1 i=0 λ λ i v Fi = k 1 i i=0 j=0 µ µ j v F j j j=0 contradicts the minimality of k + k. We have proved that two distinct simplices of cannot simultaneously intersect in their relative interiors. Now, let us suppose that there are two simplices whose intersection is not contained in a face of one of them. Again, let us write these two simplices conv(v F0,..., v Fk ) and conv(v F 0,..., v F ), k and let x be in their intersection with k k x = λ i v Fi = µ j v F j. i=0 We keep only F i s and F j s with µ j, λ i > 0 and k i=0 λ i = k j=0 µ j = 1. But according we have just proved, then all F i and F j are then equal. j=0 5. Chain complexes and chain maps 5.1. Chain complexes. Let K be an abstract simplicial complex. For each k = 0,..., dim(k), we define the set C k (K) of all formal sums of k-simplices of K with the relation σ + σ = 0 for any k-simplex σ. The set C k (K) is therefore a Z 2 -vector space with the set of k-simplices of K as a basis. An element c of C k (K) is called a k-chain and is of the form c = σ K k h σ σ, with h σ Z 2 for all σ K k. For each k = 1,..., dim(k), we define the boundary operator k : C k (K) C k 1 (K) as follows on any element of the basis and we extend it by linearity. k {v 0,..., v k } = {v 0,..., v k } \ {v i }. i=0 We also define 0 : C 0 (K) {0} (it takes the value 0 on all 0-dimensional simplices.) The collection C(K) = (C k (K), k ) k=0,...,dim(k) is called the chain complex of K. The following lemma is the fundamental property of the boundary operator. It is the starting point of algebraic topology. Its proof follows from a direct calculation. Lemma 1. k 1 k = 0 for all k = 1,..., dim(k). When there is no risk of confusion, the index is often omitted and the boundary operator is simply denoted Chain maps. Given two simplicial complexes K and L with dim(k) dim(l), a chain map f # : C(K) C(L) is a collection of maps f k# : C k (K) C k (L) commuting with the boundary operator: for all k {1,..., dim(k)}, we have k f k# = f (k 1)# k. A natural chain map λ # is associated to each simplicial map λ : K L. It is defined as follows for each simplex, and extended by linearity. { {λ(v0 ),..., λ(v λ k# ({v 0,..., v k }) = k )} if the λ(v i ) are pairwise distinct, 0 if not. The fact that λ # is a chain map follows from a straightfoward calculation and is stated in the following lemma. Lemma 2. The map λ # is a chain map. 6
11 Exercises 5.3. Cyclomatic number. Let G = (V, E) be a graph. A subset C E of edges is called a generalized cycle if deg C (v) = 0 for all v V. We define the sum of two generalized cycles C and C as their symmetric difference C C. We denote by C(G) the set of all generalize cycles with this addition. 1. Prove that C is a Z 2 -vector space. The cyclomatic number of a graph G, denoted φ(g), is defined as dim C(G). 2. Using the boundary operator, prove that E V + k(g) = φ(g), where k(g) is the number of connected components of G. 3. As applications of the above formula, prove that (i) if G is a tree, we have E = V 1, (ii) if G is planar and connected, we have F E + V = 2, where F is the number of faces of any plane representation (the infinite face included). Of course, there are also direct proofs of these facts. 7
12
13 CHAPTER 2 Sperner s lemma, its relatives and applications 1. Statement Sperner s lemma is usually stated as a lemma. However, we prefer to call it here a theorem [...]. Theorem 5 (Sperner s lemma). Let T be a triangulation of a d-dimensional geometric simplex s d. Let λ : V (T ) {0, 1,..., d} be a labelling of the vertices of T such that each vertex of s d gets a distinct label (and so we can identify the vertices of s d with the integers 0, 1,..., d), each vertex v of T gets a label in λ(v (s )), where s is the minimal face of s d containing v. Then there is an odd number of simplices σ T such that λ(σ) = {0, 1,..., d}. Such a simplex σ is said to be fully-labelled. We propose first a compact proof, which uses the notions of chain complexes and chain maps defined in Chapter 1. A second proof below is a slightly longer, but has the great advantage to use only elementary tools and to provide an algorithm for finding fully-labelled simplices. Proof 1. The proof works by induction and uses the fact that λ is a simplicial map from T to 2 {0,1,...,d}, and induces therefore a chain map λ #. If d = 0, there is nothing to prove. Assume now that the theorem is true for d 1. Let c be the formal sum of all d-simplices of T and let c i be the formal sum of all (d 1)-simplices of T on the facet missing label i. We have c = d i=1 c i. Thus, λ #( c) = d i=1 λ #(c i ). By induction, we have λ #(c i ) = {0, 1,..., d} \ {i}. We get therefore λ # (c) 0. Since there is only one d-simplex in 2 {0,1,...,d}, we get λ # (c) = {0, 1,..., d}. Proof 2. This proof works again by induction. If d = 0, there is nothing to prove. Consider the graph G = (V, E) whose vertices are the simplices plus an additional dummy vertex r. Put an edge between two vertices if the corresponding simplices share a common facet labelled {0, 1,..., d 1}. Put an edge between r and a vertex representing a simplex σ if σ has a facet on the boundary of s d with labels {0, 1,..., d 1}. Now, take a vertex v r. We claim that v is of odd degree if and only if the corresponding simplex σ is fully-labelled. Indeed, if σ is fully-labelled, it is of degree 1. If λ(v (σ)) = {0, 1,..., d 1}, exactly one of these labels appears twice, giving exactly two facets with labels {0, 1,..., d 1}. The degree of v is then equal to 2. Finally, if none of these possibilities occurs, the label set of σ does not contain {0,..., d 1} and the degree of v is 0. By induction, r is of odd degree. In a graph, the number of odd degree vertices is even. There is therefore an odd number of vertices r of odd degree, which means that there is an odd number of fully-labelled simplices. 2. A hypergraph version of Hall s theorem 3. Dissection of a rectangle in triangles of same area 4. Brouwer s theorem 9
14
15 CHAPTER 3 Ky Fan s lemmas In the previous chapter, we have seen a combinatorial version of Brouwer s theorem. A more general theorem in topology is the Borsuk-Ulam theorem. It will be stated in Section. etc Combinatorial Stokes Formula. 1. Ky Fan s lemma Proposition 2 (Combinatorial Stokes formula). Let M be a d-dimensional pseudomanifold and denote by M its boundary. Let λ : V (M) { 1, +1,..., m, +m} be a labelling of the vertices such that for any two adjacent vertices u and v, we have λ(u) + λ(v) 0. Denote by α(k 0, k 1,..., k d ) the number of d-simplices F M such that λ(f ) = {k 0, k 1,..., k d } and by β(k 0, k 1,..., k d 1 ) the number of (d 1)-simplices F M such that λ(f ) = {k 0, k 1,..., k d 1 }. Then ) (α( j 0, +j 1,..., ( 1) d 1 j d + α ( j 0, j 1,..., ( 1) d j d ) ) 1 j 0 <j 1 <...<j d m = 1 j 0 <j 1 <...<j d 1 m ) β (j 0, j 1,..., ( 1) d 1 j d 1 Proof. Let u : (x, y) (Z 2 ) 2 (x + y, x + y) (Z 2 ) 2 and µ l : C l (C) (Z 2 ) 2 defined for an l-dimensional simplex F by (0, 1) if µ l (F ) = (1, 0) if (0, 0) if not. We have u µ l = µ l 1. There are only three cases. [...] 1.2. The Ky Fan lemma - general case. Theorem 6. Let T be a triangulation of the d-dimensional sphere S d such that if v V (T ) then v V (T ). Let λ : V (T ) { 1, +1,..., m, +m} be a labelling of the vertices such that λ( v) = λ(v) for each v V (T ) λ(u) + λ(v) 0 for each edge uv E(T ). Then there are an odd number of d-simplices σ of T such that λ(v (σ)) has the form { j 0, +j 1,..., ( 1) d j d } with j 0 < j 1 <... < j d. In particular, we have m d + 1. Proof. We first assume that T refines the triangulation of S d induced by the d-dimensional cross-polytope. [...] 1.3. The Ky Fan lemma a purely combinatorial version. Using the combinatorial interpretation of the barycentric subdivision of the crosspolytope, we get a purely combinatorial version of the Ky Fan lemma. This version will be useful for proving results in combinatorics. Palvogyi + flot alon + conjecture 2. Coloring of Kneser graphs 3. Splitting necklaces 11 mod 2
16 4. Borsuk-Ulam s theorem 12
17 CHAPTER 4 Scarf kernel 13
18
19 Bibliography 15
Sperner and Tucker s lemma
Sperner and Tucker s lemma Frédéric Meunier February 8th 2010 Ecole des Ponts, France Sperner s lemma Brouwer s theorem Let B be a d-dimensional ball and f be a continuous B B map. Then always Theorem
More informationThe Borsuk-Ulam theorem- A Combinatorial Proof
The Borsuk-Ulam theorem- A Combinatorial Proof Shreejit Bandyopadhyay April 14, 2015 1 Introduction The Borsuk-Ulam theorem is perhaps among the results in algebraic topology having the greatest number
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationThe Charney-Davis conjecture for certain subdivisions of spheres
The Charney-Davis conjecture for certain subdivisions of spheres Andrew Frohmader September, 008 Abstract Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced,
More informationA Constructive Proof of Ky Fan's Generalization of Tucker's Lemma
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2005 A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma Timothy Prescott
More informationBasics of Combinatorial Topology
Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationLecture 5: Simplicial Complex
Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.
More informationCombinatorial topology in games and optimization OJD
Combinatorial topology in games and optimization OJD Frédéric Meunier May 25, 2015 2 Contents 1 Preliminaries 5 1.1 Notations............................. 5 1.2 Complexity............................ 5
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationEuropean Journal of Combinatorics. Homotopy types of box complexes of chordal graphs
European Journal of Combinatorics 31 (2010) 861 866 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Homotopy types of box complexes
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationarxiv: v1 [math.co] 16 Jun 2017
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg Jesus A. De Loera Xavier Goaoc Frédéric Meunier Nabil Mustafa arxiv:1706.05975v1 [math.co] 16 Jun 2017 June 20,
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More information4.2 Simplicial Homology Groups
4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationSPERNER S LEMMA MOOR XU
SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationarxiv: v1 [math.gt] 29 Jun 2009
arxiv:0906.5193v1 [math.gt] 29 Jun 2009 Sperner s Lemma, the Brouwer Fixed-Point Theorem, and Cohomology Nikolai V. Ivanov 1. INTRODUCTION. The proof of the Brouwer fixed-point Theorem based on Sperner
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationarxiv: v1 [cs.cg] 7 Oct 2017
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations Anna Lubiw 1, Zuzana Masárová 2, and Uli Wagner 2 arxiv:1710.02741v1 [cs.cg] 7 Oct 2017 1 School of Computer Science, University
More informationHomological and Combinatorial Proofs of the Brouwer Fixed-Point Theorem
Homological and Combinatorial Proofs of the Brouwer Fixed-Point Theorem Everett Cheng June 6, 2016 Three major, fundamental, and related theorems regarding the topology of Euclidean space are the Borsuk-Ulam
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationThe Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids. The Fully Optimal Basis of a Bounded Region Emeric Gioan Michel Las Vergnas published in European Journal of Combinatorics
More informationSimplicial Objects and Homotopy Groups. J. Wu
Simplicial Objects and Homotopy Groups J. Wu Department of Mathematics, National University of Singapore, Singapore E-mail address: matwuj@nus.edu.sg URL: www.math.nus.edu.sg/~matwujie Partially supported
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationPlanar graphs. Chapter 8
Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations
More informationOn the Partial Sum of the Laplacian Eigenvalues of Abstract Simplicial Complexes
On the Partial Sum of the Laplacian Eigenvalues of Abstract Simplicial Complexes Rediet Abebe and Joshua Pfeffer Abstract We present progress made in showing the generalized Grone-Merris conjecture for
More informationWhat is high-dimensional combinatorics?
What is high-dimensional combinatorics? Random-Approx, August 08 A (very) brief and (highly) subjective history of combinatorics Combinatorics must always have been fun. But when and how did it become
More informationThe following is a summary, hand-waving certain things which actually should be proven.
1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines
More informationCombinatorics I (Lecture 36)
Combinatorics I (Lecture 36) February 18, 2015 Our goal in this lecture (and the next) is to carry out the combinatorial steps in the proof of the main theorem of Part III. We begin by recalling some notation
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )
The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )
1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationADJACENCY POSETS OF PLANAR GRAPHS
ADJACENCY POSETS OF PLANAR GRAPHS STEFAN FELSNER, CHING MAN LI, AND WILLIAM T. TROTTER Abstract. In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below,
More informationCombinatorial Gems. Po-Shen Loh. June 2009
Combinatorial Gems Po-Shen Loh June 2009 Although this lecture does not contain many offical Olympiad problems, the arguments which are used are all common elements of Olympiad problem solving. Some of
More informationarxiv: v1 [math.co] 12 Aug 2018
CONVEX UNION REPRESENTABILITY AND CONVEX CODES R. AMZI JEFFS AND ISABELLA NOVIK arxiv:1808.03992v1 [math.co] 12 Aug 2018 Abstract. We introduce and investigate d-convex union representable complexes: the
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationLecture 5 CLASSIFICATION OF SURFACES
Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the
More informationHomology cycle bases from acyclic matchings
Homology cycle bases from acyclic matchings Dmitry Feichtner-Kozlov University of Bremen Kyoto Workshop, January 019 What is... Applied Topology? studying global features of shapes applications in other
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationBROUWER S FIXED POINT THEOREM. Contents
BROUWER S FIXED POINT THEOREM JASPER DEANTONIO Abstract. In this paper we prove Brouwer s Fixed Point Theorem, which states that for any continuous transformation f : D D of any figure topologically equivalent
More informationCHRISTOS A. ATHANASIADIS
FLAG SUBDIVISIONS AND γ-vectors CHRISTOS A. ATHANASIADIS Abstract. The γ-vector is an important enumerative invariant of a flag simplicial homology sphere. It has been conjectured by Gal that this vector
More informationSPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES
SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES AKHIL MATHEW Abstract These are notes from a talk I gave for high-schoolers at the Harvard- MIT Mathematics
More informationAlgorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras
Algorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras What is it to be Perfect? Introduced by Claude Berge in early 1960s Coloring number and clique number are one and the same for all induced
More informationGraphs and Discrete Structures
Graphs and Discrete Structures Nicolas Bousquet Louis Esperet Fall 2018 Abstract Brief summary of the first and second course. É 1 Chromatic number, independence number and clique number The chromatic
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationTHE BORSUK-ULAM AND HAM SANDWICH THEOREMS
THE BORSUK-ULAM AND HAM SANDWICH THEOREMS BRIAN LIBGOBER Abstract. In this paper I describe the way one might begin proving the Borsuk-Ulam theorem using measure theory and what remains to be done for
More information5 Graphs
5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
More informationSimplicial Cells in Arrangements of Hyperplanes
Simplicial Cells in Arrangements of Hyperplanes Christoph Dätwyler 05.01.2013 This paper is a report written due to the authors presentation of a paper written by Shannon [1] in 1977. The presentation
More informationarxiv: v2 [math.co] 24 Aug 2016
Slicing and dicing polytopes arxiv:1608.05372v2 [math.co] 24 Aug 2016 Patrik Norén June 23, 2018 Abstract Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions
More informationWait-Free Computability for General Tasks
Wait-Free Computability for General Tasks Companion slides for Distributed Computing Through Combinatorial Topology Maurice Herlihy & Dmitry Kozlov & Sergio Rajsbaum 1 Road Map Inherently colored tasks
More informationChapter 8. Voronoi Diagrams. 8.1 Post Oce Problem
Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest
More informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationWeek 7 Convex Hulls in 3D
1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationDual Complexes of Cubical Subdivisions of R n
Dual Complexes of Cubical Subdivisions of R n Herbert Edelsbrunner and Michael Kerber Abstract We use a distortion to define the dual complex of a cubical subdivision of R n as an n-dimensional subcomplex
More informationReflection groups 4. Mike Davis. May 19, Sao Paulo
Reflection groups 4 Mike Davis Sao Paulo May 19, 2014 https://people.math.osu.edu/davis.12/slides.html 1 2 Exotic fundamental gps Nonsmoothable aspherical manifolds 3 Let (W, S) be a Coxeter system. S
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationBraid groups and Curvature Talk 2: The Pieces
Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationCharacterizations of graph classes by forbidden configurations
Characterizations of graph classes by forbidden configurations Zdeněk Dvořák September 14, 2015 We consider graph classes that can be described by excluding some fixed configurations. Let us give some
More informationif for every induced subgraph H of G the chromatic number of H is equal to the largest size of a clique in H. The triangulated graphs constitute a wid
Slightly Triangulated Graphs Are Perfect Frederic Maire e-mail : frm@ccr.jussieu.fr Case 189 Equipe Combinatoire Universite Paris 6, France December 21, 1995 Abstract A graph is triangulated if it has
More informationThree applications of Euler s formula. Chapter 10
Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationNon-extendible finite polycycles
Izvestiya: Mathematics 70:3 1 18 Izvestiya RAN : Ser. Mat. 70:3 3 22 c 2006 RAS(DoM) and LMS DOI 10.1070/IM2006v170n01ABEH002301 Non-extendible finite polycycles M. Deza, S. V. Shpectorov, M. I. Shtogrin
More informationA combinatorial proof of a formula for Betti numbers of a stacked polytope
A combinatorial proof of a formula for Betti numbers of a staced polytope Suyoung Choi Department of Mathematical Sciences KAIST, Republic of Korea choisy@aistacr (Current Department of Mathematics Osaa
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationThe Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge October 20, 2016 Abstract We consider the problem of minimizing
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More information2. Lecture notes on non-bipartite matching
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 15th, 013. Lecture notes on non-bipartite matching Given a graph G = (V, E), we are interested in finding
More informationOn Cyclically Orientable Graphs
DIMACS Technical Report 2005-08 February 2005 On Cyclically Orientable Graphs by Vladimir Gurvich RUTCOR, Rutgers University 640 Bartholomew Road Piscataway NJ 08854-8003 gurvich@rutcor.rutgers.edu DIMACS
More informationHomology of Simplicial Complexes
Homology of Simplicial Complexes Math, David Perkinson Introduction. This is an introduction to the homology of simplicial complexes suitable for a first course in linear algebra. It uses little more than
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationarxiv: v1 [math.co] 9 Dec 2015
ALGEBRAIC DISCRETE MORSE THEORY FOR THE HULL RESOLUTION arxiv:1512.03045v1 [math.co] 9 Dec 2015 PATRIK NORÉN Abstract. We study how powerful algebraic discrete Morse theory is when applied to hull resolutions.
More informationLower bound theorem for normal pseudomanifolds
Lower bound theorem for normal pseudomanifolds Bhaskar Bagchi a, Basudeb Datta b,1 arxiv:0802.3747v1 [math.gt] 26 Feb 2008 a Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Bangalore
More informationThe Probabilistic Method
The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees
More information66 III Complexes. R p (r) }.
66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationMOURAD BAÏOU AND FRANCISCO BARAHONA
THE p-median POLYTOPE OF RESTRICTED Y-GRAPHS MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median
More informationA non-partitionable Cohen-Macaulay simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Discrete
More information