Fano varieties and polytopes

Size: px
Start display at page:

Download "Fano varieties and polytopes"

Transcription

1 Fano varieties and polytopes Olivier DEBARRE The Fano Conference Torino, September 29 October 5, 2002

2 Smooth Fano varieties A smooth Fano variety (over a fixed algebraically closed field k) is a smooth projective variety whose anticanonical divisor is ample Examples (1) A Fano curve is P 1 (2) Smooth Fano (del Pezzo) surfaces are P 1 P 1 and the blow-up of P 2 in at most 8 points, with no three colinear (3) Smooth Fano threefolds have been classified in characteristic zero (4) A finite product of Fano varieties is a Fano variety (5) A smooth complete intersection in P n+s defined by equations of degrees d 1 d s > 1 is a Fano variety if and only if d d s n + s In any given dimension n, there are only finitely many choices for the degrees (because s (d i 1) n)

3 (6) A cyclic covering X P n of degree d > 1 branched along a smooth hypersurface of degree de is a Fano variety if and only if (d 1)e n (again, there are only finitely many choices for d and e when n is fixed) (7) In characteristic zero, a projective variety acted on transitively by a connected linear algebraic group (such as a flag variety) is a smooth Fano variety (8) If X is a smooth (Fano) variety and D 1,, D r are nef divisors on X such that K X D 1 D r is ample, the (Grothendieck) projective bundle P( r i=1 O X (D i )) is a Fano variety

4 Toric varieties The algebraic torus of dimension n over k is T n = Spec(k[U 1, U1 1,, U n, Un 1 ]) A toric variety is an algebraic variety defined over k with an action of T n and a dense open orbit isomorphic to T n They can all be constructed from very explicit combinatorial data Affine toric varieties 1) Given a pair of dual lattices M Z n M R = M Z R N = Hom Z (M, Z) N R = N Z R 2) a cone σ in N R generated by a finite number of vectors in N and containing no lines, such as 0 τ σ

5 3) and the dual cone σ = {u M R u, v 0 for all v σ} 0 σ τ the semigroup σ M is finitely generated (by the dots) 4) Define an affine variety by X σ = Spec(k[σ M]) In our example, X σ = Spec(k[U, UV, UV 2 ]) Spec(k[X, Y, Z]/(XZ Y 2 ))

6 5) If τ is a face of σ, σ M τ M The corresponding map X τ X σ makes X τ into a principal open subset of X σ (If u M is such that τ = σ u, X τ = (X σ ) u ) In our example, X τ = Spec(k[U, U 1, V ]) = (X σ ) U X {0} = Spec(k[U, U 1, V, V 1 ]) = (X σ ) UV 6) The torus T n acts on X σ and X τ and the inclusion X τ X σ is equivariant General toric varieties A fan is a finite set of cones in N R as above such that: every face of a cone in is in ; the intersection of any two cones in is in Construct an irreducible n-dimensional k-scheme X with an action of T n by gluing the affine

7 varieties X σ and X σ along the open set X σ σ, for all σ and σ in The scheme X is irreducible, separated and normal Each X σ, hence also X, contains the open set X {0} = T n All toric varieties are obtained via this construction Example The toric surface associated with the fan that consists of σ 1, σ 2, σ 3 and their faces: σ 3 0 σ 2 σ 1 (a, 1) is the projective cone in P a+1 over the rational normal curve in P a For a = 1, this is P 2

8 Projectivity criterion is the set of cones spanned by the faces of a polytope Q with vertices in N and the origin in its interior X (or X Q ) projective Given a polytope Q, we denote by V (Q) the set of its vertices

9 Smooth toric Fano varieties Let Q be a polytope in N R Each facet of Q is the convex hull of a basis of N X Q smooth Fano In this case, the anticanonical divisor K XQ is very ample We call such a polytope a smooth Fano polytope Its only integral interior point is the origin Its dual P = {u M R u, v 1 for all v Q} is a polytope with vertices in M It is usually not a Fano polytope, although its only integral interior point is the origin We have Pic(X Q ) Z #V (Q) n h 0 (X, K X ) = #(M P ) ( K X ) n = n! vol(p )

10 Examples (1) There is only 1 smooth Fano polytope in R, the interval S 1 = [ 1, 1] (2) Up to the action of GL(2, Z), there are only 5 smooth Fano polytopes in R 2 : 0 0 S 2 P 1 P 1 P A 2 0 B 2 P 2 blown up P 2 blown up P 2 blown up at a point at 2 points at 3 points The dual polytopes are and the formulas above are easily checked in these cases

