Universality in a Large Ensemble of Geometries

Size: px
Start display at page:

Download "Universality in a Large Ensemble of Geometries"

Transcription

1 Universality in a Large Ensemble of Geometries Jim Halverson Northeastern University String Phenomenology 2017 Based on work with Cody Long and Ben Sung.

2 Some Advertisements Cody Long s Talk: Weak Coupling Limits Ben Sung s Talk: Moduli, Morphisms, and Bounds Brent Nelson s Talk: Machine Learning

3 Q: how to approach large ensembles in the landscape? Q: what constitutes ``large?

4 Outline Geometrically Non-Higgsable Clusters Construction Universality

5 Non-Higgsable Clusters

6 7-brane Gauge Sectors CY elliptic fib. over B, extra spatial dimensions. y " = x % + fx + g Discrim: Δ = 0 7-branes on Δ = 0, source τ = C - + e /0 Seven-brane Gauge Sectors

7 Gauge Sectors for Generic CS f,g usually factorize, giving 7-branes can t split. Non-Higgsable 7-brane (NH7). Form clusters (NHC). 6d: either pure SYM, or not enough matter to Higgs.

8 NHC for Toric Bases Compute f,g-polytopes Map to monomials Construct most general f,g, look for factors.

9 Some Selected Progress Morrison, Taylor: classifications in 6d. Morrison, Taylor: 4d paper, new features (loops e.g.) J.H., Taylor: P1 bundles over M-T torics. > 10 3 examples. 93% NHC. Grassi, J.H., Shaneson, Taylor: Some nice SM features. Taylor, Wang: Monte Carlo exploration, e.g.

10 Construction [J.H., Long, Sung]

11 The Starting Point Extra dimensions: B 5 smooth toric weak-fano Determine by FRST of 3d reflexive polytope. O(10 83 ) such B 5. [J.H., Tian] [Carifio, J.H., Krioukov, Nelson] No NHC!

12 Visualizing Topological Transitions Curve blow: subdivide edge with vert v 8, v " by v = = v 8 + v ". Point blow: subdivide face with vertices v 8, v ", v % by v = = v 8 + v " + v %. Iterate! Seq. of blow-ups.

13 Language, for Brevity ``Sequence of Blow-ups = = Tree. Initial face or edge = patch or ground. v in tree = leaf. v = a v 8 + b v " + c v % a + b + c = height of leaf. See above. Max leaf height = height of tree.

14 Visualizing and Bounding Trees Easier to view face on: Face tree face on: Bound: h 6 sufficient to avoid (4,6) divisors. Sung s Talk.

15 Classifying Bounded Trees All 5 h 3 edge trees. Both h 3 face trees. # for h N:

16 Forests and Landscapes Construction: Make Trees Into Forests 0) Pick FRST T Δ 1) Face tree on each face. 2) Edge tree on each edge. # geom. in resulting ensemble S I : Shown facet: #E = 63, #F = 36.

17 The Big Ones Two polytopes Δ 8 and Δ " give the biggest ensembles. Very large numbers of geometries. Sung s Talk. All others have S I PQ".

18 Universality [J.H., Long, Sung]

19 Approaching Universality Assumption A 5. Property P 5. If A 5 P U, then P P 5 P(A 5 ). Goal: find pairs (A 5, P 5 ) that 1) maximize P A 5 2) maximize interestingness(p 5 ). Here: A 5 tree geometry, P 5 physical. Geometry à Physics.

20 NHC Universality Consider Δ with interiors on facet F. A = h 2 leaf on F. P = NH7 on all F interiors. Simple proof (w/ poly normality): A P Probability: Probability in the big ones:

21 Minimal Gauge Universality Theorem: A leaf built on E g roots with height h = 1,2,3,4,5,6 has Kodaira fiber F = II, IV rs, I -,rs, IV rs, II, and geometric gauge group G = E g, F x, G ", SU 2,,, respectively. A % P %, let H 5 be # leaves of height i above E g roots. A % : every vertex-containing simplex has a face tree and there is a height h 5 face tree somewhere on big facet F. P % : Probability: P P % P A %

