DOCSLIB.ORG

Combinatoire Des Polytopes TD B Faces and Operations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Combinatoire Des Polytopes TD B Faces and Operations Combinatoire des polytopes TD B Faces and operations 1 Faces and f-vectors Consider a d-dimensional polytope P . Its f-vector is the vector (f0(P ); f1(P ); : : : ; fd(P )) where fi(P ) is d the number of -dimensional faces of . Its -polynomial is the polynomial : P i. i P f f(P; x) = i=0 fi(P )x Exercice 1 (f-vectors of the simplex, the cube, and the cross-polytope). What are the f-vectors and f-polynomials of the d-dimensional simplex, cube, and cross-polytope? Solution. For the simplex 4d, a i-face corresponds to a (i + 1)-subset of the d + 1 vertices, thus d+1 and d+1 . For the cube , a -face corresponds to the choice of fi(4d) = i+1 f(4d; x) = (x+1) −1 =x d i one of the two possible inequalities on coordinates, thus d d−i and d. d − i fi(d) = i 2 f(d; x) = (x + 2) For the cross-polytope d, a i-face corresponds to the choice of one of the two opposite vertices on i + 1 coordinates, thus d i+1 and d d . fi( d3) = i+1 2 f( d; x) = x − 1=x + (2x + 1) =x 3 3 Exercice 2 (f-vectors and polarity). Let P be a d-dimensional polytope and P 4 denote the polar polytope of P . Show that f(P 4; x) = xd − 1=x + xd−1f(P; 1=x). Solution. For any 0 ≤ i ≤ d − 1, the i-dimensional faces of P 4 correspond to the d − 1 − i dimensional faces of P . Therefore d d−1 d−1 4 X 4 i d X i d X d−1−j f(P ; x) = fi(P )x = x + fd−1−i(P )x = x + fj(P )x i=0 i=0 j=0 d d X d−1−j d d−1 = x − 1=x + fj(P )x = x − 1=x + x f(P; 1=x): j=0 d d−1 As a sanity check, one can verify using Exercice 1 that f(4d; x) = x − 1=x + x f(4d; 1=x) and that d d−1 . f( d; x) = x − 1=x + x f(d; 1=x) 3 Exercice 3 (f-vectors of 3-polytopes). Prove that the f-vectors of 3-dimensional polytopes are precisely the integer vectors (f0; f1; f2; 1) such that f0 − f1 + f2 = 2 f0 ≤ 2f2 − 4 and f2 ≤ 2f0 − 4: [Hint: For the dicult direction, compute the f-vector of a pyramid over a p-gon, and study the eect on the f-vector of the two polar operations of simple vertex truncation and simplicial facet stacking, see Exercice 5.] Which polytopes satisfy the rst (resp. second) inequality? Solution. Consider the f-vector (f0; f1; f2; 1) of a 3-dimensional polytope. It satises f0 − f1 + f2 = 2 by Euler's formula (you can even choose your favorite proof among a list of 20 dierent proofs: https:// www.ics.uci.edu/~eppstein/junkyard/euler/). Moreover, we have 2f1 ≥ 3f0 (as every edge contains 2 vertices while every vertex is contained in at least 3 edges) and 2f1 ≥ 3f2 (as every edge is contained in 2 facets while every facet contains at least 3 edges). Therefore, we obtain using Euler's relation that 4 = 2f0−2f1+2f2 ≤ −f0+2f2 and similarly 4 ≤ 2f0−f2 which proves the two inequalities. (Equivalently, we could also have proved the rst inequality and argued the second one by polarity.) Conversely, we need to prove that any vector (f0; f1; f2; 1) satisfying these inequalities is the f-vector of a 3-dimensional polytope. For this, we observe the following four facts: 1 • The f-vector of a pyramid over a p-gon is (p + 1; 2p; p + 1; 1). • If v is a simple vertex (contained in 3 edges), then truncating v adds (2; 3; 1; 0) to the f-vector. • If f is a simplicial facet (containing 3 edges), then stacking over f adds (1; 3; 2; 0) to the f-vector. • These two operations suce to obtain all integer vectors (f0; f1; f2; 1) with f0 − f1 + f2 = 2, f0 ≤ 2f2 − 4 and f2 ≤ 2f0 − 4 from the vectors (p + 1; 2p; p + 1; 1) with p ≥ 3. Representing the f-vectors in the (f0; f2) plane, we obtain the following picture: f2 =2f0 - 4 (simplicial 3-polytopes) f2 f0 =2f2 - 4 (simple 3-polytopes) 4 4 f0 Figure 1: The f-vectors of 3-dimensional polytopes represented in the (f0; f2)-plane. The value of f1 is clearly obtained from Euler's formula f0 − f1 + f2 = 2. Exercice 4 (Non-unimodality of f-vector). A sequence x0; : : : ; xd is unimodal if there exists 0 ≤ i ≤ d such that x0 ≤ x1 ≤ · · · ≤ xi−1 ≤ xi ≥ xi+1 ≥ · · · ≥ xd−1 ≥ xd or the opposite. We say that i is the unimodality peak. (1) Show that the f-vectors of d-polytopes are unimodal for d ≤ 5. (2) Using Exercice 1, show that the f-vectors of simplices, cubes and cross-polytopes are unimodal and study their unimodality peak. (3) Show that there exist simplicial polytopes whose f-vector is not unimodal. [Hint: use iterative stackings on facets of the cross-polytope, see Exercice 5.] (4) ? Are the f-vectors of d-polytopes all unimodal for d = 6, d = 7, d = 8,...? Solution. (1) The result is clear for d ≤ 4. For d = 5, we have 5f0 ≤ 2f1 and 2f3 ≥ 5f4 so that (f0; f1; f2; f3; f4) is unimodal unless f1 > f2 < f3. Using Euler's relation f0 − f1 + f2 − f3 + f4 = 2, we would obtain 10 = 5f0 − 5f1 + 5f2 − 5f3 + 5f4 ≤ −3f1 + 5f2 − 3f3 < −f2 a contradiction. (2) We compute that f (4 ) i + 2 f ( ) 2(i + 1) f ( ) i + 2 i d = ; i d = ; and i d = ; fi+1(4d) d − i fi+1(d) d − i fi+13( d) 2(d − i − 1) 3 which are smaller than if and only if d−2 , 2d−4 and 2d−4 respectively, so that the - 1 i ≤ 2 i ≤ 3 i ≤ 3 f vectors of the simplex, cube and cross-polytope are all unimodal with a peaks around d=2, around d=3 and around 2d=3 respectively. (For the cross-polytope, we could equivalently argue by polarity from the cube.) In fact, we can even study the f-functions ΦP (t) := ftd(P ) of the simplex, cube and cross-polytope when d tends to innity. We obtain that d + 1 1 d d 21−t d φ (t) = ∼ ; φ (t) = 2(1−t)d ∼ ; 4d td + 1 tt(1 − t)1−t d td tt(1 − t)1−t d + 1 1 d and φ (t) = ∼ ; 4d td + 1 tt(1 − t)1−t 2 d d d 1 21−x 2x φ4d (x) ∼ xx(1−x)1−x φd (x) ∼ xx(1−x)1−x φ d (x) ∼ xx(1−x)1−x 3 Figure 2: The -functions , , and for . f φ4d φd φ d d 2 [10] 3 have a peak at t = 1=2, at t = 1=3, and at t = 2=3 which gets sharper when d increases. These functions are illustrated in Figure 2. (3) We observe that the unimodality peak of the simplex is at 1=2 while that of the cross-polytope is at 2=3. Therefore, we consider the polytope obtained from a d-dimensional cross-polytope by p iterative stacking operations (see Exercice 5). If d is big enough and p is well-chosen, the f-vector of the resulting polytope will have two peaks around 1=2 and 2=3. To properly choose the values of d and p, we write a small sage program: sage: def is_unimodal(v): ....: i = 0 ....: while i < len(v)-1 and v[i] <= v[i+1]: ....: i += 1 ....: while i < len(v)-1 and v[i] >= v[i+1]: ....: i += 1 ....: return i == len(v)-1 ....: sage: is_unimodal([1,2,4,4,5,3,2]) True sage: is_unimodal([1,2,4,3,5,3,2]) False sage: for e in range(4,32): ....: d = 2*e ....: v = vector([binomial(d,i+1)*2^(i+1) for i in range(d)]) ....: w = vector([binomial(d,i) for i in range(d)]) - vector([0]*(d-1) + [1]) ....: p = ceil((v[e+1]-v[e])/(w[e]-w[e+1])) ....: if not is_unimodal(v + p*w): ....: print d, p ....: 60 52344913920 62 108935988690 64 226370041013 66 469746708832 68 973525920427 Figure 3 gives examples for three values of d and p. (4) This is an open problem when d = 6 and d = 7. Using similar ideas as vertex stacking on facets, it is known that there exist 8-dimensional polytopes with non-unimodal f-vectors. 3 d = 60 d = 80 d = 100 p = 52344913920 p = 75395083047498 p = 99598837913001354 Figure 3: Three non-unimodal f-vector shapes. 2 Operations on polytopes Exercice 5 (Truncating and stacking). Let P be a d-dimensional polytope, v be a simple vertex of P (contained in precisely d facets) and f be a simplicial facet of P (containing precisely d vertices). We consider the polytopes obtained by • truncating the vertex v of P by a hyperplane separating v from all other vertices of P , • stacking a vertex w on the facet f of P , where the vertex w is separated from P by f, but close enough to f so that it sees the vertices of f and no other vertex of P . These operations are illustrated on Figure 4. P f w v Figure 4: Truncating a vertex v (middle) and stacking over a facet f (right).
Load more

