Federico Ardila. San Francisco State University

Size: px
Start display at page:

Download "Federico Ardila. San Francisco State University"

Transcription

1 Severi degrees of toric surfaces are eventually polynomial Federico Ardila San Francisco State University MIT November 24, 2010 joint work with Florian Block (U. Michigan) Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

2 0. Outline. 1. Motivation. Enumerative geometry. Counting plane curves. 2. Our problem. Counting curves on toric surfaces. The main theorem. 3. The proof. Tropical curves. Floor diagrams. Template decomposition. Swap encoding. Discrete integrals over polytopes. 4. Comments, directions. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

3 1. Motivation: Enumerative geometry Enumerative Geometry: Counting algebro-geometric objects with certain properties. Traditional technique: Intersection theory. - Form a moduli space of objects you wish to count - Compute in the cohomology ring of that moduli space (k-planes Grassmannian H (Gr n,k ) Schubert calc. Littlewood-Richardson rule...) New technique: Tropical geometry. - Just tropicalize! Define tropical objects and count them instead. - Actually count them! (plane curves tropical curves floor diagrams... ) This talk: Enumeration of curves on toric surfaces via tropical geometry. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

4 1. Motivation: Counting plane curves. Question How many (possibly reducible) nodal algebraic curves in CP 2 have degree d,. δ nodes, and pass through (d+3)d 2 δ generic points? Number of such curves is the Severi degree N d,δ. N 1,0 = #{lines through 2 points} = 1. N 2,1 = #{1-nodal conics through 4 points} = 3 N 4,4 = #{4-nodal quartics through 10 points} = 666. If d δ + 2, such a curve is irreducible by Bézout s Theorem, so N d,δ = Gromov-Witten invariant N d,g, with g = (d 1)(d 2) 2 δ. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

5 1. Motivation: Counting plane curves. Theorem (Fomin Mikhalkin, 2009) For a fixed δ, we have N d,δ = N δ (d), for a combinatorially defined polynomial N δ (d) Q[d], provided d 2δ. Conjectured by Di Francesco Itzykson (1994) and by Göttsche (1997). - J. Steiner (1848): N d,1 = 3(d 1) 2 - A. Cayley (1863): N d,2 = 3 2 (d 1)(d 2)(3d 2 3d 11) - S. Roberts (1867): δ = 3 - I. Vainsencher (1995): δ = 4, 5, 6 - S. Kleiman R. Piene (2001): δ = 7, 8 - F. Block (2010): δ = 9, 10, 11, 12, 13, 14 Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

6 2. What we do: Counting curves on toric surfaces. Goal: Study the analogous problem for toric surfaces. Given a lattice polygon = (c, d), get: (c=slopes, d=lengths) : - a (projective) toric surface S = Tor(c). (think: c=surface) - a(n ample) line bundle L = L(c, d) on S (think: d= multidegree ) - a (complete) linear system L The Severi degree N,δ is the answer to: Question How many nodal algebraic curves in L have δ nodes, and pass through a generic set of Z 2 1 points in S? How many curves in the torus (C ) 2 have δ nodes, Newton polygon, and pass through Z 2 1 generic points in (C ) 2? Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

7 2. What we do: Counting curves on toric surfaces. Goal: Study the Severi degrees N,δ for polygons (toric surfaces). Ex. Σ m = Hirzebruch surface, 1 1 a (a, b) = bidegree m + 1 a m+b N,δ = # curves in Σ m of bi-degree (a, b) with δ nodes through an appropriate number of generic points We find: N,1 = 1, N,2 = 3bm 2 + 6ab 2bm 4a 4b + 4, b N,3 = 9 2 b4 m 2 6b 3 m abm a 2 b 2 24abm 2. +2b 2 m 2 12bm 3 24a 2 b Note: Severi degrees are polynomial in a and b, and also in m! Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

8 2. What we do: Counting curves on toric surfaces. Our main result. Assume (c, d) is h-transverse: (slopes of normal fan are integers) c = ((3, 1, 0, 1); ( 2, 0, 1, 2)) (slopes) d = ((1, 2, 1, 1); (1, 1, 1, 2); 1) (lengths) Theorem (Polynomiality of Severi degrees) (A. - Block, 2010) Fix m, n 1 and δ 1. There exists a universal and combinatorially defined polynomial p δ (c, d) such that the Severi degree N,δ is given by N,δ = p δ (c, d). (1) for any sufficiently large and spread out c Z m+n and d Z m+n+1 0. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