22 Random Sampling Results Random face and edge trees on pushing triangulation. Millions of random samples: 1) 36 of 38 leaves on ground have E8 2) leaves on ground only {E6, E7, E8}. 3) E6 only on one special point: with prob~1/2000, g x = m ", with m = ( 2,0,0). When E6? Supervised machine learning. Nelson s Talk. (see also, Ruehle s talk for ML!)

23 Conclusions x % F-theory geometries. Connected CY moduli space. NHC Generic: Large Geometric Gauge Generic: Q: how do you do anything with of something? Algorithmic universality. Derived from construction algorithm, not constructed ensemble.

24 Thanks!

25 Caveats and Technicalities

26

27 Flux: Bousso-Polchinski story on top of this. h 88 large χ likely large. Should be fine. Morphisms: Z %, but that seems to be it. Moduli: (4,6) divisor pathology from Hayakawa-Wang Always avoid, by construction. Enlarging the set: mix face, edge blow-ups, e.g. Weaken height bound. Compare to new Monte Carlo of [Taylor, Wang]?

Big Data and the Landscape:

Big Data and the Landscape: Big Data and the Landscape: A Case Study in F-theory Jim Halverson Northeastern University Based on: 1706.02299 with Cody Long and Ben Sung 1707.00655 with Jon Carifio, Dima Krioukov, and Brent Nelson

More information

A Large Ensemble of F-theory Geometries:

A Large Ensemble of F-theory Geometries: A Large Ensemble of F-theory Geometries: the Weak, the Strong, and the Non-Higgsable Jim Halverson Northeastern University Based on: 1706.02299 with Cody Long and Ben Sung 1707.00655 with Jon Carifio,

More information

String Theory and Data Science

String Theory and Data Science String Theory and Data Science Jim Halverson Northeastern University Strings 2018 Based on: 1706 with Long, Sung 1707 with Carifio, Krioukov, Nelson 1710 with Long, Sung To appear: 1808 with Nelson, Ruehle

More information

Machine Learning and the String Landscape. Brent D. Nelson. String Pheno 2017, Virginia Tech

Machine Learning and the String Landscape. Brent D. Nelson. String Pheno 2017, Virginia Tech Machine Learning and the String Landscape Brent D. Nelson String Pheno 2017, Virginia Tech hep-th/1607.00655, with J. Carifio, J. Halverson, and D. Krioukov NU HET Data Science: R. Altman, W. Cunningham,

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

Integral Geometry and the Polynomial Hirsch Conjecture

Integral Geometry and the Polynomial Hirsch Conjecture Integral Geometry and the Polynomial Hirsch Conjecture Jonathan Kelner, MIT Partially based on joint work with Daniel Spielman Introduction n A lot of recent work on Polynomial Hirsch Conjecture has focused

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

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

Mirror, Mirror. String Theory and Pairs of Polyhedra. Ursula Whitcher. February Math Reviews & University of Wisconsin Eau Claire

Mirror, Mirror. String Theory and Pairs of Polyhedra. Ursula Whitcher. February Math Reviews & University of Wisconsin Eau Claire Mirror, Mirror String Theory and Pairs of Polyhedra Ursula Whitcher Math Reviews & University of Wisconsin Eau Claire February 2017 What do these people have in common? Figure: Maxim Kontsevich Figure:

More information

Introduction to the BKMP conjecture

Introduction to the BKMP conjecture I P h T SGCSC, 3rd November Institut Henri Poincaré s a c l a y Introduction to the BKMP conjecture Gaëtan Borot Introduction to the BKMP conjecture I Topological string theories A Gromov-Witten invariants

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

CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm. Instructor: Shaddin Dughmi

CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm. Instructor: Shaddin Dughmi CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm Instructor: Shaddin Dughmi Algorithms for Convex Optimization We will look at 2 algorithms in detail: Simplex and Ellipsoid.

More information

Topological Issues in Hexahedral Meshing

Topological Issues in Hexahedral Meshing Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues

More information

Wait-Free Computability for General Tasks

Wait-Free Computability for General Tasks Wait-Free Computability for General Tasks Companion slides for Distributed Computing Through Combinatorial Topology Maurice Herlihy & Dmitry Kozlov & Sergio Rajsbaum 1 Road Map Inherently colored tasks

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

Abstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.

Abstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H. Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph

More information

CS 229 Midterm Review

CS 229 Midterm Review CS 229 Midterm Review Course Staff Fall 2018 11/2/2018 Outline Today: SVMs Kernels Tree Ensembles EM Algorithm / Mixture Models [ Focus on building intuition, less so on solving specific problems. Ask

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

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

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

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

CS885 Reinforcement Learning Lecture 9: May 30, Model-based RL [SutBar] Chap 8

CS885 Reinforcement Learning Lecture 9: May 30, Model-based RL [SutBar] Chap 8 CS885 Reinforcement Learning Lecture 9: May 30, 2018 Model-based RL [SutBar] Chap 8 CS885 Spring 2018 Pascal Poupart 1 Outline Model-based RL Dyna Monte-Carlo Tree Search CS885 Spring 2018 Pascal Poupart

More information

The Charney-Davis conjecture for certain subdivisions of spheres

The Charney-Davis conjecture for certain subdivisions of spheres The Charney-Davis conjecture for certain subdivisions of spheres Andrew Frohmader September, 008 Abstract Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced,

More information

Interpolating and Approximating Implicit Surfaces from Polygon Soup

Interpolating and Approximating Implicit Surfaces from Polygon Soup Interpolating and Approimating Implicit Surfaces from Polygon Soup Chen Shen, James F. O Brien, Jonathan R. Shewchuk University of California, Berkeley Geometric Algorithms Seminar CS 468 Fall 2005 Overview

More information

College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007

College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions

More information

Outline. Main Questions. What is the k-means method? What can we do when worst case analysis is too pessimistic?

Outline. Main Questions. What is the k-means method? What can we do when worst case analysis is too pessimistic? Outline Main Questions 1 Data Clustering What is the k-means method? 2 Smoothed Analysis What can we do when worst case analysis is too pessimistic? 3 Smoothed Analysis of k-means Method What is the smoothed

More information

Simplicial Hyperbolic Surfaces

Simplicial Hyperbolic Surfaces Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold

More information

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient

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

Linear Complexity Hexahedral Mesh Generation

Linear Complexity Hexahedral Mesh Generation Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51

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

The Simplex Algorithm for LP, and an Open Problem

The Simplex Algorithm for LP, and an Open Problem The Simplex Algorithm for LP, and an Open Problem Linear Programming: General Formulation Inputs: real-valued m x n matrix A, and vectors c in R n and b in R m Output: n-dimensional vector x There is one

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

Lecture 5: Simplicial Complex

Lecture 5: Simplicial Complex Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.

More information

15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018

15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming

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

Combinatorial Gems. Po-Shen Loh. June 2009

Combinatorial Gems. Po-Shen Loh. June 2009 Combinatorial Gems Po-Shen Loh June 2009 Although this lecture does not contain many offical Olympiad problems, the arguments which are used are all common elements of Olympiad problem solving. Some of

More information

Web Formalism and the IR limit of 1+1 N=(2,2) QFT. collaboration with Davide Gaiotto & Edward Witten

Web Formalism and the IR limit of 1+1 N=(2,2) QFT. collaboration with Davide Gaiotto & Edward Witten Web Formalism and the IR limit of 1+1 N=(2,2) QFT -or - A short ride with a big machine String-Math, Edmonton, June 12, 2014 Gregory Moore, Rutgers University collaboration with Davide Gaiotto & Edward

More information

The Symplectic Geometry of Polygon Space and How to Use It

The Symplectic Geometry of Polygon Space and How to Use It The Symplectic Geometry of Polygon Space and How to Use It Clayton Shonkwiler Colorado State University LSU Topology Seminar November 4, 2015 From Variable Edgelengths to Fixed Edgelengths In my grad student

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

Analyzing Stochastic Gradient Descent for Some Non- Convex Problems

Analyzing Stochastic Gradient Descent for Some Non- Convex Problems Analyzing Stochastic Gradient Descent for Some Non- Convex Problems Christopher De Sa Soon at Cornell University cdesa@stanford.edu stanford.edu/~cdesa Kunle Olukotun Christopher Ré Stanford University

More information

Machine Learning for Medical Image Analysis. A. Criminisi

Machine Learning for Medical Image Analysis. A. Criminisi Machine Learning for Medical Image Analysis A. Criminisi Overview Introduction to machine learning Decision forests Applications in medical image analysis Anatomy localization in CT Scans Spine Detection

More information

Terrain Rendering Research for Games. Jonathan Blow Bolt Action Software

Terrain Rendering Research for Games. Jonathan Blow Bolt Action Software Terrain Rendering Research for Games Jonathan Blow Bolt Action Software jon@bolt-action.com Lecture Agenda Introduction to the problem Survey of established algorithms Problems with established algorithms

More information

Geometry Unit 2 Test , 3.8,

Geometry Unit 2 Test , 3.8, Name: Class: Date: ID: A Geometry Unit 2 Test - 3.1-3.5, 3.8, 9.1-9.3 Short Answer - You are allowed to use your notes and calculator. No cell phones.good luck! 1. Line r is parallel to line t. Find m

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

Kernels and Clustering

Kernels and Clustering Kernels and Clustering Robert Platt Northeastern University All slides in this file are adapted from CS188 UC Berkeley Case-Based Learning Non-Separable Data Case-Based Reasoning Classification from similarity

More information

arxiv: v1 [math.at] 8 Jan 2015

arxiv: v1 [math.at] 8 Jan 2015 HOMOLOGY GROUPS OF SIMPLICIAL COMPLEMENTS: A NEW PROOF OF HOCHSTER THEOREM arxiv:1501.01787v1 [math.at] 8 Jan 2015 JUN MA, FEIFEI FAN AND XIANGJUN WANG Abstract. In this paper, we consider homology groups

More information

CS 465 Program 4: Modeller

CS 465 Program 4: Modeller CS 465 Program 4: Modeller out: 30 October 2004 due: 16 November 2004 1 Introduction In this assignment you will work on a simple 3D modelling system that uses simple primitives and curved surfaces organized

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

SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES

SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES AKHIL MATHEW Abstract These are notes from a talk I gave for high-schoolers at the Harvard- MIT Mathematics

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

arxiv: v1 [math.co] 27 Feb 2015

arxiv: v1 [math.co] 27 Feb 2015 Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,

More 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

MIT Samberg Center Cambridge, MA, USA. May 30 th June 2 nd, by C. Rea, R.S. Granetz MIT Plasma Science and Fusion Center, Cambridge, MA, USA

MIT Samberg Center Cambridge, MA, USA. May 30 th June 2 nd, by C. Rea, R.S. Granetz MIT Plasma Science and Fusion Center, Cambridge, MA, USA Exploratory Machine Learning studies for disruption prediction on DIII-D by C. Rea, R.S. Granetz MIT Plasma Science and Fusion Center, Cambridge, MA, USA Presented at the 2 nd IAEA Technical Meeting on

More information

Linear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?

Linear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization? Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x

More information

Polygon Partitioning. Lecture03

Polygon Partitioning. Lecture03 1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition

More information

Lecture 3: Art Gallery Problems and Polygon Triangulation

Lecture 3: Art Gallery Problems and Polygon Triangulation EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified

More information

Warm-Up. Find the domain and range:

Warm-Up. Find the domain and range: Warm-Up Find the domain and range: Geometry Vocabulary & Notation Point Name: Use only the capital letter, without any symbol. Line Name: Use any two points on the line with a line symbol above. AB Line

More information

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize. Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

More information

Adaptive Learning of an Accurate Skin-Color Model

Adaptive Learning of an Accurate Skin-Color Model Adaptive Learning of an Accurate Skin-Color Model Q. Zhu K.T. Cheng C. T. Wu Y. L. Wu Electrical & Computer Engineering University of California, Santa Barbara Presented by: H.T Wang Outline Generic Skin

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Extremal Configurations of Polygonal Linkages

Extremal Configurations of Polygonal Linkages Extremal Configurations of Polygonal Linkages Dirk Siersma Department of Mathematics University of Utrecht Singularity Conference Bruce 60, Wall 75 Liverpool, June 18-22, 2012 Outline Introduction Planar

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

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms CS245-2008S-19 B-Trees David Galles Department of Computer Science University of San Francisco 19-0: Indexing Operations: Add an element Remove an element Find an element,

More information

Geometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo

Geometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo Geometric Modeling Bing-Yu Chen National Taiwan University The University of Tokyo Surface Simplification Motivation Basic Idea of LOD Discrete LOD Continuous LOD Simplification Problem Characteristics

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

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

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

Linear Programming and its Applications

Linear Programming and its Applications Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear

More information

New algorithms for sampling closed and/or confined equilateral polygons

New algorithms for sampling closed and/or confined equilateral polygons New algorithms for sampling closed and/or confined equilateral polygons Jason Cantarella and Clayton Shonkwiler University of Georgia BIRS Workshop Entanglement in Biology November, 2013 Closed random

More information

Polyhedral Combinatorics of Coxeter Groups 2

Polyhedral Combinatorics of Coxeter Groups 2 3 s 2 s 6 s 4 s 5 s 1 s 3 s 2 s 6 s 4 s 5 s 1 s 3 s Polyhedral Combinatorics of Coxeter Groups 2 s 6 s 5 s 1 s Dissertation s Defense 3 s 2 s 6 Jean-Philippe Labbé s 1 s s 2 s 1 α u ut(α s ) u(α t ) ut(α

More information

An Abundance of K3 Fibrations from Polyhedra with Interchangeable Parts

An Abundance of K3 Fibrations from Polyhedra with Interchangeable Parts arxiv:127.4792v1 [hep-th] 19 Jul 212 An Abundance of K3 Fibrations from Polyhedra with Interchangeable Parts Philip Candelas 1, Andrei Constantin 2 and Harald Skarke 3 1 Mathematical Institute University

More information

CS 410/584, Algorithm Design & Analysis, Lecture Notes 8!

CS 410/584, Algorithm Design & Analysis, Lecture Notes 8! CS 410/584, Algorithm Design & Analysis, Computational Geometry! Algorithms for manipulation of geometric objects We will concentrate on 2-D geometry Numerically robust try to avoid division Round-off

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Design and Analysis of Algorithms CS 5311 Lecture 19 Topological Sort Junzhou Huang, Ph.D. Department of Computer Science and ngineering CS5311 Design and Analysis of Algorithms 1 Topological Sort Want

More information

Shape Modeling and Geometry Processing

Shape Modeling and Geometry Processing 252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry

More information

/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization

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

Medial Scaffolds for 3D data modelling: status and challenges. Frederic Fol Leymarie

Medial Scaffolds for 3D data modelling: status and challenges. Frederic Fol Leymarie Medial Scaffolds for 3D data modelling: status and challenges Frederic Fol Leymarie Outline Background Method and some algorithmic details Applications Shape representation: From the Medial Axis to the

More information

Lecture 5 CLASSIFICATION OF SURFACES

Lecture 5 CLASSIFICATION OF SURFACES Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the

More information

Meshing in STAR-CCM+: Recent Advances Aly Khawaja

Meshing in STAR-CCM+: Recent Advances Aly Khawaja Meshing in STAR-CCM+: Recent Advances Aly Khawaja Outline STAR-CCM+: a complete simulation workflow Emphasis on pre-processing technology Recent advances in surface preparation and meshing Continue to

More information

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares. Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of

More information

Ellipsoid Algorithm :Algorithms in the Real World. Ellipsoid Algorithm. Reduction from general case

Ellipsoid Algorithm :Algorithms in the Real World. Ellipsoid Algorithm. Reduction from general case Ellipsoid Algorithm 15-853:Algorithms in the Real World Linear and Integer Programming II Ellipsoid algorithm Interior point methods First polynomial-time algorithm for linear programming (Khachian 79)

More information

looking ahead to see the optimum

looking ahead to see the optimum ! Make choice based on immediate rewards rather than looking ahead to see the optimum! In many cases this is effective as the look ahead variation can require exponential time as the number of possible

More information

CSE 417 Network Flows (pt 3) Modeling with Min Cuts

CSE 417 Network Flows (pt 3) Modeling with Min Cuts CSE 417 Network Flows (pt 3) Modeling with Min Cuts Reminders > HW6 is due on Friday start early bug fixed on line 33 of OptimalLineup.java: > change true to false Review of last two lectures > Defined

More information

Introduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization

Introduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization Introduction to Linear Programming Algorithmic and Geometric Foundations of Optimization Optimization and Linear Programming Mathematical programming is a class of methods for solving problems which ask

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

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

Triangle meshes I. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2017

Triangle meshes I. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2017 Triangle meshes I CS 4620 Lecture 2 2017 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2017 Steve Marschner 2 finite element analysis PATRIOT Engineering 2017

More information

Computational Geometry

Computational Geometry Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is

More information

Figure 2.1: An example of a convex set and a nonconvex one.

Figure 2.1: An example of a convex set and a nonconvex one. Convex Hulls 2.1 Definitions 2 Convexity is the key to understanding and simplifying geometry, and the convex hull plays a role in geometry akin to the sorted order for a collection of numbers. So what

More information

Mesh Decimation. Mark Pauly

Mesh Decimation. Mark Pauly Mesh Decimation Mark Pauly Applications Oversampled 3D scan data ~150k triangles ~80k triangles Mark Pauly - ETH Zurich 280 Applications Overtessellation: E.g. iso-surface extraction Mark Pauly - ETH Zurich

More information

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

CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi

CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization

More information

The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris

The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris J ai commencé a regarder M 0,5 à des moments perdus, c est un véritable joyau, d une géométrie très riche étroitement

More information

Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem

Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem Uncapacitated Networks: Basic primal and dual solutions Flow conservation constraints

More information

Math 6510 Homework 3

Math 6510 Homework 3 Notational Note: In any presentation of a group G, I will explicitly set the relation equal to e as opposed to simply writing a presentation like G = a, b, c, d abcd 1. This is a bit untraditional, but

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

Triangle meshes I. CS 4620 Lecture 2

Triangle meshes I. CS 4620 Lecture 2 Triangle meshes I CS 4620 Lecture 2 2014 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2014 Steve Marschner 2 finite element analysis PATRIOT Engineering 2014

More information

Polygon decomposition. Motivation: Art gallery problem

Polygon decomposition. Motivation: Art gallery problem CG Lecture 3 Polygon decomposition 1. Polygon triangulation Triangulation theory Monotone polygon triangulation 2. Polygon decomposition into monotone pieces 3. Trapezoidal decomposition 4. Convex decomposition

More information