11 (3) The product of smooth Fano polytopes Q and Q is a smooth Fano polytope and X Q Q = X Q X Q (4) Let (e 1,, e n ) be a basis for N and set e 0 = e 1 e n The simplex S n = Conv({e 0, e 1,, e n }) is a smooth Fano polytope When n is even, A n = Conv({e 0, ±e 1,, ±e n }) B n = Conv({±e 0, ±e 1,, ±e n }) are smooth Fano polytopes When n = 2m + 1, the n + 1 vertices e 0, e 1, e 2,, e 2m+1 are on the same facet x 1 + x 2 x 3 + x 2m+1 = 1 One has X Sn P n, whereas X A2m and X B2m are obtained from P 2m by a series of blow ups (bu) and blow downs (bd), such as

12 P 1 P 2m 2 P 2 P 2m 3 P m 1 P m bu fixed points Y 1 bu inv P 1 bd exc div X 1 P 2m Y 2 P 2 bu inv bd exc div Y m 1 bu inv P m 1 bd exc div X 2 X 3 X m 1 X A2m = X m The following result, which improves on an earlier result of Ewald, is one of the few classification results that are valid in all dimensions Theorem (Casagrande) Any smooth Fano polytope in N R with a set of vertices symmetric about the origin that spans N R is isomorphic to a product of S 1, A 2r and B 2s

13 Kähler Einstein metrics Compact complex manifolds with a positive Kähler Einstein metric (ie, whose Ricci form is a positive (constant) multiple of the Kähler form) are Fano varieties, but it is a difficult problem to find conditions on a complex Fano manifold so that a Kähler Einstein metric exists However, there is a criterion for toric Fano manifolds (Tian, Batyrev & Selivanova): if Q N R is a smooth Fano polytope and the only point of N fixed by the finite group G Q = {g GL(N) g(q) = Q} is the origin, the Fano variety X Q has a Kähler Einstein metric This condition implies that the barycenter of Q (resp of Q ) is the origin We have the following implications: The only point of N fixed by G Q is the origin X Q has a KE metric Aut(X Q ) reductive and the Futaki character Lie(Aut(X Q )) C vanishes The set of points of M in the relative interiors of facets of Q is symmetric about the origin and the barycenter of Q is the origin

14 Examples (1) In dimension two, the answer to the question does X Q have a Kähler Einstein metric? is: Q S 2 A 2 B 2 Q YES YES NO NO YES The polytopes S n and B n all satisfy the Batyrev Selivanova criterion Using the criterion above, one checks that the automorphism group of X A2m is not reductive (2) Fix positive integers a 1,, a m, r 1,, r m with a i r i The projective bundle X = P(O(a 1, 0,, 0) O(0,, a m )) over P r 1 P r m is a smooth Fano variety (this is a particular case of Example (8)) whose automorphism group is reductive (by direct computation) It is the toric variety associated with the smooth Fano polytope Q with

15 vertices: g 1,, g m with g g m = 0 e i1,, e iri, a i g i (e i1 + + e iri ) for i = 1,, m If all the r i are equal and all the a i are equal, it satisfies the Batyrev Selivanova criterion, hence X has a Kähler-Einstein metric The barycenter of Q is the origin if and only if the integrals g 1,,g m 1 g 1,,g m =0 m g i j=1 (r j + 1 a j g j ) r j dµ all vanish for 1 i m I have checked that for r 1,, r m 10, they do only when all the r i are equal and all the a i are equal

16 Number of vertices Let Q N R be a smooth Fano polytope with dual P There is a oneto-one correspondence { vertices of P (resp Q) } { facets of Q (resp P ) u F u } For any u V (P ) and v V (Q), we have u, v Z, u, v 1 with equality if and only if v F u Theorem (Voskresenskĭı, Klyachko) A smooth Fano polytope of dimension n has most 2n 2 vertices Proof Let Q be a smooth Fano polytope, with dual P The origin is in the interior of P, hence in the interior of the convex hull of at most 2n vertices by Steinitz s theorem: we have 0 = λ 1 u λ d u d λ 1,, λ d > 0 where the vertices u 1,, u d of P generate M R and n < d 2n

17 Let v be a vertex of Q We have u i, v = 0 for at least one i, hence u i, v > 0 for at least one i This implies v F ui, hence the vertices of Q are all on F u1 F ud Since each facet has n vertices, Q has at most nd 2n 2 vertices Batyrev conjectures that a smooth Fano polytope of dimension n has at most 3n 3n 1 if n is even if n is odd vertices This holds for n 5 (Batyrev, Casagrande) There is equality for n even for A n/2 2 and for n odd for A (n 1)/2 2 S 1 The (asymptotically) best known bound is #V (Q) n n 3 (n 2 1)(2n 1) Corollary Up to the action of GL(n, Z), there are only finitely many smooth Fano polytopes in R n

