Institutionen för matematik, KTH.
|
|
- Bridget Lamb
- 5 years ago
- Views:
Transcription
1 Institutionen för matematik, KTH.
2
3 Chapter 11 Construction of toric varieties 11.1 Recap example Example Consider the Segre embedding seg : P 1 P 1 P 3 given by ((x 0, x 1 ), (y 0, y 1 )) (x 0 y 0, x 0 y 1, x 1 y 0, x 1 y 1 ). Consider now the map φ : (C ) 2 (C ) 4 given by φ(t 1, t 2 ) = (1, t 1, t 2, t 1 t 2 ). Observe that if one identifies (C) 2 with the Zariski open P 1 P 1 \ (V (x 0 ) V (y 0 )) then it is φ = seg (C ) 2. This image is a torus which shows that the torus (C ) 2 can be identified with a Zariski open of the Segre variety Im(seg) P 3. The torus action of (C ) 2 on Im(seg) defined by (t 1, t 2 ) (x 0, x 1, x 3, x 4 ) = (x 0, t 1 x 1, t 2 x 3, t 1 t 2 x 4 ) is by definition an extension of the multiplicative self-action. Notice that in Example the map defining the toric embedding and the torus action was given by characters associated to the vertices of the polytope 1 1. Observe moreover that for this polytope the vertices coincide with all the lattice points in the polytope. This is of course not always the case, the polytope 2 2 for example is the convex hull of 3 vertices, but it contains 2 2 Z 2 = 6 lattice points. Example Let A = 2 2 Z 2 = {(0, 0), (0, 1), (1, 0), (1, 1)(0, 2), (2, 0)}. Consider the map defined by the associated characters and the following composition: φ A : (C ) 2 C 6 P 5, (t 1, t 2 ) (1, t 1, t 2, t 1 t 2, t 2 1, t 2 2). Observe that this map is the restriction of the 2-Veronese embedding. One sees as above that such a variety is a two dimensional projective toric variety. The previous examples suggest a general construction: 1
4 11.2 Toric varieties from polytopes Let T be an n-dimensional torus with character group M = Z n A = {m 0,..., m d } M. Consider the following action of T on C d+1 and let t (x 0,..., x d ) = (χ m 0 (t)x 0,..., χ m d (t)x d ). This action yields an action on the projective space P d as t (λx 0,..., λx d ) = λ(χ m 0 (t)x 0,..., χ m d (t)xd ). Let x 0 P d be a general points, i.e. a points with non-zero homogeneous coordinates. The orbit T x 0 = T A = T. The Zarisky closure in P d of the orbit x 0 = T is a projective algebraic variety containing a torus as Zarisky open set. Let X A = T A to be such variety. Alternatively: Let P R n be an n-dimensional polytope and let A = P Z n = {m 0,..., m d }. Assume that m 0 = 0 and that P A is contained in the positive orthant. Consider the monomial map defined by the associated characters: φ A : (C ) n C d+1 P d, (t 1,..., t n ) = t (1 : t m 1 :... : t m d ) The image Im(φ A ) is a torus T A. Define X A to be the Zariski closure of T A. This means that X A is the smallest subvariety of P d containing T A. Let A denote the n (d + 1) matrix whose columns are the vectors m i. Lemma Th variety X A is a projective toric variety of dimension equal to rank(a). Proof. Let T A = (C ) r and consider the lattice of its characters: Hom AG (T A, C ) = Z r. The map φ A induces a map: Hom AG ((C ) d+1, C ) Hom AG ((C ) n, C ); f f φ A ψ A : Z d+1 Z n, e i m i where e i are the elements of the standard lattice basis. We see that ψ A (Z d+1 ) = Z r, and thus that r = rank(a). Excercise Consider the n dimensional standard simplex n = Conv(e 0, e 1,..., e n ), where e 0 = 0. Describe the projective toric variety associated to n and 2 n. Let P R n be an n-dimensional lattice polytope. The toric variety associated to P, denoted by X P is the topic variety X P Z n. 2
5 11.3 Affine patching and subvarieties 11.4 Recap example You have seen that P n is the projective toric variety associated to the polytope n. By translating any vertex e i to e 0 = 0 one can contruct a map: φ i : (C ) n C n P n defined by t (t e 0 e i,..., 1, t en e i ). The Zariski closure of Im(φ i ) defines the affine patch of P n where x i 0, i.e. Im(φ i ) = X i Notice that the map φ i is the map defined by the lattice points: A i = {e 0 e i, e i e i,..., e n e i } We will see that projective toric varieties are in a sense a generalisation of projective space as they are built by patching together affine toric varieties defined by the vertices of the polytope Affine patching Let P R n be a polytope and let A = P Z n = {m 0,..., m d }. For every m i A define A mi = {m m i m A}. Consider φ Am : (C ) n C d, t (..., t m j m i,...) mj A and define: Not that X m is an affine toric variety. X m = Im(φ Am ) C d. Proposition Notation as above. Let V = {v 1,..., v r } be the set of vertices of P. Then X A = X vi. v i V Proof. First notice that X mi = X A X i P d and thus X A = m A X m. We prove the proposition if we show that or every m A there is at least one vertex v V such that X m X v. As observed P = Conv(V ). Let m = v i V k iv i. After clearing denominators we can write km = v i V k iv i, for k i Z 0. Notice that t m 0 iff t km = t k i v i = Π(t v i ) k i 0, which happens only if t vi 0 for every k i 0. This shows that X m X vi for every k i 0. 3
6 The vertices of the polytope defines the affine patches that bild the associated toric variety. The following gives an intuition of how projective toric varieties are considered a generalisation of the projective space. Excercise Let P be a polytope of dimension n and let P Z n = {m 0,..., m d }. Show that d n d = n and m 1,..., m n is a lattice basis (i.e. every vector in Z n is an integral combination of m 1,..., m n ) if and only if P = n. Let us now examine closer the category of smooth polytopes and the associated topic varieties. Let P be a smooth polytope anklet m 0 be a vertex. After a lattice-preserving affine transformation can we assume that m 0 = 0 and that the primitive vectors on the n edges through m 0 are e 1,..., e n. Lemma (Exercise) Let P be a smooth polytope. Then X v = C n for every vertex v. Observe that if P is a n-dimensional smooth lattice polytope, then a facet F P is a smooth polytopes of dimension (n 1). Denote by X F the associated topic variety. Lemma Let P be a smooth polytope. Then X P \ T P = F facet X F. Proof. Let dim(p ) = n, let V denote the set of vertices of P and V (F ) denote the set of vertices of F. First observe that: X P \ T P = v V (X v \ T P ) = v V ( i ({(x 1,..., x n ) X v s.t. x i = 0})). Let v = (m 1,..., m n ) V, then are n facets passing through v, F 1,..., F n such that v i = (m i,..., m i 1, m i+1, m n ) V (F i ). Clearly it is: {(x 1,..., x n ) X v s.t. x i = 0} = X vi X Fi. This proves that X P \ T P F facet X F. But because for each facet it is X F = w V (F ) X w and w = v i for some v V, it is clearly X F vi =w,w V (F )X v \ T N and thus F facet X F X P \ T P. 4
7 11.6 Assignment: exercises (1) Prove Lemma (2) Recall that kp = {m m k s.t. m i P } and that if P 1 R n, P 2 R t then P 1 P 2 = {(m, n) s.t. m P 1, m P 2 } R n R t is a polytope of dimension dim(p 1 ) + dim(p 2 ) and whose faces are products of faces of resp. polytopes. (a) Describe the faces of the polytope P = (b) Is P smooth? (c) Describe the toric variety X P as union of affine patches. (d) Describe the induced map X P P 11. 5
Institutionen för matematik, KTH.
Institutionen för matematik, KTH. Chapter 10 projective toric varieties and polytopes: definitions 10.1 Introduction Tori varieties are algebraic varieties related to the study of sparse polynomials.
More informationTORIC VARIETIES JOAQUÍN MORAGA
TORIC VARIETIES Abstract. This is a very short introduction to some concepts around toric varieties, some of the subsections are intended for more experienced algebraic geometers. To see a lot of exercises
More informationFano varieties and polytopes
Fano varieties and polytopes Olivier DEBARRE The Fano Conference Torino, September 29 October 5, 2002 Smooth Fano varieties A smooth Fano variety (over a fixed algebraically closed field k) is a smooth
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 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 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 informationORIE 6300 Mathematical Programming I September 2, Lecture 3
ORIE 6300 Mathematical Programming I September 2, 2014 Lecturer: David P. Williamson Lecture 3 Scribe: Divya Singhvi Last time we discussed how to take dual of an LP in two different ways. Today we will
More informationA brief survey of A-resultants, A-discriminants, and A-determinants
A brief survey of A-resultants, A-discriminants, and A-determinants Madeline Brandt, Aaron Brookner, Christopher Eur November 27, 2017 Abstract We give a minimalistic guide to understanding a central result
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 informationarxiv: v1 [math.co] 24 Aug 2009
SMOOTH FANO POLYTOPES ARISING FROM FINITE PARTIALLY ORDERED SETS arxiv:0908.3404v1 [math.co] 24 Aug 2009 TAKAYUKI HIBI AND AKIHIRO HIGASHITANI Abstract. Gorenstein Fano polytopes arising from finite partially
More informationClassification of smooth Fano polytopes
Classification of smooth Fano polytopes Mikkel Øbro PhD thesis Advisor: Johan Peder Hansen September 2007 Department of Mathematical Sciences, Faculty of Science University of Aarhus Introduction This
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 informationLattice-point generating functions for free sums of polytopes
Lattice-point generating functions for free sums of polytopes Tyrrell B. McAllister 1 Joint work with Matthias Beck 2 and Pallavi Jayawant 3 1 University of Wyoming 2 San Francisco State University 3 Bates
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 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 informationLifts of convex sets and cone factorizations
Lifts of convex sets and cone factorizations João Gouveia Universidade de Coimbra 20 Dec 2012 - CORE - Université Catholique de Louvain with Pablo Parrilo (MIT) and Rekha Thomas (U.Washington) Lifts of
More informationGraph Cohomology. Matthew Lin. Dagan Karp, Advisor. Satyan L. Devadoss, Reader. Department of Mathematics
Graph Cohomology Matthew Lin Dagan Karp, Advisor Satyan L. Devadoss, Reader Department of Mathematics May, 2016 Copyright 2016 Matthew Lin. The author grants Harvey Mudd College and the Claremont Colleges
More informationTopological properties of convex sets
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 5: Topological properties of convex sets 5.1 Interior and closure of convex sets Let
More information11 Linear Programming
11 Linear Programming 11.1 Definition and Importance The final topic in this course is Linear Programming. We say that a problem is an instance of linear programming when it can be effectively expressed
More informationInterval-Vector Polytopes
Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract
More informationInvestigating Mixed-Integer Hulls using a MIP-Solver
Investigating Mixed-Integer Hulls using a MIP-Solver Matthias Walter Otto-von-Guericke Universität Magdeburg Joint work with Volker Kaibel (OvGU) Aussois Combinatorial Optimization Workshop 2015 Outline
More informationToric Cohomological Rigidity of Simple Convex Polytopes
Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk
More informationComputing Tropical Resultants. A. Jensen and J. Yu. REPORT No. 44, 2010/2011, spring ISSN X ISRN IML-R /11- -SE+spring
Computing Tropical Resultants A. Jensen and J. Yu REPORT No. 44, 2010/2011, spring ISSN 1103-467X ISRN IML-R- -44-10/11- -SE+spring COMPUTING TROPICAL RESULTANTS arxiv:1109.2368v2 [math.ag] 24 Mar 2013
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 informationNoncrossing sets and a Graßmann associahedron
Noncrossing sets and a Graßmann associahedron Francisco Santos, Christian Stump, Volkmar Welker (in partial rediscovering work of T. K. Petersen, P. Pylyavskyy, and D. E. Speyer, 2008) (in partial rediscovering
More informationarxiv: v1 [math.co] 12 Dec 2017
arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing
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 informationarxiv: v1 [math.at] 8 Jan 2015
HOMOLOGY GROUPS OF SIMPLICIAL COMPLEMENTS: A NEW PROOF OF HOCHSTER THEOREM arxiv:1501.01787v1 [math.at] 8 Jan 2015 JUN MA, FEIFEI FAN AND XIANGJUN WANG Abstract. In this paper, we consider homology groups
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationarxiv: v1 [math.ag] 14 Jun 2007
LINEAR PRECISION FOR PARAMETRIC PATCHES arxiv:76.26v [math.ag] 4 Jun 27 LUIS GARCIA-PUENTE AND FRANK SOTTILE Abstract. We study linear precision for multi-sided parametric patches of any dimension, showing
More informationClassification of Ehrhart quasi-polynomials of half-integral polygons
Classification of Ehrhart quasi-polynomials of half-integral polygons A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master
More informationFaithful tropicalization of hypertoric varieties
University of Oregon STAGS June 3, 2016 Setup Fix an algebraically closed field K, complete with respect to a non-archimedean valuation ν : K T := R { } (possibly trivial). Let X be a K-variety. An embedding
More informationCOMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS
COMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS JOSHUA LENERS Abstract. An algorithm is function from ω to ω defined by a finite set of instructions to transform a given input x to the desired output
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationPolytopes Course Notes
Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................
More informationarxiv: v4 [math.co] 30 Jun 2014
SMOOTH FANO POLYTOPES ARISING FROM FINITE DIRECTED GRAPHS arxiv:1103.2202v4 [math.co] 30 Jun 2014 AKIHIRO HIGASHITANI Abstract. In this paper, we consider terminal reflexive polytopes arising from finite
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationON CELLULAR RESOLUTION OF MONOMIAL IDEALS
ON CELLULAR RESOLUTION OF MONOMIAL IDEALS THE WORKSHOP ON COMPUTATIONAL DIFFERENTIAL ALGEBRA AND RELATED TOPICS SCHOOL OF MATHEMATICS, IPM JUNE 21-25, 2014 TEHRAN, IRAN RAHIM ZAARE-NAHANDI, UNIVERSITY
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
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 informationToric surface patches
Preprint updated: June 25 (2002) 1 29 1 Toric surface patches Rimvydas Krasauskas Faculty of Mathematics and Informatics, Vilnius University, Naugarduko 24, 2600 Vilnius, Lithuania We define a toric surface
More informationTADEUSZ JANUSZKIEWICZ AND MICHAEL JOSWIG
CONVEX GEOMETRY RELATED TO HAMILTONIAN GROUP ACTIONS TADEUSZ JANUSZKIEWICZ AND MICHAEL JOSWIG Abstract. Exercises and descriptions of student projects for a BMS/IMPAN block course. Berlin, November 27
More informationarxiv: v1 [math.co] 2 Apr 2007
An algorithm for the classification of smooth Fano polytopes Mikkel Øbro arxiv:0704.0049v1 [math.co] 2 Apr 2007 October 24, 2018 Abstract We present an algorithm that produces the classification list of
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationSome Geometrical Aspects of Control Points for Toric Patches
Some Geometrical Aspects of Control Points for Toric Patches Gheorghe Craciun 1, Luis David García-Puente 2, and Frank Sottile 3 1 Department of Mathematics and Department of Biomolecular Chemistry, University
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Convex Sets. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Convex Sets Instructor: Shaddin Dughmi Outline 1 Convex sets, Affine sets, and Cones 2 Examples of Convex Sets 3 Convexity-Preserving Operations
More informationUNIVERSITY OF CALIFORNIA, SAN DIEGO. Toric Degenerations of Calabi-Yau Manifolds in Grassmannians
UNIVERSITY OF CALIFORNIA, SAN DIEGO Toric Degenerations of Calabi-Yau Manifolds in Grassmannians A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationEndomorphisms and synchronization, 2: Graphs and transformation monoids
Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras Given a relational structure R, there are several similar ways to produce
More informationTopic: Orientation, Surfaces, and Euler characteristic
Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of
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 informationA result on flip-graph connectivity
Lionel Pournin 1 A result on flip-graph connectivity June 21, 2011 Abstract. A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
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 informationThe important function we will work with is the omega map ω, which we now describe.
20 MARGARET A. READDY 3. Lecture III: Hyperplane arrangements & zonotopes; Inequalities: a first look 3.1. Zonotopes. Recall that a zonotope Z can be described as the Minkowski sum of line segments: Z
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
More informationRegular polytopes with few flags
Regular polytopes with few flags Marston Conder University of Auckland mconder@aucklandacnz Introduction: Rotary and regular maps A map M is a 2-cell embedding of a connected graph or multigraph (graph
More informationLocally convex topological vector spaces
Chapter 4 Locally convex topological vector spaces 4.1 Definition by neighbourhoods Let us start this section by briefly recalling some basic properties of convex subsets of a vector space over K (where
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 4: Convex Sets. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 4: Convex Sets Instructor: Shaddin Dughmi Announcements New room: KAP 158 Today: Convex Sets Mostly from Boyd and Vandenberghe. Read all of
More informationarxiv: v1 [math.co] 27 Feb 2015
Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,
More informationarxiv: v1 [math.ag] 29 May 2008
Q-ACTORIAL GORENSTEIN TORIC ANO VARIETIES WITH LARGE PICARD NUMBER BENJAMIN NILL AND MIKKEL ØBRO arxiv:0805.4533v1 [math.ag] 9 May 008 Abstract. In dimension d, Q-factorial Gorenstein toric ano varieties
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 informationCS522: Advanced Algorithms
Lecture 1 CS5: Advanced Algorithms October 4, 004 Lecturer: Kamal Jain Notes: Chris Re 1.1 Plan for the week Figure 1.1: Plan for the week The underlined tools, weak duality theorem and complimentary slackness,
More informationLecture 3 Randomized Algorithms
Lecture 3 Randomized Algorithms Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology Randomized
More informationTriangulations Of Point Sets
Triangulations Of Point Sets Applications, Structures, Algorithms. Jesús A. De Loera Jörg Rambau Francisco Santos MSRI Summer school July 21 31, 2003 (Book under construction) Triangulations Of Point Sets
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 informationh-polynomials of triangulations of flow polytopes (Cornell University)
h-polynomials of triangulations of flow polytopes Karola Mészáros (Cornell University) h-polynomials of triangulations of flow polytopes (and of reduction trees) Karola Mészáros (Cornell University) Plan
More informationProperties of Cut Polytopes
Properties of Cut Polytopes Ankan Ganguly October 4, 2013 Abstract In this paper we begin by identifying some general properties shared by all cut polytopes which can be used to analyze the general cut
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationarxiv:math/ v2 [math.co] 25 Jul 2006
On a theorem of Brion Thomas Hüttemann arxiv:math/0607297v2 [math.co] 25 Jul 2006 University of Leicester, Department of Mathematics University Road, Leicester LE1 7RH, England (UK) e-mail: th68@mcs.le.ac.uk
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
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 informationarxiv: v2 [math.co] 27 Sep 2017
THE SLACK REALIZATION SPACE OF A POLYTOPE arxiv:1708.04739v2 [math.co] 27 Sep 2017 JOÃO GOUVEIA, ANTONIO MACCHIA, REKHA R. THOMAS, AND AMY WIEBE Abstract. In this paper we introduce a natural model for
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 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 informationarxiv: v1 [math.co] 28 Nov 2007
LATTICE OINTS IN MINKOWSKI SUMS CHRISTIAN HAASE, BENJAMIN NILL, ANDREAS AFFENHOLZ, AND FRANCISCO SANTOS arxiv:0711.4393v1 [math.co] 28 Nov 2007 ABSTRACT. Fakhruddin has proved that for two lattice polygons
More informationThe Newton polytope of implicit curves. Ioannis Z. Emiris National University of Athens, Greece
The Newton polytope of implicit curves Ioannis Z. Emiris National University of Athens, Greece Joint work with: Christos Konaxis (Athens) and Leonidas Palios (Ioannina) Oberwolfach Nov 07 Outline 03. Toric
More informationQ-Gorenstein deformation families of Fano varieties or The combinatorics of Mirror Symmetry. Alexander Kasprzyk
Q-Gorenstein deformation families of Fano varieties or The combinatorics of Mirror Symmetry Alexander Kasprzyk Fano manifolds Smooth varieties, called manifolds, come with a natural notion of curvature,
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationA PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES
PACIFIC JOURNAL OF MATHEMATICS Vol. 46, No. 2, 1973 A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES DAVID BARNETTE A d polytope is defined to be a cz-dimensional set that is the convex hull
More informationDistributive Lattices from Graphs
Distributive Lattices from Graphs VI Jornadas de Matemática Discreta y Algorítmica Universitat de Lleida 21-23 de julio de 2008 Stefan Felsner y Kolja Knauer Technische Universität Berlin felsner@math.tu-berlin.de
More informationLinear Precision for Parametric Patches
Department of Mathematics Texas A&M University March 30, 2007 / Texas A&M University Algebraic Geometry and Geometric modeling Geometric modeling uses polynomials to build computer models for industrial
More informationThe Cyclic Cycle Complex of a Surface
The Cyclic Cycle Complex of a Surface Allen Hatcher A recent paper [BBM] by Bestvina, Bux, and Margalit contains a construction of a cell complex that gives a combinatorial model for the collection of
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 informationCyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University
Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck & Serkan Hoşten San Francisco State University math.sfsu.edu/beck Math Research Letters Growth Series of Lattices L R d lattice
More informationVertex-Maximal Lattice Polytopes Contained in 2-Simplices
Vertex-Maximal Lattice Polytopes Contained in 2-Simplices Christoph Pegel Institut für Algebra, Zahlentheorie und Diskrete Mathematik Leibniz Universität Hannover November 14, 2018 joint with Jan Philipp
More informationConvexity: an introduction
Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationarxiv: v1 [math.co] 18 Jan 2013
arxiv:1301.4459v1 [math.co] 18 Jan 2013 Composition of simplicial complexes, polytopes and multigraded Betti numbers Ayzenberg Anton Abstract. For a simplicial complex K on m vertices and simplicial complexes
More information6c Lecture 3 & 4: April 8 & 10, 2014
6c Lecture 3 & 4: April 8 & 10, 2014 3.1 Graphs and trees We begin by recalling some basic definitions from graph theory. Definition 3.1. A (undirected, simple) graph consists of a set of vertices V and
More informationN-flips in 3-dimensional Small Cove Transformation Groups and Combinato. 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39:
Title N-flips in 3-dimensional Small Cove Transformation Groups and Combinato Author(s) NISHIMURA, Yasuzo Citation 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39: 137-148 Issue Date 2013-04 URL http://hdl.handle.net/2433/207819
More informationarxiv: v1 [math.co] 7 Dec 2018
SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential
More informationToric surface patches
Advances in Computational Mathematics 17: 89 113, 2002. 2002 Kluwer Academic Publishers. Printed in the Netherlands. Toric surface patches Rimvydas Krasauskas Faculty of Mathematics and Informatics, Vilnius
More informationNon-trivial Torus Equivariant Vector bundles of Rank Three on P
Non-trivial Torus Equivariant Vector bundles of Rank Three on P Abstract Let T be a two dimensional algebraic torus over an algebraically closed field. Then P has a non trivial action of T and becomes
More informationC&O 355 Lecture 16. N. Harvey
C&O 355 Lecture 16 N. Harvey Topics Review of Fourier-Motzkin Elimination Linear Transformations of Polyhedra Convex Combinations Convex Hulls Polytopes & Convex Hulls Fourier-Motzkin Elimination Joseph
More informationEquipartite polytopes and graphs
Equipartite polytopes and graphs Branko Grünbaum Tomáš Kaiser Daniel Král Moshe Rosenfeld Abstract A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V 1
More information