DOCSLIB.ORG

Introduction to Tropical Geometry

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Tropical Geometry Introduction to Tropical Geometry Diane Maclagan Bernd Sturmfels Graduate Studies in Mathematics Volume 161 American Mathematical Society Introduction to Tropical Geometry https://doi.org/10.1090//gsm/161 Introduction to Tropical Geometry Diane Maclagan Bernd Sturmfels Graduate Studies in Mathematics Volume 161 American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Dan Abramovich Daniel S. Freed Rafe Mazzeo (Chair) Gigliola Staffilani 2010 Mathematics Subject Classification. Primary 14T05; Secondary 05B35, 12J25, 13P10, 14M25, 15A80, 52B20. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-161 Library of Congress Cataloging-in-Publication Data Maclagan, Diane, 1974– Introduction to tropical geometry / Diane Maclagan, Bernd Sturmfels. pages cm. — (Graduate studies in mathematics ; volume 161) Includes bibliographical references and index ISBN 978-0-8218-5198-2 (alk. paper) 1. Tropical geometry—Study and teaching (Graduate) 2. Geometry, Algebraic—Study and teaching (Graduate) I. Sturmfels, Bernd, 1962– II. Title. III. Tropical geometry. QA582.M33 2015 516.35—dc23 2014036141 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Permissions to reuse portions of AMS publication content are handled by Copyright Clearance Center’s RightsLink service. For more information, please visit: http://www.ams.org/rightslink. Send requests for translation rights and licensed reprints to [email protected]. Excluded from these provisions is material for which the author holds copyright. In such cases, requests for permission to reuse or reprint material should be addressed directly to the author(s). Copyright ownership is indicated on the copyright page, or on the lower right-hand corner of the first page of each article within proceedings volumes. c 2015 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at http://www.ams.org/ 10987654321 201918171615 To Saul and Hyungsook Contents Preface ix Chapter 1. Tropical Islands 1 §1.1. Arithmetic 2 §1.2. Dynamic Programming 7 §1.3. Plane Curves 11 §1.4. Amoebas and their Tentacles 17 §1.5. Implicitization 21 §1.6. Group Theory 25 §1.7. Curve Counting 31 §1.8. Compactifications 34 §1.9. Exercises 39 Chapter 2. Building Blocks 43 §2.1. Fields 43 §2.2. Algebraic Varieties 52 §2.3. Polyhedral Geometry 58 §2.4. Gr¨obner Bases 65 §2.5. Gr¨obner Complexes 74 §2.6. Tropical Bases 81 §2.7. Exercises 89 Chapter 3. Tropical Varieties 93 §3.1. Hypersurfaces 93 vii viii Contents §3.2. The Fundamental Theorem 102 §3.3. The Structure Theorem 110 §3.4. Multiplicities and Balancing 118 §3.5. Connectivity and Fans 128 §3.6. Stable Intersection 133 §3.7. Exercises 149 Chapter 4. Tropical Rain Forest 153 §4.1. Hyperplane Arrangements 153 §4.2. Matroids 161 §4.3. Grassmannians 170 §4.4. Linear Spaces 182 §4.5. Surfaces 192 §4.6. Complete Intersections 201 §4.7. Exercises 214 Chapter 5. Tropical Garden 221 §5.1. Eigenvalues and Eigenvectors 222 §5.2. Tropical Convexity 228 §5.3. The Rank of a Matrix 243 §5.4. Arrangements of Trees 255 §5.5. Monomials in Linear Forms 268 §5.6. Exercises 273 Chapter 6. Toric Connections 277 §6.1. Toric Background 278 §6.2. Tropicalizing Toric Varieties 281 §6.3. Orbits 291 §6.4. Tropical Compactifications 297 §6.5. Geometric Tropicalization 309 §6.6. Degenerations 322 §6.7. Intersection Theory 334 §6.8. Exercises 346 Bibliography 351 Index 361 Preface Tropical geometry is an exciting new field at the interface between algebraic geometry and combinatorics with connections to many other areas. At its heart it is geometry over the tropical semiring, which is R ∪{∞}with the usual operations of addition and multiplication replaced by minimum and addition, respectively. This turns polynomials into piecewise-linear func- tions and replaces an algebraic variety by an object from polyhedral geom- etry, which can be regarded as a “combinatorial shadow” of the original variety. In this book we introduce this subject at a level that is accessible to beginners. Tropical geometry has become a large field, and only a small selection of topics can be covered in a first course. We focus on the study of tropical varieties that arise from classical algebraic varieties. Methods from commutative algebra and polyhedral geometry are central to our approach. This necessarily means that many important topics are left out. These in- clude the systematic development of tropical geometry as an intrinsic geome- try in its own right, connections to enumerative and real algebraic geometry, connections to mirror symmetry, connections to Berkovich spaces and ab- stract curves, and the more applied aspects of max-plus algebra. Luckily most of these topics are covered in other recent or forthcoming books, such as [BCOQ92], [But10], [Gro11], [IMS07], [Jos], [MR], and [PS05]. Prerequisites. This text is intended to be suitable for a class on trop- ical geometry for first-year graduate students in mathematics. We have attempted to make the material accessible to readers with a minimal back- ground in algebraic geometry, at the level of the undergraduate text book Ideals, Varieties, and Algorithms by Cox, Little, and O’Shea [CLO07]. ix x Preface Essential prerequisites for this book are mastery of linear algebra and the material on rings and fields in a first course in abstract algebra. Since tropical geometry draws on many fields of mathematics, some additional background in geometry, topology, or number theory will be beneficial. Polyhedra and polytopes play a fundamental role in tropical geometry, and some prior exposure to convexity and polyhedral combinatorics may help. For that we recommend Ziegler’s book Lectures on Polytopes [Zie95]. Chapter 1 offers a friendly welcome to our readers. It has no specific prerequisites and is meant to be enjoyable for all. The first three sections in Chapter 2 cover background material in abstract algebra, algebraic geom- etry, and polyhedral geometry. Enough definitions and examples are given that an enthusiastic reader can fill in any gaps. All students (and their teachers) are strongly urged to explore the exercises for Chapters 1 and 2. Some of the results and their proofs will demand more mathematical ma- turity and expertise. Chapters 2 and 3 require some commutative algebra. Combinatorics and multilinear algebra will be useful for studying Chapters 4 and 5. Chapter 6 assumes familiarity with modern algebraic geometry. Overview. We begin by relearning the arithmetic operations of addition and multiplication. The rest of Chapter 1 offers tapas that can be enjoyed in any order. They show a glimpse of the past, present, and future of tropical geometry and serve as an introduction to the more formal contents of this book. In Chapter 2, the first half covers background material, while the second half develops a version of Gr¨obner basis theory suitable for algebraic varieties over a field with valuation. The highlights are the construction of the Gr¨obner complex and the resulting finiteness of tropical bases. Chapter 3 is the heart of the book. The two main results are the Fun- damental Theorem 3.2.3, which characterizes tropical varieties in seemingly different ways, and the Structure Theorem 3.3.5, which says that they are connected balanced polyhedral complexes of the correct dimension. Stable intersections of tropical varieties reveal a hint of intersection theory. Tropical linear spaces and their parameter spaces, the Grassmannian and the Dressian, appear in Chapter 4. Matroid theory plays a foundational role. Our discussion of complete intersections includes mixed volumes of Newton polytopes and a tropical proof of Bernstein’s Theorem for n equations in n variables. We also study the combinatorics of surfaces in 3-space. Chapter 5 covers spectral theory for tropical matrices, tropical convexity, and determinantal varieties. It also showcases computations with Bergman fans of matroids and other linear spaces. Chapter 6 concerns the connec- tion between tropical varieties and toric varieties. It introduces the tropical approach to degenerations, compactifications, and enumerative geometry. Preface xi Teaching possibilities. A one-semester graduate course could be based on Chapters 2 and 3, plus selected topics from the other chapters. One possibility is to start with two or three weeks of motivating examples selected from Chapter 1 before moving on to Chapters 2 and 3. A course for more advanced graduate students could start with Gr¨obner bases as presented in the second half of Chapter 2, cover Chapter 3 with proofs, and end with a sampling of topics from the later chapters. Students with an interest in combinatorics and computation might gravitate toward Chapters 4 and 5. An advanced course for students specializing in algebraic geometry would focus on Chapters 3 and 6. Covering the entire book would require a full academic year or an exceptionally well-prepared group of participants. We have attempted to keep the prerequisites low enough to make parts of the book appropriate for self-study by a final-year undergraduate. The sec- tions in Chapter 2 could serve as first introductions to their subject areas. A simple route through Chapter 3 is to focus in detail on the hypersurface case, and to discuss the Fundamental Theorem and Structure Theorem without proofs.
Load more