18 Proof The number of vertices of such a polytope Q is at most 2n 2 Since each facet of Q has n vertices, their number is at most ( 2n 2 ), n ( 2n 2) n hence the volume of Q is at most n! 1 Fix the vertices e 1,, e n of a facet of Q and set S = Conv({0, e 1,, e n }) For any vertex v = v 1 e v n e n of Q, the volume of Conv(v, S) is at most n! 1 ( 2n 2) n, hence v i ( 2n 2 ) n The integral vector v may therefore take only finitely many values

19 Volume of the dual polytope Let Q be a smooth Fano polytope The integer ( K XQ ) n = n! vol(q ) is often called the degree of the smooth Fano variety X Q Theorem Let Q be a smooth Fano polytope of dimension n with ρ + n vertices, ρ > 1 We have ( (n 1) ρ+1 ) n 1 n ρn vol(q ) n 2 Equivalently, a smooth toric Fano variety X of dimension n and Picard number ρ 2 satisfies ( K X ) n n!n ρn (1) Remarks (1) When ρ = 1, we have X P n, hence ( K X ) n = (n + 1) n When ρ = 2, we have by classification ( K X ) n n 2n

20 For any integers ρ 2 and n 4 such that n log n 2ρ 2, there are examples of smooth toric Fano varieties X of dimension n and Picard number ρ with ( K X ) n ( n ρ 2 ρ2 1 (log n) ρ 1 so the bound (1) is not too far off (2) The pseudo-index ι X = ) n min ( K X C) C X rational curve of X can be computed in a purely combinatorial way from Q One can get the more precise bound (for ρ > 1) vol(q ) ( n(n + 1 ι X ) ρ 1) n (3) If X Q is a compact complex manifold of dimension n with a positive Kähler-Einstein metric, methods from differential geometry give vol(q ) (2n 1) n 2n+1 n! (2n)! 2(2e) n 1/2 (4) Taking a 1 = r 1 and a 2 = = a m = r 2 = = r m = 1 in Example (2) above, one gets

21 a smooth toric Fano variety X of dimension n = r 1 + 2m 2 and Picard number m + 1 with reductive automorphism group and Taking m = [ ( K X ) n m n r r 1 n 2 log n 1 ], we get ( KX ) n ( an 2 log n for some positive constant a In particular, X does not have a Kähler-Einstein metric (5) Ewald conjectures that given a smooth Fano polytope Q, there is a basis of N in which the vertices of Q have all their coordinates in {0, ±1} It holds for all the examples presented here Let (e 1,, e n ) be such a basis, let u be a vertex of Q, and let v 1,, v n be the vertices of the face F u of Q Write ) n v i = j α ij e j, α ij {0, ±1}, det(α ij ) = ±1 The coordinates u, e 1,, u, e n of u, solutions of the linear system 1 = u, v i = n j=1 α ij u, e j i = 1,, n

22 are n n determinants whose entries are in {0, ±1} By Hadamard s inequality, their absolute value is bounded by n n/2, hence vol(q ) 2 n n n2 /2

23 The theorem on the volume of the dual of a smooth Fano polytope is a consequence of the following two lemmas Lemma Let P be a polytope in R n whose only integral interior point is the origin Let b be such that for each vertex u of P and each vertex v of P, we have b u, v 1 Then vol(p ) (b + 1) n Proof The hypothesis implies 1 b P P Assume vol(p ) > (b + 1) n and set P = 1 ε b + 1 P We have vol(p ) > 1 for ε positive small enough hence, by a theorem of Blichfeldt, P contains distinct points p and p such that p p Z n Since P is convex and 1 b P P, the point p p b + 1 = p + b ( 1 b p ) b + 1 is in P, hence p p is in (b + 1)P, which is contained in the interior of P This contradicts the fact that the origin is the only integral interior point of P

24 Lemma Let Q be a smooth Fano polytope of dimension n with ρ + n vertices, ρ > 1 For each vertex u of Q and each vertex v of Q, we have n 1 n 2 ((n 1)ρ 1) u, v 1