9 3.1. Proof: Tropical curves Mikhalkin s Correspondence Theorem (2005) replaces enumeration of algebraic curves on L : by weighted enumeration of tropical curves dual to subdivisions of : 2 Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

10 3.2. Proof: Floor diagrams Mikhalkin-Brugalle-Fomin ( 07, 09) replace enum. of tropical curves with enum. of combinatorial gadgets, (marked) floor diagrams Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

11 3.2. Proof: Floor diagrams D l, D r : left and right slopes (with multiplicities) t: top length D l = {0, 0, 0, 0}, D r = {1, 1, 1, 0}, t = Marked -floor diagram: permutations l, r of D l, D r weak ordered partition s of t a bipartite graph on ({,..., }, {,...,,,..., }), linearly ordered and directed L-to-R, with Z + edge weights such that: s are sinks, s have one incoming and one outgoing edge, div( ) = 0, div( ) = 1, div( i) (r l + s) i. 2 2 r = (1, 1, 0, 1), l = (0, 0, 0, 0), s = (0, 1, 0, 0), r l + s = (1, 2, 0, 1) Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

12 3.2. Proof: Floor diagrams. Theorem (Brugallé Mikhalkin 2007) N,δ = D weight(d), summing over all marked -floor diagrams D with d black vertices, and cogenus δ(d) := d(d 3) 2 + b 0 (D) b 1 (D) = δ. weight(d) = e edge weight(e) b 0 (D) = number of connected components of D. b 1 (D) = sum of the genera of the connected components of D. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

13 3.2. Proof: Floor diagrams. Theorem (Brugallé Mikhalkin 2007) N,δ = weight(d), δ(d)=δ summing over all marked -floor diagrams D with d black vertices, and cogenus δ(d) := d(d 3) 2 + b 0 (D) b 1 (D) = δ. Ok, this is combinatorial, but unmanageable in many ways! Some of the difficulties: - l, r permutations of sets of a variable length - s partition of a variable number - floor diagrams are hard to control - number of vertices isn t even fixed. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

14 3.3. Proof: Template decomposition Decompose marked floor diagrams into templates: Drop gray vertices, merge white vertices into a top and a bottom one. Drop short edges and isolated black vertices. Keep track of starting points of templates. This process is reversible Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

15 3.3. Proof: Template decomposition Brugalle - Mikhalkin: N,δ = weight(d) -floor diagram D permutations l, r of D l, D r templates Γ = (Γ 1,..., Γ m ) starting points k = (k 1,..., k m ). Theorem (Fomin Mikhalkin 2009 (plane curves) / A. Block 2010) N,δ = P Γ (a, k)weight(γ) (l,r) Γ : δ(γ)=δ δ(l,r) k A(Γ,a) # of preimages: combinatorially defined function P Γ (a, k). cogenus gets distributed: δ( ) = δ(γ) + δ(l, r), A(Γ, a) = set of possible k (depends on Γ and a := r l + s). The set of possible Γs is now finite. Still, the set of possible (l, r) is troublesome. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

16 3.4. Proof: Swap encoding N,δ = (l,r) Γ : δ(γ)=δ δ(l,r) k A(Γ,a) P Γ (a, k)weight(γ) Problem: l, r are permuts. of D l, D r, where each c i appears d i times. In principle, exponentially many of them. What limits them: δ(l, r) = (i,j) Rev(r) (r j r i ) + (i,j) Rev( l) (l i l j ) < δ. For simplicity of notation, let s assume D l = {0,..., 0}. Say c = (5, 3, 2, 1), d = (4, 6, 4, 3), so D r = {5 4, 3 6, 2 4, 1 3 }. A permutation: r = Key observations: If all d i > δ, there are no reversals of c i and c j (i j + 2). If all c i c i+1 > δ, there are no reversals at all. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

17 3.4. Proof: Swap encoding Let s assume d i > δ. Then just record the reversals of c i and c i+1. Say c = (5, 3, 2, 1), d = (4, 6, 4, 3), r = r = : : : π 1 = (1, 1, 1, 1, 1), π 2 = (1, 1, 1), π 3 = (1, 1, 1, 1) δ(r) = Rev(r) (r j r i ) = i inv(π i)(c i c i+1 ) only depends on c and π. There are finitely many π = (π 1,..., π k ) with δ(r) δ. N,δ = P Γ (a, k) weight(γ) π k A(Γ,a) Z m Γ: δ(γ)=δ δ(l,r) Now the first two sums are finite! Lastly, we need to deal with ( P Γ ). Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