Recommended publications
  • 7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok
    7 LATTICE POINTS AND LATTICE POLYTOPES Alexander Barvinok INTRODUCTION Lattice polytopes arise naturally in algebraic geometry, analysis, combinatorics, computer science, number theory, optimization, probability and representation the- ory. They possess a rich structure arising from the interaction of algebraic, convex, analytic, and combinatorial properties. In this chapter, we concentrate on the the- ory of lattice polytopes and only sketch their numerous applications. We briefly discuss their role in optimization and polyhedral combinatorics (Section 7.1). In Section 7.2 we discuss the decision problem, the problem of finding whether a given polytope contains a lattice point. In Section 7.3 we address the counting problem, the problem of counting all lattice points in a given polytope. The asymptotic problem (Section 7.4) explores the behavior of the number of lattice points in a varying polytope (for example, if a dilation is applied to the polytope). Finally, in Section 7.5 we discuss problems with quantifiers. These problems are natural generalizations of the decision and counting problems. Whenever appropriate we address algorithmic issues. For general references in the area of computational complexity/algorithms see [AB09]. We summarize the computational complexity status of our problems in Table 7.0.1. TABLE 7.0.1 Computational complexity of basic problems. PROBLEM NAME BOUNDED DIMENSION UNBOUNDED DIMENSION Decision problem polynomial NP-hard Counting problem polynomial #P-hard Asymptotic problem polynomial #P-hard∗ Problems with quantifiers unknown; polynomial for ∀∃ ∗∗ NP-hard ∗ in bounded codimension, reduces polynomially to volume computation ∗∗ with no quantifier alternation, polynomial time 7.1 INTEGRAL POLYTOPES IN POLYHEDRAL COMBINATORICS We describe some combinatorial and computational properties of integral polytopes.
    [Show full text]
  • Tropical Geometry of Deep Neural Networks
    Tropical Geometry of Deep Neural Networks Liwen Zhang 1 Gregory Naitzat 2 Lek-Heng Lim 2 3 Abstract 2011; Montufar et al., 2014; Eldan & Shamir, 2016; Poole et al., 2016; Telgarsky, 2016; Arora et al., 2018). Recent We establish, for the first time, explicit connec- work (Zhang et al., 2016) showed that several successful tions between feedforward neural networks with neural networks possess a high representation power and ReLU activation and tropical geometry — we can easily shatter random data. However, they also general- show that the family of such neural networks is ize well to data unseen during training stage, suggesting that equivalent to the family of tropical rational maps. such networks may have some implicit regularization. Tra- Among other things, we deduce that feedforward ditional measures of complexity such as VC-dimension and ReLU neural networks with one hidden layer can Rademacher complexity fail to explain this phenomenon. be characterized by zonotopes, which serve as Understanding this implicit regularization that begets the building blocks for deeper networks; we relate generalization power of deep neural networks remains a decision boundaries of such neural networks to challenge. tropical hypersurfaces, a major object of study in tropical geometry; and we prove that linear The goal of our work is to establish connections between regions of such neural networks correspond to neural network and tropical geometry in the hope that they vertices of polytopes associated with tropical ra- will shed light on the workings of deep neural networks. tional functions. An insight from our tropical for- Tropical geometry is a new area in algebraic geometry that mulation is that a deeper network is exponentially has seen an explosive growth in the recent decade but re- more expressive than a shallow network.
    [Show full text]
  • Group Actions and Divisors on Tropical Curves Max B
    Claremont Colleges Scholarship @ Claremont HMC Senior Theses HMC Student Scholarship 2011 Group Actions and Divisors on Tropical Curves Max B. Kutler Harvey Mudd College Recommended Citation Kutler, Max B., "Group Actions and Divisors on Tropical Curves" (2011). HMC Senior Theses. 5. https://scholarship.claremont.edu/hmc_theses/5 This Open Access Senior Thesis is brought to you for free and open access by the HMC Student Scholarship at Scholarship @ Claremont. It has been accepted for inclusion in HMC Senior Theses by an authorized administrator of Scholarship @ Claremont. For more information, please contact [email protected]. Group Actions and Divisors on Tropical Curves Max B. Kutler Dagan Karp, Advisor Eric Katz, Reader May, 2011 Department of Mathematics Copyright c 2011 Max B. Kutler. The author grants Harvey Mudd College and the Claremont Colleges Library the nonexclusive right to make this work available for noncommercial, educational purposes, provided that this copyright statement appears on the reproduced ma- terials and notice is given that the copying is by permission of the author. To dis- seminate otherwise or to republish requires written permission from the author. Abstract Tropical geometry is algebraic geometry over the tropical semiring, or min- plus algebra. In this thesis, I discuss the basic geometry of plane tropical curves. By introducing the notion of abstract tropical curves, I am able to pass to a more abstract metric-topological setting. In this setting, I discuss divisors on tropical curves. I begin a study of G-invariant divisors and divisor classes. Contents Abstract iii Acknowledgments ix 1 Tropical Geometry 1 1.1 The Tropical Semiring .
    [Show full text]
  • Notes by Eric Katz TROPICAL GEOMETRY
    Notes by Eric Katz TROPICAL GEOMETRY GRIGORY MIKHALKIN 1. Introduction 1.1. Two applications. Let us begin with two examples of questions where trop- ical geometry is useful. Example 1.1. Can we represent an untied trefoil knot as a genus 1 curve of degree 5 in RP3? Yes, by means of tropical geometry. It turns out that it can be be represented by a rational degree 5 curve but not by curve of genus greater than 1 since such a curve must sit on a quadric surface in RP3. 3 k 3 Figure 1. Untied trefoil. Example 1.2. Can we enumerate real and complex curves simultaneously by com- binatorics? For example, there is a way to count curves in RP2 or CP2 through 3d − 1+ g points by using bipartite graphs. 1.2. Tropical Geometry. Tropical geometry is algebraic geometry over the tropi- cal semi-field, (T, “+”, “·”). The semi-field’s underlying set is the half-open interval [−∞, ∞). The operations are given for a,b ∈ T by “a + b” = max(a,b) “a · b”= a + b. The semi-field has the properties of a field except that additive inverses do not exist. Moreover, every element is an idempotent, “a + a”= a so there is no way to adjoin inverses. In some sense algebra becomes harder, geometry becomes easier. By the way, tropical geometry is named in honor of a Brazilian computer scien- tist, Imre Simon. Two observations make tropical geometry easy. First, the tropical semiring T naturally has a Euclidean topology like R and C. Second, the geometric structures are piecewise linear structures, and so tropical geometry reduces to a combination 1 2 MIKHALKIN of combinatorics and linear algebra.
    [Show full text]
  • Applications of Tropical Geometry in Deep Neural Networks
    Applications of Tropical Geometry in Deep Neural Networks Thesis by Motasem H. A. Alfarra In Partial Fulfillment of the Requirements For the Degree of Masters of Science in Electrical Engineering King Abdullah University of Science and Technology Thuwal, Kingdom of Saudi Arabia April, 2020 2 EXAMINATION COMMITTEE PAGE The thesis of Motasem H. A. Alfarra is approved by the examination committee Committee Chairperson: Bernard S. Ghanem Committee Members: Bernard S. Ghanem, Wolfgang Heidrich, Xiangliang Zhang 3 ©April, 2020 Motasem H. A. Alfarra All Rights Reserved 4 ABSTRACT Applications of Tropical Geometry in Deep Neural Networks Motasem H. A. Alfarra This thesis tackles the problem of understanding deep neural network with piece- wise linear activation functions. We leverage tropical geometry, a relatively new field in algebraic geometry to characterize the decision boundaries of a single hidden layer neural network. This characterization is leveraged to understand, and reformulate three interesting applications related to deep neural network. First, we give a geo- metrical demonstration of the behaviour of the lottery ticket hypothesis. Moreover, we deploy the geometrical characterization of the decision boundaries to reformulate the network pruning problem. This new formulation aims to prune network pa- rameters that are not contributing to the geometrical representation of the decision boundaries. In addition, we propose a dual view of adversarial attack that tackles both designing perturbations to the input image, and the equivalent perturbation to the decision boundaries. 5 ACKNOWLEDGEMENTS First of all, I would like to express my deepest gratitude to my thesis advisor Prof. Bernard Ghanem who supported me through this journey. Prof.
    [Show full text]
  • Polyhedral Combinatorics, Complexity & Algorithms
    POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS By FOAD MAHDAVI PAJOUH Bachelor of Science in Industrial Engineering Sharif University of Technology Tehran, Iran 2004 Master of Science in Industrial Engineering Tarbiat Modares University Tehran, Iran 2006 Submitted to the Faculty of the Graduate College of Oklahoma State University in partial fulfillment of the requirements for the Degree of DOCTOR OF PHILOSOPHY July, 2012 COPYRIGHT c By FOAD MAHDAVI PAJOUH July, 2012 POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS Dissertation Approved: Dr. Balabhaskar Balasundaram Dissertation Advisor Dr. Ricki Ingalls Dr. Manjunath Kamath Dr. Ramesh Sharda Dr. Sheryl Tucker Dean of the Graduate College iii Dedicated to my parents iv ACKNOWLEDGMENTS I would like to wholeheartedly express my sincere gratitude to my advisor, Dr. Balabhaskar Balasundaram, for his continuous support of my Ph.D. study, for his patience, enthusiasm, motivation, and valuable knowledge. It has been a great honor for me to be his first Ph.D. student and I could not have imagined having a better advisor for my Ph.D. research and role model for my future academic career. He has not only been a great mentor during the course of my Ph.D. and professional development but also a real friend and colleague. I hope that I can in turn pass on the research values and the dreams that he has given to me, to my future students. I wish to express my warm and sincere thanks to my wonderful committee mem- bers, Dr. Ricki Ingalls, Dr. Manjunath Kamath and Dr. Ramesh Sharda for their support, guidance and helpful suggestions throughout my Ph.D.
    [Show full text]
  • Computations in Algebraic Geometry with Macaulay 2
    Computations in algebraic geometry with Macaulay 2 Editors: D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels Preface Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith- mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv- ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi- mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
    [Show full text]
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • Tropical Geometry? Eric Katz Communicated by Cesar E
    THE GRADUATE STUDENT SECTION WHAT IS… Tropical Geometry? Eric Katz Communicated by Cesar E. Silva This note was written to answer the question, What is tropical geometry? That question can be interpreted in two ways: Would you tell me something about this research area? and Why the unusual name ‘tropi- Tropical cal geometry’? To address Figure 1. Tropical curves, such as this tropical line the second question, trop- and two tropical conics, are polyhedral complexes. geometry ical geometry is named in transforms honor of Brazilian com- science. Here, tropical geometry can be considered as alge- puter scientist Imre Simon. braic geometry over the tropical semifield (ℝ∪{∞}, ⊕, ⊗) questions about This naming is compli- with operations given by cated by the fact that he algebraic lived in São Paolo and com- 푎 ⊕ 푏 = min(푎, 푏), 푎 ⊗ 푏 = 푎 + 푏. muted across the Tropic One can then find tropical analogues of classical math- varieties into of Capricorn. Whether his ematics and define tropical polynomials, tropical hyper- work is tropical depends surfaces, and tropical varieties. For example, a degree 2 questions about on whether he preferred to polynomial in variables 푥, 푦 would be of the form do his research at home or polyhedral min(푎 + 2푥, 푎 + 푥 + 푦, 푎 + 2푦, 푎 + 푥, 푎 + 푦, 푎 ) in the office. 20 11 02 10 01 00 complexes. The main goal of for constants 푎푖푗 ∈ ℝ ∪ {∞}. The zero locus of a tropical tropical geometry is trans- polynomial is defined to be the set of points where the forming questions about minimum is achieved by at least two entries.
    [Show full text]
  • Arxiv:2010.06953V2 [Math.RA] 23 Apr 2021
    IDENTITIES AND BASES IN THE HYPOPLACTIC MONOID ALAN J. CAIN, ANTÓNIO MALHEIRO, AND DUARTE RIBEIRO Abstract. This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the hypoplactic monoid of rank 2. This confirms that all hypoplactic monoids of rank greater than or equal to 2 satisfy exactly the same identities. We then give a complete characterization of those identities, and prove that the variety generated by the hypoplactic monoid has finite axiomatic rank, by giving a finite basis for it. 1. Introduction A (non-trivial) identity is a formal equality u ≈ v, where u and v are words over some alphabet of variables, which is not of the form u ≈ u. If a monoid is known to satisfy an identity, an important question is whether the set of identities it satisfies is finitely based, that is, if all these identities are consequences of those in some finite subset (see [37, 42]). The plactic monoid plac, also known as the monoid of Young tableaux, is an important algebraic structure, first studied by Schensted [38] and Knuth [23], and later studied in depth by Lascoux and Schützenberger [27]. It is connected to many different areas of Mathematics, such as algebraic combinatorics, symmetric functions [29], crystal bases [4] and representation theory [14]. In particular, the question of identities in the plactic monoid has received a lot of attention recently [26, 20]. Finitely-generated polynomial-growth groups are virtually nilpotent and so sat- isfy identities [16].
    [Show full text]
  • 3. Linear Programming and Polyhedral Combinatorics Summary of What Was Seen in the Introductory Lectures on Linear Programming and Polyhedral Combinatorics
    Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory lectures on linear programming and polyhedral combinatorics. Definition 3.1 A halfspace in Rn is a set of the form fx 2 Rn : aT x ≤ bg for some vector a 2 Rn and b 2 R. Definition 3.2 A polyhedron is the intersection of finitely many halfspaces: P = fx 2 Rn : Ax ≤ bg. Definition 3.3 A polytope is a bounded polyhedron. n n−1 Definition 3.4 If P is a polyhedron in R , the projection Pk ⊆ R of P is defined as fy = (x1; x2; ··· ; xk−1; xk+1; ··· ; xn): x 2 P for some xkg. This is a special case of a projection onto a linear space (here, we consider only coordinate projection). By repeatedly projecting, we can eliminate any subset of coordinates. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = fx : Ax ≤ bg and let • S+ = fi : aik > 0g, • S− = fi : aik < 0g, • S0 = fi : aik = 0g. T Clearly, any element in Pk must satisfy the inequality ai x ≤ bi for all i 2 S0 (these inequal- ities do not involve xk). Similarly, we can take a linear combination of an inequality in S+ and one in S− to eliminate the coefficient of xk. This shows that the inequalities: ! ! X X aik aljxj − alk aijxj ≤ aikbl − alkbi (1) j j for i 2 S+ and l 2 S− are satisfied by all elements of Pk.
    [Show full text]
  • Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone
    Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone: (510) 642 4687, Fax: (510) 642 8204, [email protected] M.A. [Diplom] TH Darmstadt, Germany, Mathematics and Computer Science, 1985 Ph.D. [Dr. rer. nat.] TH Darmstadt, Germany, Mathematics, 1987 Ph.D. University of Washington, Seattle, Mathematics, 1987 Professional Experience: 1987–1988 Postdoctoral Fellow, I.M.A., University of Minnesota, Minneapolis 1988–1989 Assistant Professor, Research Institute for Symbolic Computation, (RISC-Linz), Linz, Austria 1989–1991 Assistant Professor, Department of Mathematics, Cornell University 1992–1996 Associate Professor, Department of Mathematics, Cornell University 1994–2001 Professor, Department of Mathematics, University of California, Berkeley 2001– Professor, Department of Mathematics and Computer Science, UC Berkeley Academic Honors: 1986 - 1987 Alfred P. Sloan Doctoral Dissertation Fellowship 1991 - 1993 Alfred P. Sloan Research Fellow 1992 - 1997 National Young Investigator (NSF) 1992 - 1997 David and Lucile Packard Fellowship 1999 Lester R. Ford Prize for Expository Writing (MAA) 2000-2001 Miller Research Professorship, UC Berkeley Spring 2003 John von Neumann Professor, Technical University M¨unchen 2003-2004 Hewlett-Packard Research Professor at MSRI Berkeley July 2004 Clay Mathematics Institute Senior Scholar Research Interests: Computational Algebra, Combinatorics, Algebraic Geometry Selected Professional Activities: Visiting Positions: D´epartment de Math´ematiques, Universit´ede Nice, France, Spring 1989 Mathematical Sciences Research Institute, Berkeley, Fall 1992 Courant Institute, New York University, 1994–95 RIMS, Kyoto University, Japan, 1997–98 Current Editorial Board Membership: Journal of the American Mathematical Society, Duke Mathematical Journal, Collecteana Mathematica, Beitr¨agezur Geometrie und Algebra, Order, Discrete and Computational Geometry, Applicable Algebra (AAECC) Journal of Combinatorial Theory (Ser.
    [Show full text]