Recommended publications
  • Topics in Algorithmic, Enumerative and Geometric Combinatorics
    Thesis for the Degree of Doctor of Philosophy Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij Division of Mathematics Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg G¨oteborg, Sweden 2012 Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij ISBN 978-91-7385-668-3 c Ragnar Freij, 2012. Doktorsavhandlingar vid Chalmers Tekniska H¨ogskola Ny serie Nr 3349 ISSN 0346-718X Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg SE-412 96 GOTEBORG,¨ Sweden Phone: +46 (0)31-772 10 00 freij@chalmers.se Printed in G¨oteborg, Sweden, 2012 Topics in algorithmic, enumerative and geometric com- binatorics Ragnar Freij ABSTRACT This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the S2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes. In the introduction, connections are drawn between the first paper and the evasiveness conjecture for monotone graph properties. In the second paper, we investigate Hansen polytopes of split graphs. By applying a partitioning technique, the number of nonempty faces is counted, and in particular we confirm Kalai’s 3d-conjecture for such polytopes. Further- more, a characterization of exactly which Hansen polytopes are also Hanner polytopes is given.
    [Show full text]
  • Plenary Lectures
    Plenary lectures A. D. Alexandrov and the Birth of the Theory of Tight Surfaces Thomas Banchoff Brown University, Providence, Rhode Island 02912, USA e-mail: Thomas Banchoff@Brown.edu Alexander Danilovich Alexandrov was born in 1912, and just over 25 years later in 1938 (the year of my birth), he proved a rigidity theorem for real analytic surfaces of type T with minimal total absolute curvature. He showed in particular that that two real analytic tori of Type T in three-space that are iso- metric must be congruent. In 1963, twenty-five years after that original paper, Louis Nirenberg wrote the first generalization of that result, for five times differentiable surfaces satisfying some technical hypothe- ses necessary for applying techniques of ordinary and partial differential equations. Prof. Shiing-Shen Chern, my thesis advisor at the University of California, Berkeley, gave me this paper to present to his graduate seminar and challenged me to find a proof without these technical hypotheses. I read Konvexe Polyeder by A. D. Alexandrov and the works of Pogoreloff on rigidity for convex surfaces using polyhedral methods and I decided to try to find a rigidity theorem for Type T surfaces using similar techniques. I found a condition equivalent to minimal total absolute curvature for smooth surfaces, that also applied to polyhedral surfaces, namely the Two-Piece Property or TPP. An object in three- space has the TPP if every plane separates the object into at most two connected pieces. I conjectured a rigidity result similar to those of Alexandroff and Nirenberg, namely that two polyhedral surfaces in three-space with the TPP that are isometric would have to be congruent.
    [Show full text]
  • Minimal Volume Product of Three Dimensional Convex Bodies with Various Discrete Symmetries
    Minimal volume product of three dimensional convex bodies with various discrete symmetries Hiroshi Iriyeh ∗ Masataka Shibata † August 12, 2021 Abstract We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under a discrete subgroup of O(3) in several cases. We also characterize the convex bodies with the minimal volume product in each case. In particular, this provides a new partial result of the non-symmetric version of Mahler’s conjecture in the three dimensional case. 1 Introduction and main results 1.1 Mahler’s conjecture and its generalization Let K be a convex body in Rn, i.e, K is a compact convex set in Rn with nonempty interior. Then K ⊂ Rn is said to be centrally symmetric if it satisfies that K = −K. Denote by Kn the set of all convex bodies in Rn equipped with the Hausdorff metric and n n by K0 the set of all K ∈ K which are centrally symmetric. The interior of K ∈ Kn is denoted by int K. For a point z ∈ int K, the polar body of K with respect to z is defined by z n K = {y ∈ R ;(y − z) · (x − z) ≤ 1 for any x ∈ K} , where · denotes the standard inner product on Rn. Then an affine invariant P(K) := min |K| |Kz| (1) z∈int K is called volume product of K, where |K| denotes the n-dimensional volume of K in Rn. arXiv:2007.08736v2 [math.MG] 8 Oct 2020 It is known that for each K ∈ Kn the minimum of (1) is attained at the unique point z on K, which is called Santaló point of K (see, e.g., [13]).
    [Show full text]
  • On K-Level Matroids: Geometry and Combinatorics Francesco Grande
    On k-level matroids: geometry and combinatorics ⊕ ⊕ Dissertation zur Erlangung des akademisches Grades eines Doktors der Naturwissenschaften am Fachbereich Mathematik und Informatik der Freien Universität Berlin vorgelegt von Francesco Grande Berlin 2015 Advisor and first reviewer: Professor Dr. Raman Sanyal Second reviewer: Professor Rekha Thomas, Ph.D. Date of the defense: October 12, 2015 Summary The Theta rank of a finite point configuration V is the maximal degree nec- essary for a sum-of-squares representation of a non-negative linear function on V . This is an important invariant for polynomial optimization that is in general hard to determine. We study the Theta rank of point configu- rations via levelness, that is a discrete-geometric invariant, and completely classify the 2-level (equivalently Theta-1) configurations whose convex hull is a simple or a simplicial polytope. We consider configurations associated to the collection of bases of matroids and show that the class of matroids with bounded Theta rank or levelness is closed under taking minors. This allows us to find a characterization of matroids with bounded Theta rank or levelness in terms of forbidden minors. We give the complete (finite) list of excluded minors for Theta-1 matroids which generalize the well-known series-parallel graphs. Moreover, we char- acterize the class of Theta-1 matroids in terms of the degree of generation of the vanishing ideal and in terms of the psd rank for the associated matroid base polytope. We analyze in full detail Theta-1 matroids from a constructive perspective and discover that they are sort-closed, which allows us to determine a uni- modular triangulation of every matroid base polytope and to characterize its volume by means of permutations.
    [Show full text]
  • Incidence Graphs and Unneighborly Polytopes
    Incidence Graphs and Unneighborly Polytopes vorgelegt von Diplom-Mathematiker Ronald Frank Wotzlaw aus G¨ottingen Von der Fakult¨at II – Mathematik und Naturwissenschaften der Technischen Universit¨at Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften – Dr. rer. nat. – genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Fredi Tr¨oltzsch Berichter: Prof. G¨unter M. Ziegler Prof. Gil Kalai Tag der wissenschaftlichen Aussprache: 6. Februar 2009 Berlin 2009 D 83 . for though it cannot hope to be useful or informative on all matters, it does at least make the reassuring claim, that where it is inaccurate it is at least definitively inaccurate. In cases of major discrepancy it’s always reality that’s got it wrong. The Restaurant at the End of the Universe Douglas Adams For Finja and Nora Preface This thesis is about polytopes and “their life in high dimensions.” Nearly all questions considered here are trivial or simple exercises when restricted to dimensions that we can “see.” More often than not, the interesting examples start to appear in dimensions d = 6, 7, 8 or even much higher. Nevertheless, I have tried to illustrate ideas with pictures throughout. The reader should be warned however that they rarely show the real nature of the mathematical problem at hand. Some of the results are generalized to objects that are more abstract than polytopes. I have taken a pragmatical point of view with respect to the level of generality that theorems are stated and proved: If a generalization was asked for in the existing literature, it is provided (if possible). The following is a list of the main results in this thesis in order of appearance: The connectivity of (k,ℓ)-incidence graphs is determined for the case • ℓ 2k + 1 in Chapter 3.
    [Show full text]
  • On Some Problems Related to 2-Level Polytopes
    On some problems related to 2-level polytopes Thèse n. 9025 2018 présenté le 22 Octobre 2018 à la Faculté des Sciences de Base chaire d’optimisation discrète programme doctoral en mathématiques École Polytechnique Fédérale de Lausanne pour l’obtention du grade de Docteur ès Sciences par Manuel Francesco Aprile acceptée sur proposition du jury: Prof Hess Bellwald Kathryn, président du jury Prof Eisenbrand Friedrich, directeur de thèse Prof Faenza Yuri, codirecteur de thèse Prof Svensson Ola, rapporteur Prof Fiorini Samuel, rapporteur Prof Weltge Stefan, rapporteur Lausanne, EPFL, 2018 "You must go from wish to wish. What you don’t wish for will always be beyond your reach." — Michael Ende, The Neverending Story. To my brother Stefano, to whom I dedicated my Bachelor thesis too. He is now six years old and he has not read it yet. Maybe one day? Acknowledgements My PhD has been an incredible journey of discovery and personal growth. There were mo- ments of frustration and doubt, when research just wouldn’t work, even depression, but there was also excitement, enjoyment, and satisfaction for my progresses. Oh, there was hard work too. A whole lot of people contributed to making this experience so amazing. First, I would like to thank my advisor Fritz Eisenbrand for his support, the trust he put in me, and for letting me do research in total freedom. He allowed me to go to quite some conferences and workshops, where I could expand my knowledge and professional network, as well as enjoying some traveling. A big “grazie” goes to Yuri Faenza, my co-advisor: in a moment when I was not sure about the direction of my research, he gave a talk about 2-level polytopes, immediately catching my interest, and, a few days after, he was introducing me to extended formulations with an improvised crash course.
    [Show full text]
  • DUALITY PHENOMENA and VOLUME INEQUALITIES in CONVEX GEOMETRY a Dissertation Submitted to Kent State University in Partial Fulfil
    DUALITY PHENOMENA AND VOLUME INEQUALITIES IN CONVEX GEOMETRY A dissertation submitted to Kent State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Jaegil Kim August, 2013 Dissertation written by Jaegil Kim B.S., Pohang University of Science and Technology, 2005 M.S., Pohang University of Science and Technology, 2008 Ph.D., Kent State University, 2013 Approved by Chair, Doctoral Dissertation Committee Dr. Artem Zvavitch Members, Doctoral Dissertation Committee Dr. Richard M. Aron Members, Doctoral Dissertation Committee Dr. Fedor Nazarov Members, Doctoral Dissertation Committee Dr. Dmitry Ryabogin Members, Outside Discipline Dr. Fedor F. Dragan Members, Graduate Faculty Representative Dr. David W. Allender Accepted by Chair, Department of Mathematical Sciences Dr. Andrew Tonge Associate Dean Raymond Craig Dean, College of Arts and Sciences ii TABLE OF CONTENTS ACKNOWLEDGEMENTS . v Introduction and Preliminaries 1 0.1 Basic concepts in Convex Geometry . 2 0.2 Summary and Notation . 5 0.3 Bibliographic Note . 7 I Mahler conjecture 8 1 Introduction to the volume product . 9 1.1 The volume product and its invariant properties . 9 1.2 Mahler conjecture and related results . 13 2 More on Hanner polytopes . 16 2.1 Connection with perfect graphs . 16 2.2 Direct sums of polytopes . 20 3 Local minimality in the symmetric case . 31 3.1 Construction of Polytopes . 31 3.2 Computation of volumes of polytopes . 41 3.3 A gap between K and a polytope . 60 4 Local minimality in the nonsymmetric case . 79 4.1 Continuity of the Santal´omap . 80 iii 4.2 Construction of polytopes for the simplex case .
    [Show full text]
  • Lecture Notes Parts 1-11
    Discrete Geometry I http://wikis.fu-berlin.de/display/discgeom/Discrete+Geometry+I — Preliminary Lecture Notes (without any guarantees) — Prof. Günter M. Ziegler Fachbereich Mathematik und Informatik, FU Berlin, 14195 Berlin ziegler@math.fu-berlin.de FU Berlin, Winter term 2013/2014 This is the first in a series of three courses on Discrete Geometry. We will get to know fascinating geo- metric structures such as configurations of points and lines, hyperplane arrangements, and in particular polytopes and polyhedra, and learn how to handle them using modern methods for computation and vi- sualization and current analysis and proof techniques. A lot of this looks quite simple and concrete at first sight (and some of it is), but it also very quickly touches topics of current research. For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding of discrete-geometric structures appearing in differential geometry, optimization, combinatorics, topology, and algebraic geometry. To follow the course, a solid background in linear algebra is necessary. Some knowledge of combinatorics and geometry is helpful. Basic Literature [1] Satyan L. Devadoss and Joseph O’Rourke. Discrete and Computational Geometry. Princeton Uni- versity Press, Princeton NJ, 2011. [2] Jacob E. Goodman and Joseph O’Rourke, editors. Handbook of Discrete and Computational Geom- etry. Chapman & Hall/CRC Press, Boca Raton, second edition, 2004. [3] Peter M. Gruber. Convex and Discrete Geometry, volume 336 of Grundlehren Series. Springer, 2007. [4] Peter M. Gruber and Jörg Wills, editors.
    [Show full text]
  • Equality Cases in Viterbo's Conjecture and Isoperimetric Billiard Inequalities
    EQUALITY CASES IN VITERBO'S CONJECTURE AND ISOPERIMETRIC BILLIARD INEQUALITIES ALEXEY BALITSKIY Abstract. We apply the billiard technique to deduce some results on Viterbo's con- jectured inequality between the volume of a convex body and its symplectic capacity. We show that the product of a permutohedron and a simplex (properly related to each other) delivers equality in Viterbo's conjecture. Using this result as well as previously known equality cases, we prove some special cases of Viterbo's conjecture and interpret them as isoperimetric-like inequalities for billiard trajectories. 1. Introduction Claude Viterbo [16] conjectured an isoperimetric inequality for any (normalized) sym- plectic capacity and the volume of a convex body X ⊂ R2n: c(X)n (1.1) vol(X) ≥ : n! The minimum is supposed to be attained (perhaps, not uniquely) on the symplectic images of the Euclidean ball. This inequality is proven up to a constant factor to the power of n in [4]. We investigate the case when c is the Hofer{Zehnder symplectic capacity cHZ . The computation of symplectic capacities is considered difficult, so we restrict to the case of convex bodies that are Lagrangian products of a component in V = Rn with q-coordinates and a component in V ∗ = Rn with p-coordinates. For such bodies there is a simple geometric interpretation, established in [5], of the Hofer{Zehnder capacity. Namely, cHZ (K × T ) = ξT (K); where ξT (K) denotes the length of the shortest closed billiard trajectory in a convex body K ⊂ V with geometry of lengths determined by another convex body T ⊂ V ∗ by the formula kqkT = maxhp; qi; q 2 V: p2T Here we assume that T contains the origin in the interior, but we do not assume that T is symmetric, so our \norm" function k · kT is not symmetric in general.
    [Show full text]
  • Prof. Günter M. Ziegler Fachbereich Mathematik Und Informatik, FU Berlin, 14195 Berlin Ziegler@Math.Fu-Berlin.De FU Berlin, Winter Term 2013/2014
    Discrete Geometry I http://wikis.fu-berlin.de/display/discgeom/Discrete+Geometry+I — Preliminary Lecture Notes (without any guarantees) — Prof. Günter M. Ziegler Fachbereich Mathematik und Informatik, FU Berlin, 14195 Berlin ziegler@math.fu-berlin.de FU Berlin, Winter term 2013/2014 This is the first in a series of three courses on Discrete Geometry. We will get to know fascinating geo- metric structures such as configurations of points and lines, hyperplane arrangements, and in particular polytopes and polyhedra, and learn how to handle them using modern methods for computation and vi- sualization and current analysis and proof techniques. A lot of this looks quite simple and concrete at first sight (and some of it is), but it also very quickly touches topics of current research. For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding of discrete-geometric structures appearing in differential geometry, optimization, combinatorics, topology, and algebraic geometry. To follow the course, a solid background in linear algebra is necessary. Some knowledge of combinatorics and geometry is helpful. Basic Literature [1] Satyan L. Devadoss and Joseph O’Rourke. Discrete and Computational Geometry. Princeton Uni- versity Press, Princeton NJ, 2011. [2] Jacob E. Goodman and Joseph O’Rourke, editors. Handbook of Discrete and Computational Geom- etry. Chapman & Hall/CRC Press, Boca Raton, second edition, 2004. [3] Peter M. Gruber. Convex and Discrete Geometry, volume 336 of Grundlehren Series. Springer, 2007. [4] Peter M. Gruber and Jörg Wills, editors.
    [Show full text]
  • Enumeration on Words, Complexes and Polytopes
    Thesis for the Degree of Licentiate of Philosophy Enumeration on words, complexes and polytopes Ragnar Freij Division of Mathematics Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg G¨oteborg, Sweden 2010 Enumeration on words, complexes and polytopes Ragnar Freij c Ragnar Freij, 2010. NO 2010:12 ISSN 1652-9715 Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg SE-412 96 GOTEBORG,¨ Sweden Phone: +46 (0)31-772 10 00 Author e-mail: freij@chalmers.se Printed in G¨oteborg, Sweden, 2010 Enumeration on words, complexes and polytopes Ragnar Freij ABSTRACT This thesis presents four papers, studying enumerative problems on combina- torial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. The main motivation is the case where some group acts transitively on the vertex set of the complex, and G is some large subgroup of this group. In particular we are interested in complexes of graph properties. As an application, we determine the C2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes. The motivation behind the second paper is Gil Kalai’s conjecture from 1989, that a centrally symmetric d-polytope must have at least 3d non-empty faces. Looking for examples that are close to achieving the lower bound, we study the centrally symmetric Hansen polytopes, associated to perfect graphs.
    [Show full text]
  • Minimal Volume Product Near Hanner Polytopes
    Minimal volume product near Hanner polytopes Jaegil Kim∗ July 30, 2018 Abstract Mahler's conjecture asks whether the cube is a minimizer for the volume product of a body and its polar in the class of symmetric convex bodies in a fixed dimension. It is known that every Hanner polytope has the same volume product as the cube or the cross-polytope. In this paper we prove that every Hanner polytope is a strict local minimizer for the volume product in the class of symmetric convex bodies endowed with the Banach-Mazur distance. 1 Introduction and Notation n A body is a compact set which is the closure of its interior and, in particular, a convex body in R n is a compact convex set with nonempty interior. Let K be a convex body in R containing the origin. Then the polar of K is defined by ◦ n K = y R x; y 1 for all x K 2 h i ≤ 2 n where ; is the usual scalar product in R . The volume product of a convex body K is defined by (Kh·)·i = min K (K z)◦ where denotes the volume. In particular, if a convex body K is P z2K j j j − j j · j symmetric, that is, K = K, then the volume product of K is given by − (K) = K K◦ P j j j j because the minimum in the definition of the volume product is attained at the origin in this case. n It turns out that the volume product is invariant under any invertible affine transformation on R , n n and also invariant under the polarity, that is, for any invertible affine transformation T : R R , ! (TK) = (K); and (K◦) = (K): (1) arXiv:1212.2544v1 [math.FA] 11 Dec 2012 P P P P Moreover, the volume product of the `p-sum of two symmetric convex bodies is the same as that of the `q-sum for p; q [1; ] with 1=p + 1=q = 1 (see [28], [15]), that is, 2 1 (K p L) = (K q L): (2) P ⊕ P ⊕ We provide the definition and other details for the `p-sum in Section 3.
    [Show full text]