25 Singular Fano varieties In many cases, such as in the Minimal Model Program, it is necessary to allow some kind of singularities for Fano varieties We assume the characteristic of k is 0 Let X be a normal variety such that K X is a Q-Cartier divisor For any desingularization f : Y X, write K Y f K X + i a i E i where the E i are f-exceptional divisors, a i Q, and denotes numerical equivalence The discrepancy of X is the minimum of the a i for all possible desingularizations f It can be computed from any desingularization f whose exceptional locus is a divisor with normal crossings by the formula discr(x) = min(1, a i ) if all a i are 1 otherwise It is therefore either or a rational number in [ 1, 1], and is 1 if X is smooth We

26 say that X has log terminal singularities if discr(x) > 1 Definition A Fano variety X is a normal projective variety with log terminal singularities such that K X is an ample Q-Cartier divisor Example Let Y be a projectively normal smooth subvariety of P n, with hyperplane divisor H, such that K Y qh for some rational number q (eg, Y a smooth curve) Set π : X = P(O Y O Y (H)) Y and let Y 0 be the section such that Y 0 Y0 H The cone X in P n+1 over Y is normal; it is the contraction f : X X of Y 0, and hence K X 2Y 0 + π (K Y H) 2Y 0 + π ((q 1)H) K X (q 1)H (These two Weil divisors coincide outside of the vertex of X) and K X ample q < 1

27 Writing K X f K X + ay 0, restricting to Y 0 yields a = 1 q, hence X has log terminal singularities q < 0 It follows that X is a Fano variety if and only if Y is a Fano variety

28 Toric Fano varieties We have Vertices of Q are primitive in N X Q Fano Moreover, if P = Q and if, for each vertex u of P, we let σ u be the cone in N R generated by the facet F u of Q, we have discr(x Q ) = 1 + min u V (P ) v σ u N V (Q) {0} u, v 0 F u u, =1 σ u The polytope P has rational vertices and Vertices of mp are in M mk X Cartier

29 In particular, X is a Gorenstein variety if and only if P has integral vertices (a polytope Q with this property is called reflexive; its dual has the same property)

30 Example The projective cone in P a+1 over the rational normal curve in P a is the toric surface associated with the polytope with dual 0 F v u σ u ( 1,a+1) 0 u=( 2 a, 1) (a, 1) It is a Fano surface (this is a particular case of the example above, with q = 2/a) We recover discr(x) = 1 + u, v = a

31 Also, the smallest positive integer m such that mk X is a Cartier divisor is a if a is odd, a/2 otherwise This shows that there are, in each dimension at least 2, infinitely many isomorphism classes of toric Fano varieties However, by bounding the discrepancy away from 1, we get finitely many isomorphism types: since the vertices of a Fano polytope are primitive, we have for any r > 0 discr(x Q ) r u, v 1 r for all v σ u N This implies Int(Q) rn = {0} Corollary Given positive integers n and r, there are only finitely many isomorphism types of toric Fano varieties of dimension n and discrepancy r defined over k

32 This is due to Borisov & Borisov (1993), who appear to have been unaware of an earlier article of Hensley (1983), which gives the finiteness of the number of isomorphism classes of polytopes Q R n such that Int(Q) rz n = {0} under the action of GL(Z n ) It also provides explicit (large) bounds in terms of n and r for the smallest integer m such that mk X is Cartier and for the degree ( K X ) n It is conjectured that for each positive integer n and r, there are only finitely many deformation types of Fano varieties of dimension n with discrepancy 1 + 1/r The point is to bound ( K X ) n and an integer m such that mk X is a Cartier divisor M c Kernan claims in the preprint Boundedness of log terminal Fano pairs of bounded index (mathag/ ) that given integers n and m, there are only finitely many deformation types of complex Fano varieties X of dimension n such that mk X is a Cartier divisor

Classification of smooth Fano polytopes

Classification 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 information

arxiv: v1 [math.ag] 29 May 2008

arxiv: 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 information

arxiv: v4 [math.co] 30 Jun 2014

arxiv: 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 information

arxiv: v1 [math.co] 24 Aug 2009

arxiv: 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 information

TORIC VARIETIES JOAQUÍN MORAGA

TORIC 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 information

Q-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 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 information

arxiv: v1 [math.co] 2 Apr 2007

arxiv: 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 information

Smooth Fano Polytopes Arising from Finite Partially Ordered Sets

Smooth Fano Polytopes Arising from Finite Partially Ordered Sets Discrete Comput Geom (2011) 45: 449 461 DOI 10.1007/s00454-010-9271-2 Smooth Fano Polytopes Arising from Finite Partially Ordered Sets Takayuki Hibi Akihiro Higashitani Received: 29 August 2009 / Revised:

More information

CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais

CREPANT 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 information

Toric Varieties and Lattice Polytopes

Toric Varieties and Lattice Polytopes Toric Varieties and Lattice Polytopes Ursula Whitcher April 1, 006 1 Introduction We will show how to construct spaces called toric varieties from lattice polytopes. Toric fibrations correspond to slices

More information

Smooth Fano Polytopes with Many Vertices

Smooth Fano Polytopes with Many Vertices Discrete Comput Geom (2014) 52:153 194 DOI 10.1007/s00454-014-9607-4 Smooth Fano Polytopes with Many Vertices Benjamin Assarf Michael Joswig Andreas Paffenholz Received: 16 November 2012 / Revised: 11

More information

RATIONAL CURVES ON SMOOTH CUBIC HYPERSURFACES. Contents 1. Introduction 1 2. The proof of Theorem References 9

RATIONAL CURVES ON SMOOTH CUBIC HYPERSURFACES. Contents 1. Introduction 1 2. The proof of Theorem References 9 RATIONAL CURVES ON SMOOTH CUBIC HYPERSURFACES IZZET COSKUN AND JASON STARR Abstract. We prove that the space of rational curves of a fixed degree on any smooth cubic hypersurface of dimension at least

More information

arxiv: v2 [math.ag] 3 Dec 2017

arxiv: v2 [math.ag] 3 Dec 2017 THE STRINGY EULER NUMBER OF CALABI-YAU HYPERSURFACES IN TORIC VARIETIES AND THE MAVLYUTOV DUALITY VICTOR BATYREV Dedicated to Yuri Ivanovich Manin on the occasion of his 80-th birthday arxiv:1707.02602v2

More information

Wedge operation and torus symmetries

Wedge operation and torus symmetries Wedge operation and torus symmetries Suyoung Choi (Ajou Univ.) schoi@ajou.ac.kr (jointly with Hanchul Park (Ajou Univ.)) June 27th 2013 Joint International Meeting of the AMS and the Romanian Mathematical

More information

Mirror Symmetry Through Reflexive Polytopes

Mirror Symmetry Through Reflexive Polytopes Mirror Symmetry Through Reflexive Polytopes Physical and Mathematical Dualities Ursula Whitcher Harvey Mudd College April 2010 Outline String Theory and Mirror Symmetry Some Complex Geometry Reflexive

More information

1. Complex Projective Surfaces

1. Complex Projective Surfaces 1. Complex Projective Surfaces 1.1 Notation and preliminaries In this section we fix some notations and some basic results (we do not prove: good references are [Bea78] and [BPV84]) we will use in these

More information

Polytopes, Polynomials, and String Theory

Polytopes, Polynomials, and String Theory Polytopes, Polynomials, and String Theory Ursula Whitcher ursula@math.hmc.edu Harvey Mudd College August 2010 Outline The Group String Theory and Mathematics Polytopes, Fans, and Toric Varieties The Group

More information

Non-trivial Torus Equivariant Vector bundles of Rank Three on P

Non-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 information

Institutionen för matematik, KTH.