18 3.5. Proof: Discrete integrals over polytopes Goal: f π,γ (a) = k A(Γ,a) Z m P Γ (a, k) is polynomial in c, d, where a = r l + s and r, l are encoded by π. Easy: a is piecewise linear in c and d. Recall: (marked floor diagram D) (templates Γ, starting points k) P Γ (a, k) is the number of preimages of (Γ, k). A(Γ, a) is the set of possible k for a given Γ It turns out that P Γ (a, k) is a product of binomial coeffs, polynomial in a. A(Γ, a) is generally unmanageable. But if d is large enough, it is a polytope with fixed facet directions and variable facet parameters. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

19 3.5. Proof: Discrete integrals over polytopes Lemma f π,γ (a) = k A(Γ,a) Z m P Γ (a, k) is polynomial in c and d P Γ (a, k): polynomial in a. A(Γ, a): polytope with fixed facet directions and variable parameters. Then f π,γ (a) is the discrete integral of a polynomial over a polytope, so it is piecewise quasipolynomial in a (and hence in c and d). piecewise? An intricate analysis shows we stay in one region of quasipolynomiality. quasi? P Γ (a, k) is a Delzant polytope, so we actually get a polynomial. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

20 3. The main result, again. Theorem (Polynomiality of Severi degrees) (A.-Block, 2010.) Fix m, n 1 and δ 1 and an h-transverse toric surface Tor(c). There exists a combinatorially defined polynomial p δ,c (d) such that the Severi degree N,δ is given by N,δ = p δ,c (d). for any sufficiently large and spread out d Z m+n+1 0. With a bit more work, Theorem (Universal Polynomiality) (A.-Block, 2010.) Fix m, n 1 and δ 1. There is a universal and combinatorially defined polynomial p δ (c, d) such that the Severi degree N,δ of any h-transverse toric surface is given by N,δ = p δ (c, d). for any sufficiently large and spread out c Z m+n and d Z m+n+1 0. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

21 4. Comments. Only for h-transverse polygons? Probably not. We inherit this restriction from Brugalle-Mikhalkin (2007): (count curves) (count tropical curves) (count floor diagrams) Problem: Modify floor diagrams to make this work in general. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

22 4. Comments. Only for h-transverse polygons? Probably not. We inherit this restriction from Brugalle-Mikhalkin (2007): (count curves) (count tropical curves) (count floor diagrams) Problem: Modify floor diagrams to make this work in general. Only for large c and d? Yes. But the thresholds can probably be improved. Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

23 4. Comments. Only for h-transverse polygons? Probably not. We inherit this restriction from Brugalle-Mikhalkin (2007): (count curves) (count tropical curves) (count floor diagrams) Problem: Modify floor diagrams to make this work in general. Only for large c and d? Yes. But the thresholds can probably be improved. Only for toric surfaces? No. Göttsche s Conjecture (1998) / Tzeng s Theorem (2010): For any smooth surface S and (5δ 1)-very ample line bundle L, N δ = T δ (c 1 (L) 2, c 1 (L) c 1 (K S ), c 1 (K S ) 2, c 2 (T S )), for a universal polynomial T δ. (K S, T S : canonical, tangent bundle of S.) Our surfaces are almost never smooth. The Chern class c 2 (T S ) is not polynomial in c and d. The others are. There is surely much more to this story... Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

24 Thank you. The slides are available upon request. The paper will be posted in the next few days to the arxiv and to: Federico Ardila (SF State) Severi degrees of toric surfaces November 24, / 22

Federico Ardila. Castro Urdiales. December 15, joint work with Florian Block (U. Warwick)

Federico Ardila. Castro Urdiales. December 15, joint work with Florian Block (U. Warwick) Severi degrees of toric surfaces are eventually polynomial Federico Ardila San Francisco State University. Universidad de Los Andes Castro Urdiales December 15, 2011 joint work with Florian Block (U. Warwick)

More information

Cluster algebras and infinite associahedra

Cluster algebras and infinite associahedra Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the

More information

Linear Precision for Parametric Patches

Linear 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 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

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

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

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

Mutation-linear algebra and universal geometric cluster algebras

Mutation-linear algebra and universal geometric cluster algebras Mutation-linear algebra and universal geometric cluster algebras Nathan Reading NC State University Mutation-linear ( µ-linear ) algebra Universal geometric cluster algebras The mutation fan Universal

More information

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian Atlanta January 5, 2005 Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian Ravi Vakil, Stanford University http://math.stanford.edu/

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

Conics on the Cubic Surface

Conics on the Cubic Surface MAAC 2004 George Mason University Conics on the Cubic Surface Will Traves U.S. Naval Academy USNA Trident Project This talk is a preliminary report on joint work with MIDN 1/c Andrew Bashelor and my colleague

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

INTRODUCTION TO CLUSTER ALGEBRAS

INTRODUCTION TO CLUSTER ALGEBRAS INTRODUCTION TO CLUSTER ALGEBRAS NAN LI (MIT) Cluster algebras are a class of commutative ring, introduced in 000 by Fomin and Zelevinsky, originally to study Lusztig s dual canonical basis and total positivity.

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

Counting Faces of Polytopes

Counting Faces of Polytopes Counting Faces of Polytopes Carl Lee University of Kentucky James Madison University March 2015 Carl Lee (UK) Counting Faces of Polytopes James Madison University 1 / 36 Convex Polytopes A convex polytope

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

A master bijection for planar maps and its applications. Olivier Bernardi (MIT) Joint work with Éric Fusy (CNRS/LIX)

A master bijection for planar maps and its applications. Olivier Bernardi (MIT) Joint work with Éric Fusy (CNRS/LIX) A master bijection for planar maps and its applications Olivier Bernardi (MIT) Joint work with Éric Fusy (CNRS/LIX) UCLA, March 0 Planar maps. Definition A planar map is a connected planar graph embedded

More information

Linear Systems on Tropical Curves

Linear Systems on Tropical Curves Linear Systems on Tropical Curves Gregg Musiker (MIT University of Minnesota) Joint work with Christian Haase (FU Berlin) and Josephine Yu (Georgia Tech) FPSAC 00 August 5, 00 Musiker (University of Minnesota)

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

The Convex Hull of a Space Curve

The Convex Hull of a Space Curve The Convex Hull of a Space Curve Bernd Sturmfels, UC Berkeley (joint work with Kristian Ranestad) The Mathematics of Klee & Grünbaum: 100 Years in Seattle Friday, July 30, 2010 Convex Hull of a Trigonometric

More information

Miquel dynamics for circle patterns

Miquel dynamics for circle patterns Miquel dynamics for circle patterns Sanjay Ramassamy ENS Lyon Partly joint work with Alexey Glutsyuk (ENS Lyon & HSE) Seminar of the Center for Advanced Studies Skoltech March 12 2018 Circle patterns form

More information

combinatorial commutative algebra final projects

combinatorial commutative algebra final projects combinatorial commutative algebra. 2009 final projects due dates. o Wednesday, April 8: rough outline. (1-2 pages) o Monday, May 18: final project. ( 10 pages in LaTeX, 11pt, single space). san francisco

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

Algorithmic Semi-algebraic Geometry and its applications. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology.

Algorithmic Semi-algebraic Geometry and its applications. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 1 Algorithmic Semi-algebraic Geometry and its applications Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 2 Introduction: Three problems 1. Plan the motion of

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

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

Fano varieties and polytopes

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

The Simplex Algorithm

The Simplex Algorithm The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

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

Combinatorics of cluster structures in Schubert varieties

Combinatorics of cluster structures in Schubert varieties Combinatorics of cluster structures in Schubert varieties arxiv:1902.00807 Slides available at www.math.berkeley.edu/~msb M. Sherman-Bennett (UC Berkeley) joint work with K. Serhiyenko and L. Williams

More information

Reliable Location with Respect to the Projection of a Smooth Space Curve

Reliable Location with Respect to the Projection of a Smooth Space Curve Reliable Location with Respect to the Projection of a Smooth Space Curve Rémi Imbach Marc Pouget INRIA Nancy Grand Est, LORIA laboratory, Nancy, France. firstname.name@inria.fr Guillaume Moroz Abstract

More information

Lecture 12 March 4th

Lecture 12 March 4th Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 12 March 4th Lecturer: Lior Pachter Scribe/ Editor: Wenjing Zheng/ Shaowei Lin 12.1 Alignment Polytopes Recall that the alignment

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

The space of tropically collinear points is shellable