Institutionen för matematik, KTH. Institutionen för matematik, KTH. Chapter 11 Construction of toric varieties 11.1 Recap example Example 11.1.1. Consider the Segre embedding seg : P 1 P 1 P 3 given by ((x 0, x 1 ), (y 0, y 1 )) (x 0

More information

Automorphism Groups of Cyclic Polytopes

Automorphism 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 information

Rationality constructions for cubic hypersurfaces

Rationality constructions for cubic hypersurfaces Rationality constructions for cubic hypersurfaces ICERM workshop Birational Geometry and Arithmetic Brendan Hassett Brown University May 14, 2018 Goals for this talk Our focus is smooth cubic fourfolds

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASSES 49 AND 50

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASSES 49 AND 50 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASSES 49 AND 50 RAVI VAKIL CONTENTS 1. Blowing up a scheme along a closed subscheme 1 2. Motivational example 2 3. Blowing up, by universal property 3 4. The blow-up

More information

THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE

THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE DUKE-CGTP-04-07 THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE CHRISTIAN HAASE AND ILARION V. MELNIKOV Abstract. The reflexive dimension refldim(p ) of a lattice polytope P is the minimal d so that P is

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The 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 information

arxiv: v1 [math.co] 12 Dec 2017

arxiv: 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 information

Symmetric products of varieties

Symmetric products of varieties Mathematisch Instituut Universiteit Leiden 14-02-2011 / Topics in Arithmetic Geometry Outline About the Previous Talk 1 About the Previous Talk 2 3 Outline About the Previous Talk 1 About the Previous

More information

Lecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh

Lecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming

More information

Lattice points in Minkowski sums

Lattice points in Minkowski sums Lattice points in Minkowski sums Christian Haase, Benjamin Nill, Andreas affenholz Institut für Mathematik, Arnimallee 3, 14195 Berlin, Germany {christian.haase,nill,paffenholz}@math.fu-berlin.de Francisco

More information

Institutionen för matematik, KTH.

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 information

PERIODS OF ALGEBRAIC VARIETIES

PERIODS OF ALGEBRAIC VARIETIES PERIODS OF ALGEBRAIC VARIETIES OLIVIER DEBARRE Abstract. The periods of a compact complex algebraic manifold X are the integrals of its holomorphic 1-forms over paths. These integrals are in general not

More information

arxiv: v1 [math.co] 28 Nov 2007

arxiv: 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 information

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 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 information

arxiv: v1 [math.co] 12 Aug 2018

arxiv: 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 information

Lecture notes for Topology MMA100

Lecture notes for Topology MMA100 Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine

More information

Combinatorial constructions of hyperbolic and Einstein four-manifolds

Combinatorial constructions of hyperbolic and Einstein four-manifolds Combinatorial constructions of hyperbolic and Einstein four-manifolds Bruno Martelli (joint with Alexander Kolpakov) February 28, 2014 Bruno Martelli Constructions of hyperbolic four-manifolds February

More information

Lecture 0: Reivew of some basic material

Lecture 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 information

Noncrossing sets and a Graßmann associahedron

Noncrossing 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 information

GENERALIZED CPR-GRAPHS AND APPLICATIONS

GENERALIZED CPR-GRAPHS AND APPLICATIONS Volume 5, Number 2, Pages 76 105 ISSN 1715-0868 GENERALIZED CPR-GRAPHS AND APPLICATIONS DANIEL PELLICER AND ASIA IVIĆ WEISS Abstract. We give conditions for oriented labeled graphs that must be satisfied

More information

UNIVERSITY 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 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 information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Lecture 2 - Introduction to Polytopes

Lecture 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 information

Weierstrass models of elliptic toric. K3 hypersurfaces and symplectic cuts

Weierstrass models of elliptic toric. K3 hypersurfaces and symplectic cuts Weierstrass models of elliptic toric arxiv:1201.0930v3 [math.ag] 10 Jul 2012 K3 hypersurfaces and symplectic cuts Antonella Grassi and Vittorio Perduca Department of Mathematics, University of Pennsylvania

More information

COMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)

COMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2) COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron

More information

Faithful tropicalization of hypertoric varieties

Faithful 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 information

A barrier on convex cones with parameter equal to the dimension

A barrier on convex cones with parameter equal to the dimension A barrier on convex cones with parameter equal to the dimension Université Grenoble 1 / CNRS August 23 / ISMP 2012, Berlin Outline 1 Universal barrier 2 Projective images of barriers Pseudo-metric on the

More information

COMPUTING SESHADRI CONSTANTS ON SMOOTH TORIC SURFACES

COMPUTING SESHADRI CONSTANTS ON SMOOTH TORIC SURFACES COMPUTING SESHADRI CONSTANTS ON SMOOTH TORIC SURFACES ANDERS LUNDMAN Abstract. In this paper we compute the Seshadri constants at the general point on many smooth polarized toric surfaces. We consider

More information

Toric Cohomological Rigidity of Simple Convex Polytopes

Toric 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 information

Combinatorial Geometry & Topology arising in Game Theory and Optimization

Combinatorial 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 information

TROPICAL CONVEXITY MIKE DEVELIN AND BERND STURMFELS

TROPICAL CONVEXITY MIKE DEVELIN AND BERND STURMFELS TROPICAL CONVEXITY MIKE DEVELIN AND BERND STURMFELS Abstract. The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

Optimality certificates for convex minimization and Helly numbers

Optimality 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 information

Elementary Combinatorial Topology

Elementary Combinatorial Topology Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr

More information

A COINCIDENCE BETWEEN GENUS 1 CURVES AND CANONICAL CURVES OF LOW DEGREE

A COINCIDENCE BETWEEN GENUS 1 CURVES AND CANONICAL CURVES OF LOW DEGREE A COINCIDENCE BETWEEN GENUS 1 CURVES AND CANONICAL CURVES OF LOW DEGREE AARON LANDESMAN 1. A COINCIDENCE IN DEGREES 3, 4, AND 5 Describing equations for the low degree canonical embeddings are a very classical