The space of tropically collinear points is shellable Collect. Math. 60, (2009), 63 77 c 2009 Universitat de Barcelona The space of tropically collinear points is shellable Hannah Markwig University of Michigan, Department of Mathematics, 2074 East Hall 530

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

Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons

Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons Jason Cantarella and Clayton Shonkwiler University of Georgia Georgia Topology Conference July 9, 2013 Basic Definitions Symplectic

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

INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP*

INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP* South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 10-16. INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP* PAVEL CHALMOVIANSKÝ abstrakt. We deal with application of intersection

More information

The important function we will work with is the omega map ω, which we now describe.

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

Hamiltonian cycles in bipartite quadrangulations on the torus

Hamiltonian cycles in bipartite quadrangulations on the torus Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple

More information

Graphs associated to CAT(0) cube complexes

Graphs associated to CAT(0) cube complexes Graphs associated to CAT(0) cube complexes Mark Hagen McGill University Cornell Topology Seminar, 15 November 2011 Outline Background on CAT(0) cube complexes The contact graph: a combinatorial invariant

More information

Gift Wrapping for Pretropisms

Gift Wrapping for Pretropisms Gift Wrapping for Pretropisms Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational

More information

The universal implosion and the multiplicative Horn problem

The universal implosion and the multiplicative Horn problem The universal implosion and the multiplicative Horn problem Michael Thaddeus April 27, 2014 Michael Thaddeus The universal implosion and the multiplicative Horn problem 1 / 1 The multiplicative Horn problem

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

arxiv:math/ v1 [math.ag] 24 Feb 2003

arxiv:math/ v1 [math.ag] 24 Feb 2003 A GEOMETRIC LITTLEWOOD-RICHARDSON RULE RAVI VAKIL arxiv:math/32294v [math.ag] 24 Feb 23 ABSTRACT. We describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection

More information

arxiv: v2 [math.co] 24 Aug 2016

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

Introduction to Riemann surfaces, moduli spaces and its applications

Introduction to Riemann surfaces, moduli spaces and its applications Introduction to Riemann surfaces, moduli spaces and its applications Oscar Brauer M2, Mathematical Physics Outline 1. Introduction to Moduli Spaces 1.1 Moduli of Lines 1.2 Line Bundles 2. Moduli space

More information

Essential bases, semigroups and toric degenerations

Essential bases, semigroups and toric degenerations Ghislain Fourier SFB meeting, 27.09.2018 1 17 pages until lunch break Essential bases, semigroups and toric degenerations Annual meeting SFB/TRR 195 27.09.2018, Tübingen Ghislain Fourier Ghislain Fourier

More information

Geometric Invariants on Monomial Curves

Geometric Invariants on Monomial Curves Geometric Invariants on Monomial Curves Tim Duff, Takumi Murayama, Karl Schaefer UC Berkeley Math RTG Stanford, July 31, 2013 T. Duff/T. Murayama/K. Schaefer (UCB) Geometric Invariants on Monomial Curves

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

PBW and toric degenerations of flag varieties

PBW and toric degenerations of flag varieties PBW and toric degenerations of flag varieties Ghislain Fourier University of Glasgow - Universität Bonn DFG-Schwerpunkt 1388, Bad Honnef 2015 Fourier 1/ 18 The Setup Let us introduce the main objects in

More information

Bijective Links on Planar Maps via Orientations

Bijective Links on Planar Maps via Orientations Bijective Links on Planar Maps via Orientations Éric Fusy Dept. Math, University of British Columbia. p.1/1 Planar maps Planar map = graph drawn in the plane without edge-crossing, taken up to isotopy

More information

Random Tropical Curves

Random Tropical Curves Claremont Colleges Scholarship @ Claremont HMC Senior Theses HMC Student Scholarship 2017 Random Tropical Curves Magda L. Hlavacek Harvey Mudd College Recommended Citation Hlavacek, Magda L., "Random Tropical

More information

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?

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

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

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

A Computational Algebra approach to Intersection Theory and Enumerative Geometry

A Computational Algebra approach to Intersection Theory and Enumerative Geometry A Computational Algebra approach to Intersection Theory and Enumerative Geometry TU Kaiserslautern Summer School in Algorithmic Mathematics Munich, 06 10 August 2012 Outline Linear supspaces on hypersurfaces

More information

arxiv: v2 [math.co] 4 Jul 2018