More information

Optimality certificates for convex minimization and Helly numbers

Optimality 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 information

arxiv:math/ v2 [math.ag] 18 Mar 2003

arxiv:math/ v2 [math.ag] 18 Mar 2003 AFFINE MANIFOLDS, LOG STRUCTURES, AND MIRROR SYMMETRY arxiv:math/0211094v2 [math.ag] 18 Mar 2003 MARK GROSS, BERND SIEBERT Introduction. Mirror symmetry between Calabi-Yau manifolds is inherently about

More information

Classification of Ehrhart quasi-polynomials of half-integral polygons

Classification 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 information

THE ENUMERATIVE GEOMETRY OF DEL PEZZO SURFACES VIA DEGENERATIONS

THE ENUMERATIVE GEOMETRY OF DEL PEZZO SURFACES VIA DEGENERATIONS THE ENUMERATIVE GEOMETRY OF DEL PEZZO SURFACES VIA DEGENERATIONS IZZET COSKUN Abstract. This paper investigates low-codimension degenerations of Del Pezzo surfaces. As an application we determine certain

More information

3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs

3. 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 information

arxiv: v1 [math.gt] 28 Feb 2009

arxiv: v1 [math.gt] 28 Feb 2009 Coverings and Minimal Triangulations of 3 Manifolds William Jaco, Hyam Rubinstein and Stephan Tillmann arxiv:0903.0112v1 [math.gt] 28 Feb 2009 Abstract This paper uses results on the classification of

More information

Convex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015

Convex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015 Convex Optimization - Chapter 1-2 Xiangru Lian August 28, 2015 1 Mathematical optimization minimize f 0 (x) s.t. f j (x) 0, j=1,,m, (1) x S x. (x 1,,x n ). optimization variable. f 0. R n R. objective

More information

Convex Geometry arising in Optimization

Convex 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 information

CONVEX GEOMETRY OF COXETER-INVARIANT POLYHEDRA

CONVEX GEOMETRY OF COXETER-INVARIANT POLYHEDRA CONVEX GEOMETRY OF COXETER-INVARIANT POLYHEDRA NICHOLAS MCCARTHY, DAVID OGILVIE, NAHUM ZOBIN, AND VERONICA ZOBIN Abstract. We study the facial structure of convex polyhedra invariant under the natural

More information

Linear Programming in Small Dimensions

Linear Programming in Small Dimensions Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional

More information

Orientation of manifolds - definition*

Orientation of manifolds - definition* Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold

More information

Braid groups and Curvature Talk 2: The Pieces

Braid groups and Curvature Talk 2: The Pieces Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with

More information

Lower bounds on the barrier parameter of convex cones

Lower bounds on the barrier parameter of convex cones of convex cones Université Grenoble 1 / CNRS June 20, 2012 / High Performance Optimization 2012, Delft Outline Logarithmically homogeneous barriers 1 Logarithmically homogeneous barriers Conic optimization

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL 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 information

N-flips in 3-dimensional Small Cove Transformation Groups and Combinato. 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39:

N-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 information

FACES OF CONVEX SETS

FACES 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 information

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

However, 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 information

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Mathematical and Algorithmic Foundations Linear Programming and Matchings Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information

Triangulations Of Point Sets

Triangulations 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 information

Introduction to Coxeter Groups

Introduction to Coxeter Groups OSU April 25, 2011 http://www.math.ohio-state.edu/ mdavis/ 1 Geometric reflection groups Some history Properties 2 Some history Properties Dihedral groups A dihedral gp is any gp which is generated by

More information

From affine manifolds to complex manifolds: instanton corrections from tropical disks

From affine manifolds to complex manifolds: instanton corrections from tropical disks UCSD Mathematics Department From affine manifolds to complex manifolds: instanton corrections from tropical disks Mark Gross Directory Table of Contents Begin Article Copyright c 2008 mgross@math.ucsd.edu

More information

Reflection groups 4. Mike Davis. May 19, Sao Paulo

Reflection groups 4. Mike Davis. May 19, Sao Paulo Reflection groups 4 Mike Davis Sao Paulo May 19, 2014 https://people.math.osu.edu/davis.12/slides.html 1 2 Exotic fundamental gps Nonsmoothable aspherical manifolds 3 Let (W, S) be a Coxeter system. S

More information

Generating Functions for Hyperbolic Plane Tessellations

Generating Functions for Hyperbolic Plane Tessellations Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in

More information

A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma

A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2005 A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma Timothy Prescott

More information

arxiv:math/ v1 [math.ag] 14 Jul 2004

arxiv:math/ v1 [math.ag] 14 Jul 2004 arxiv:math/0407255v1 [math.ag] 14 Jul 2004 Degenerations of Del Pezzo Surfaces and Gromov-Witten Invariants of the Hilbert Scheme of Conics Izzet Coskun January 13, 2004 Abstract: This paper investigates

More information

Polytopes Course Notes

Polytopes 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 information

Applied Integer Programming

Applied Integer Programming Applied Integer Programming D.S. Chen; R.G. Batson; Y. Dang Fahimeh 8.2 8.7 April 21, 2015 Context 8.2. Convex sets 8.3. Describing a bounded polyhedron 8.4. Describing unbounded polyhedron 8.5. Faces,

More information

4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function

More information

Torus Actions and Complex Cobordism

Torus Actions and Complex Cobordism Torus Actions and Complex Cobordism Taras Panov Moscow State University joint with Victor Buchstaber and Nigel Ray Новосибирск, Математический Институт им. С. Л. Соболева СО РАН Thm 1. Every complex cobordism

More information

MA4254: 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: 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 information

Interval-Vector Polytopes

Interval-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 information

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational

More information

Open problems in convex geometry

Open problems in convex geometry Open problems in convex geometry 10 March 2017, Monash University Seminar talk Vera Roshchina, RMIT University Based on joint work with Tian Sang (RMIT University), Levent Tunçel (University of Waterloo)

More information

Geometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1.

Geometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1. Discrete Comput Geom 18:455 462 (1997) Discrete & Computational Geometry 1997 Springer-Verlag New York Inc. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope

More information

ORIE 6300 Mathematical Programming I September 2, Lecture 3

ORIE 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 information

Lecture 1 Discrete Geometric Structures

Lecture 1 Discrete Geometric Structures Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology

More information

The Convex Hull of a Space Curve. Bernd Sturmfels, UC Berkeley (two papers with Kristian Ranestad)

The Convex Hull of a Space Curve. Bernd Sturmfels, UC Berkeley (two papers with Kristian Ranestad) The Convex Hull of a Space Curve Bernd Sturmfels, UC Berkeley (two papers with Kristian Ranestad) Convex Hull of a Trigonometric Curve { (cos(θ), sin(2θ), cos(3θ) ) R 3 : θ [0, 2π] } = { (x, y, z) R 3

More information

Math 5593 Linear Programming Lecture Notes

Math 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 information

Open problems in convex optimisation

Open problems in convex optimisation Open problems in convex optimisation 26 30 June 2017 AMSI Optimise Vera Roshchina RMIT University and Federation University Australia Perceptron algorithm and its complexity Find an x R n such that a T

More information

On the classification of real algebraic curves and surfaces

On the classification of real algebraic curves and surfaces On the classification of real algebraic curves and surfaces Ragni Piene Centre of Mathematics for Applications and Department of Mathematics, University of Oslo COMPASS, Kefermarkt, October 2, 2003 1 Background

More information

On the Graph Connectivity of Skeleta of Convex Polytopes

On the Graph Connectivity of Skeleta of Convex Polytopes Discrete Comput Geom (2009) 42: 155 165 DOI 10.1007/s00454-009-9181-3 On the Graph Connectivity of Skeleta of Convex Polytopes Christos A. Athanasiadis Received: 23 June 2008 / Revised: 27 February 2009

More information

11 Linear Programming

11 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 information

On the positive semidenite polytope rank

On the positive semidenite polytope rank On the positive semidenite polytope rank Davíd Trieb Bachelor Thesis Betreuer: Tim Netzer Institut für Mathematik Universität Innsbruck February 16, 017 On the positive semidefinite polytope rank - Introduction

More information

Parameter spaces for curves on surfaces and enumeration of rational curves

Parameter spaces for curves on surfaces and enumeration of rational curves Compositio Mathematica 3: 55 8, 998. 55 c 998 Kluwer Academic Publishers. Printed in the Netherlands. Parameter spaces for curves on surfaces and enumeration of rational curves LUCIA CAPORASO and JOE HARRIS

More information

The Cyclic Cycle Complex of a Surface

The 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 information

Newton Polygons of L-Functions

Newton Polygons of L-Functions Newton Polygons of L-Functions Phong Le Department of Mathematics University of California, Irvine June 2009/Ph.D. Defense Phong Le Newton Polygons of L-Functions 1/33 Laurent Polynomials Let q = p a where

More information