arxiv: v2 [math.co] 4 Jul 2018 SMOOTH CENTRALLY SYMMETRIC POLYTOPES IN DIMENSION 3 ARE IDP MATTHIAS BECK, CHRISTIAN HAASE, AKIHIRO HIGASHITANI, JOHANNES HOFSCHEIER, KATHARINA JOCHEMKO, LUKAS KATTHÄN, AND MATEUSZ MICHAŁEK arxiv:802.0046v2

More information

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

arxiv:math/ v1 [math.ag] 14 Jul 2004 arxiv:math/0407253v1 [math.ag] 14 Jul 2004 Degenerations of Surface Scrolls and the Gromov-Witten Invariants of Grassmannians Izzet Coskun October 30, 2018 Abstract: We describe an algorithm for computing

More information

Mathematics 6 12 Section 26

Mathematics 6 12 Section 26 Mathematics 6 12 Section 26 1 Knowledge of algebra 1. Apply the properties of real numbers: closure, commutative, associative, distributive, transitive, identities, and inverses. 2. Solve linear equations

More information

Math 635: Algebraic Topology III, Spring 2016

Math 635: Algebraic Topology III, Spring 2016 Math 635: Algebraic Topology III, Spring 2016 Instructor: Nicholas Proudfoot Email: njp@uoregon.edu Office: 322 Fenton Hall Office Hours: Monday and Tuesday 2:00-3:00 or by appointment. Text: We will use

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

Graph Theoretical Cluster Expansion Formulas

Graph Theoretical Cluster Expansion Formulas Graph Theoretical Cluster Expansion Formulas Gregg Musiker MIT December 9, 008 http//math.mit.edu/ musiker/graphtalk.pdf Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9 Outline.

More information

Triple lines on curves

Triple lines on curves Triple lines on curves Frank de Zeeuw EPFL (Switzerland) IPAM: Algebraic Techniques for Combinatorial Geometry - LA - May 13, 2014 Japanese-Swiss Workshop on Combinatorics - Tokyo - June 5, 2014 I will

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

Lecture 3A: Generalized associahedra

Lecture 3A: Generalized associahedra Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron

More information

Trinities, hypergraphs, and contact structures

Trinities, hypergraphs, and contact structures Trinities, hypergraphs, and contact structures Daniel V. Mathews Daniel.Mathews@monash.edu Monash University Discrete Mathematics Research Group 14 March 2016 Outline 1 Introduction 2 Combinatorics of

More information

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows

More information

CS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36

CS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36 CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the

More information

Lecture 4A: Combinatorial frameworks for cluster algebras

Lecture 4A: Combinatorial frameworks for cluster algebras Lecture 4A: Combinatorial frameworks for cluster algebras Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Frameworks

More information

A brief survey of A-resultants, A-discriminants, and A-determinants

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

Enumeration of Tilings and Related Problems

Enumeration of Tilings and Related Problems Enumeration of Tilings and Related Problems Tri Lai Institute for Mathematics and its Applications Minneapolis, MN 55455 Discrete Mathematics Seminar University of British Columbia Vancouver February 2016

More information

The Associahedra and Permutohedra Yet Again

The Associahedra and Permutohedra Yet Again The Associahedra and Permutohedra Yet Again M. D. Sheppeard Abstract The associahedra and permutohedra polytopes are redefined as subsets of discrete simplices, associated respectively to the commutative

More information

A geometric non-existence proof of an extremal additive code

A geometric non-existence proof of an extremal additive code A geometric non-existence proof of an extremal additive code Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Stefano Marcugini and Fernanda Pambianco Dipartimento

More information

ON FAMILIES OF NESTOHEDRA

ON FAMILIES OF NESTOHEDRA ON FAMILIES OF NESTOHEDRA A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2010 Andrew Graham Fenn School of

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 LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015

THE LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015 THE LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015 A labelled peer code is a descriptive syntax for a diagram of a knot or link on a two dimensional sphere. The syntax is able to describe

More information

L-Infinity Optimization in Tropical Geometry and Phylogenetics

L-Infinity Optimization in Tropical Geometry and Phylogenetics L-Infinity Optimization in Tropical Geometry and Phylogenetics Daniel Irving Bernstein* and Colby Long North Carolina State University dibernst@ncsu.edu https://arxiv.org/abs/1606.03702 October 19, 2016

More information

Negative Numbers in Combinatorics: Geometrical and Algebraic Perspectives

Negative Numbers in Combinatorics: Geometrical and Algebraic Perspectives Negative Numbers in Combinatorics: Geometrical and Algebraic Perspectives James Propp (UMass Lowell) June 29, 2012 Slides for this talk are on-line at http://jamespropp.org/msri-up12.pdf 1 / 99 I. Equal

More information

Manufacturing Permutation Representations of Monodromy Groups of Polytopes

Manufacturing Permutation Representations of Monodromy Groups of Polytopes Manufacturing Permutation Representations of Monodromy Groups of Polytopes Barry Monson, University of New Brunswick SCDO, Queenstown, NZ, February, 2016 (supported in part by NSERC) Outline: there s no

More information

arxiv: v1 [math.co] 13 Mar 2015

arxiv: v1 [math.co] 13 Mar 2015 THE MANY FACES OF MODERN COMBINATORICS CRISTIAN LENART arxiv:1503.04240v1 [math.co] 13 Mar 2015 Abstract. This is a survey of recent developments in combinatorics. The goal is to give a big picture of

More information

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

Sutured Manifold Hierarchies and Finite-Depth Foliations

Sutured Manifold Hierarchies and Finite-Depth Foliations Sutured Manifold Hierarchies and Finite-Depth Christopher Stover Florida State University Topology Seminar November 4, 2014 Outline Preliminaries Depth Sutured Manifolds, Decompositions, and Hierarchies

More information

Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams

Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24

More information

The geometry and combinatorics of closed geodesics on hyperbolic surfaces

The geometry and combinatorics of closed geodesics on hyperbolic surfaces The geometry and combinatorics of closed geodesics on hyperbolic surfaces CUNY Graduate Center September 8th, 2015 Motivating Question: How are the algebraic/combinatoric properties of closed geodesics

More information

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture

More information

WINDING AND UNWINDING AND ESSENTIAL INTERSECTIONS IN H 3

WINDING AND UNWINDING AND ESSENTIAL INTERSECTIONS IN H 3 WINDING AND UNWINDING AND ESSENTIAL INTERSECTIONS IN H 3 JANE GILMAN AND LINDA KEEN Abstract. Let G = A, B be a non-elementary two generator subgroup of Isom(H 2 ). If G is discrete and free and geometrically

More information

Computer Graphics Curves and Surfaces. Matthias Teschner

Computer Graphics Curves and Surfaces. Matthias Teschner Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves

More information

CS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 29

CS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 29 CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 29 CS 473: Algorithms, Spring 2018 Simplex and LP Duality Lecture 19 March 29, 2018

More information

Treewidth and graph minors

Treewidth and graph minors Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under

More information

h-polynomials of triangulations of flow polytopes (Cornell University)

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

BITANGENT LINES TO PLANAR QUARTIC CURVES IN ALGEBRAIC AND TROPICAL GEOMETRY. Drew Ellingson

BITANGENT LINES TO PLANAR QUARTIC CURVES IN ALGEBRAIC AND TROPICAL GEOMETRY. Drew Ellingson BITANGENT LINES TO PLANAR QUARTIC CURVES IN ALGEBRAIC AND TROPICAL GEOMETRY by Drew Ellingson A Senior Honors Thesis Submitted to the Faculty of The University of Utah In Partial Fulfillment of the Requirements

More information

arxiv: v2 [math.ag] 15 Oct 2015

arxiv: v2 [math.ag] 15 Oct 2015 BITANGENTS OF TROPICAL PLANE QUARTIC CURVES MATT BAKER, YOAV LEN, RALPH MORRISON, NATHAN PFLUEGER, QINGCHUN REN arxiv:1404.7568v2 [math.ag] 15 Oct 2015 Abstract. We study smooth tropical plane quartic

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information

Cannon s conjecture, subdivision rules, and expansion complexes

Cannon s conjecture, subdivision rules, and expansion complexes Cannon s conjecture, subdivision rules, and expansion complexes W. Floyd (joint work with J. Cannon and W. Parry) Department of Mathematics Virginia Tech UNC Greensboro: November, 2014 Motivation from

More information

Two Connections between Combinatorial and Differential Geometry

Two Connections between Combinatorial and Differential Geometry Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces

More information

Lattice-point generating functions for free sums of polytopes

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

CAT(0)-spaces. Münster, June 22, 2004

CAT(0)-spaces. Münster, June 22, 2004 CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan

More information