Introduction to Numerical Algebraic Geometry

Size: px
Start display at page:

Download "Introduction to Numerical Algebraic Geometry"

Transcription

1 Introduction to Numerical Algebraic Geometry What is possible in Macaulay2? Anton Leykin Georgia Tech Applied Macaulay2 tutorials, Georgia Tech, July 2017

2 Polynomial homotopy continuation Target system: n equations in n variables, F (x) =(f 1 (x),...,f n (x)) = 0, where f i 2 R = C[x] =C[x 1,...,x n ] for i =1,...,n. Start system: n equations in n variables: G(x) =(g 1 (x),...,g n (x)) = 0, such that it is easy to solve. Homotopy: for 2 C \{0} consider H(x,t)=(1 t)g(x)+ tf(x), t 2 [0, 1].

3 Numerical linear algebra under the hood: from polynomial systems to ODEs target start f 1 = x 4 1x 2 +5x 2 1x x g 1 = x f 2 = x 2 1 x 1 x 2 + x 2 8 g 2 = x {target solutions} {start solutions} H(x,t)=0implies dx dt

4 Continuation in a nutshell: lifting paths from B to V. The covering map, : V! B, from total space, the set of pairs (problem, solution), V = {(a, x) 2 B C x 3 a =0} to base space, a parameterized space of problems, B = {a 2 C x 3 a =0has 3 solutions} = C \ D, where D = {0} is the branch locus. Target system F and start system G are points in the base space B. Usually it is necessary to randomize a path in B to avoid the branch locus D. All ingredients in this picture are up to discussion. How to construct a suitable family? How to choose a start system?

5 Global picture Optimal homotopy: the continuation paths are regular; the homotopy establishes a bijection between the start and target solutions. Possible singular scenarios: non-generic diverging paths multiple solutions

6 Global picture Optimal homotopy: the continuation paths are regular; the homotopy establishes a bijection between the start and target solutions. Possible singular scenarios: non-generic diverging paths multiple solutions

7 Randomization: For all but finite number of 2 C the homotopy H(x,t)=(1 t)g(x)+ tf (x). is regular for 0 apple t<1. Book: Sommese and Wampler, The numerical solution of systems of polynomials (2005). Software: PHCpack (Verschelde); HOM4PS (group of T.Y.Li); Bertini (group of Sommese); NAG4M2: Numerical Algebraic Geometry for Macaulay2 (L.). New framework: MonodromySolver (Du, Hill, Jensen, Lee, L., and Sommars). Poster by Kisun Lee next Monday (at reception) Talk by Tim Du next Friday (10:30-10:55, Skiles 255)

8 Randomization: For all but finite number of 2 C the homotopy H(x,t)=(1 t)g(x)+ tf (x). is regular for 0 apple t<1. Book: Sommese and Wampler, The numerical solution of systems of polynomials (2005). Software: PHCpack (Verschelde); HOM4PS (group of T.Y.Li); Bertini (group of Sommese); NAG4M2: Numerical Algebraic Geometry for Macaulay2 (L.). New framework: MonodromySolver (Du, Hill, Jensen, Lee, L., and Sommars). Poster by Kisun Lee next Monday (at reception) Talk by Tim Du next Friday (10:30-10:55, Skiles 255)

9 Higher-dimensional solution sets Let I =(f 1,...,f N ) be an ideal of C[x 1,...,x n ]. Goal: Understandthevariety X = V(I) ={x 2 C n 8f 2 I, f(x) =0}. A witness set for an equidimensional component Y of X: ageneric slicing planel with dim L =codimy witness points w Y,L = Y \ L (generators of I)

10 Numerical irreducible decomposition Homotopy mapping w Y,L! w Y,L 0: f(x) H L,L 0, (x,t)= (1 t)l(x)+ tl 0 (x), t 2 [0, 1]. L L Monodromy action: a permutation on w Y,L is produced by homotopy H L,L0, followed by H L 0,L, 0 for random, 0 2 C. Irreducible decomposition: a partition of the witness set w Y,L stable under this action.

11 Dependencies Macaulay2 core implements its own fast homotopy continuation. The interfaces are optional! M2 core (C++) NumericalAlgebraicGeometry PHCpack NumericalHilbert Bertini SLPexpressions NAGtypes

12 Related numerical packages Classical numerical AG functionality: core dependencies: NAGtypes and SLPexpressions Macaulay dual spaces: NumericalHilbert (Krone) interfaces: PHCpack (Verschelde, Gross, Petrovic) and Bertini (Rodriguez, Gross, Bates, L.) Applications and advanced functionality: MonodromySolver (Du, Hill, Jensen, Lee, L., Sommars) NumericalCertification (Lee) NumericalImplicitization (Chen, Kileel) NumericalSchubertCalculus (L., Verschelde, del Campo, Sottile, Vakil)...

13 Applications Kinematics: robot systems. Tropical geometry: tropical curves s 2 `3 `4 p 3 `1 `2 s 1 Computer vision: minimal problems Enumerative AG: Schubert calculus

Tutorial: Numerical Algebraic Geometry

Tutorial: Numerical Algebraic Geometry Tutorial: Numerical Algebraic Geometry Back to classical algebraic geometry... with more computational power and hybrid symbolic-numerical algorithms Anton Leykin Georgia Tech Waterloo, November 2011 Outline

More information

Factoring Solution Sets of Polynomial Systems in Parallel

Factoring Solution Sets of Polynomial Systems in Parallel Factoring Solution Sets of Polynomial Systems in Parallel Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA Email: jan@math.uic.edu URL: http://www.math.uic.edu/~jan

More information

Numerical Algebraic Geometry: Theory and Practice

Numerical Algebraic Geometry: Theory and Practice Numerical Algebraic Geometry: Theory and Practice Andrew Sommese University of Notre Dame www.nd.edu/~sommese In collaboration with Daniel Bates (Colorado State University) Jonathan Hauenstein (University

More information

Numerical Computations in Algebraic Geometry. Jan Verschelde

Numerical Computations in Algebraic Geometry. Jan Verschelde Numerical Computations in Algebraic Geometry Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu AMS

More information

Certified predictor-corrector tracking for Newton homotopies

Certified predictor-corrector tracking for Newton homotopies Certified predictor-corrector tracking for Newton homotopies Jonathan D. Hauenstein Alan C. Liddell, Jr. March 11, 2014 Abstract We develop certified tracking procedures for Newton homotopies, which are

More information

Solving Polynomial Systems by Homotopy Continuation

Solving Polynomial Systems by Homotopy Continuation Solving Polynomial Systems by Homotopy Continuation Andrew Sommese University of Notre Dame www.nd.edu/~sommese Algebraic Geometry and Applications Seminar IMA, September 13, 2006 Reference on the area

More information

Numerical local irreducible decomposition

Numerical local irreducible decomposition Numerical local irreducible decomposition Daniel A. Brake, Jonathan D. Hauenstein, and Andrew J. Sommese Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre

More information

Toolboxes and Blackboxes for Solving Polynomial Systems. Jan Verschelde

Toolboxes and Blackboxes for Solving Polynomial Systems. Jan Verschelde Toolboxes and Blackboxes for Solving Polynomial Systems Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu

More information

Numerical Local Irreducible Decomposition

Numerical Local Irreducible Decomposition Numerical Local Irreducible Decomposition Daniel Brake, with Jonathan Hauenstein Andrew Sommese November 12, 2015 Numerical Algebraic Geometry I would describe Numerical Algebraic Geometry as the use of

More information

arxiv: v1 [math.ag] 28 Dec 2016

arxiv: v1 [math.ag] 28 Dec 2016 SOLVING PARAMETERIZED POLYNOMIAL SYSTEMS WITH DECOMPOSABLE PROJECTIONS CARLOS AMÉNDOLA AND JOSE ISRAEL RODRIGUEZ arxiv:1612.08807v1 [math.ag] 28 Dec 2016 Abstract. The Galois/monodromy group of a parameterized

More information

Numerical Algebraic Geometry and Symbolic Computation

Numerical Algebraic Geometry and Symbolic Computation Numerical Algebraic Geometry and Symbolic Computation Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA jan@math.uic.edu www.math.uic.edu/~jan ISSAC

More information

The Numerical Solution of Polynomial Systems Arising in Engineering and Science

The Numerical Solution of Polynomial Systems Arising in Engineering and Science The Numerical Solution of Polynomial Systems Arising in Engineering and Science Jan Verschelde e-mail: jan@math.uic.edu web: www.math.uic.edu/ jan Graduate Student Seminar 5 September 2003 1 Acknowledgements

More information

arxiv: v4 [math.ag] 16 Apr 2018

arxiv: v4 [math.ag] 16 Apr 2018 Solving polynomial systems via homotopy continuation and monodromy arxiv:1609.08722v4 [math.ag] 16 Apr 2018 Timothy Duff Georgia Tech Kisun Lee Georgia Tech Cvetelina Hill Georgia Tech Anton Leykin Georgia

More information

David Eklund. May 12, 2017

David Eklund. May 12, 2017 KTH Stockholm May 12, 2017 1 / 44 Isolated roots of polynomial systems Let f 1,..., f n C[x 0,..., x n ] be homogeneous and consider the subscheme X P n defined by the ideal (f 1,..., f n ). 2 / 44 Isolated

More information

Roots of a Polynomial System

Roots of a Polynomial System Roots of a Polynomial System (Com S 477/577 Notes) Yan-Bin Jia Sep 8, 017 Systems of polynomial equations show up in many applications areas such as robotics (kinematics, motion planning, collision detection,

More information

Solving Schubert Problems with Littlewood-Richardson Homotopies

Solving Schubert Problems with Littlewood-Richardson Homotopies Solving Schubert Problems with Littlewood-Richardson Homotopies Jan Verschelde joint work with Frank Sottile and Ravi Vakil University of Illinois at Chicago Department of Mathematics, Statistics, and

More information

Quaternion Data Fusion

Quaternion Data Fusion Quaternion Data Fusion Yang Cheng Mississippi State University, Mississippi State, MS 39762-5501, USA William D. Banas and John L. Crassidis University at Buffalo, State University of New York, Buffalo,

More information

GALOIS GROUPS OF SCHUBERT PROBLEMS VIA HOMOTOPY COMPUTATION

GALOIS GROUPS OF SCHUBERT PROBLEMS VIA HOMOTOPY COMPUTATION GALOIS GROUPS OF SCHUBERT PROBLEMS VIA HOMOTOPY COMPUTATION ANTON LEYKIN AND FRANK SOTTILE Abstract. Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical

More information

Exactness in numerical algebraic computations

Exactness in numerical algebraic computations Exactness in numerical algebraic computations Dan Bates Jon Hauenstein Tim McCoy Chris Peterson Andrew Sommese Wednesday, December 17, 2008 MSRI Workshop on Algebraic Statstics Main goals for this talk

More information

Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation

Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation Jan Verschelde joint with Nathan Bliss, Jeff Sommars, and Xiangcheng Yu University of Illinois at Chicago Department of Mathematics,

More information

Demonstration Examples Jonathan D. Hauenstein

Demonstration Examples Jonathan D. Hauenstein Demonstration Examples Jonathan D. Hauenstein 1. ILLUSTRATIVE EXAMPLE For an illustrative first example of using Bertini [1], we solve the following quintic polynomial equation which can not be solved

More information

Perturbed Regeneration for Finding All Isolated Solutions of Polynomial Systems

Perturbed Regeneration for Finding All Isolated Solutions of Polynomial Systems Perturbed Regeneration for Finding All Isolated Solutions of Polynomial Systems Daniel J. Bates a,1,, Brent Davis a,1, David Eklund b, Eric Hanson a,1, Chris Peterson a, a Department of Mathematics, Colorado

More information

REAL ALGEBRAIC GEOMETRY FOR GEOMETRIC CONSTRAINTS

REAL ALGEBRAIC GEOMETRY FOR GEOMETRIC CONSTRAINTS ArXiV.org/1606.03127, 9 June 2016 REAL ALGEBRAIC GEOMETRY FOR GEOMETRIC CONSTRAINTS FRANK SOTTILE Abstract. Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study

More information

Bertini: A new software package for computations in numerical algebraic geometry

Bertini: A new software package for computations in numerical algebraic geometry Bertini: A new software package for computations in numerical algebraic geometry Dan Bates University of Notre Dame Andrew Sommese University of Notre Dame Charles Wampler GM Research & Development Workshop

More information

Algorithms for Tensor Decomposition via Numerical Homotopy

Algorithms for Tensor Decomposition via Numerical Homotopy Algorithms for Tensor Decomposition via Numerical Homotopy Session on Algebraic Geometry of Tensor Decompositions August 3, 2013 This talk involves joint work and discussions with: Hirotachi Abo Dan Bates

More information

Multitasking Polynomial Homotopy Continuation in PHCpack. Jan Verschelde

Multitasking Polynomial Homotopy Continuation in PHCpack. Jan Verschelde Multitasking Polynomial Homotopy Continuation in PHCpack Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu

More information

REGENERATION, LOCAL DIMENSION, AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY. A Dissertation. Submitted to the Graduate School

REGENERATION, LOCAL DIMENSION, AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY. A Dissertation. Submitted to the Graduate School REGENERATION, LOCAL DIMENSION, AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY A Dissertation Submitted to the Graduate School of the University of Notre Dame in Partial Fulfillment of the Requirements

More information

Solving Boundary Value Problems with Homotopy Continuation

Solving Boundary Value Problems with Homotopy Continuation Solving Boundary Value Problems with Homotopy Continuation Gene Allgower Colorado State University Andrew Sommese University of Notre Dame Dan Bates University of Notre Dame Charles Wampler GM Research

More information

Regeneration Homotopies for Solving Systems of Polynomials

Regeneration Homotopies for Solving Systems of Polynomials Regeneration Homotopies for Solving Systems of Polynomials Jonathan D. Hauenstein Andrew J. Sommese Charles W. Wampler October 27, 2009 Abstract We present a new technique, based on polynomial continuation,

More information

SOLVING SCHUBERT PROBLEMS WITH LITTLEWOOD-RICHARDSON HOMOTOPIES

SOLVING SCHUBERT PROBLEMS WITH LITTLEWOOD-RICHARDSON HOMOTOPIES Mss., 22 January 2010, ArXiv.org/1001.4125 SOLVING SCHUBERT PROBLEMS WITH LITTLEWOOD-RICHARDSON HOMOTOPIES FRANK SOTTILE, RAVI VAKIL, AND JAN VERSCHELDE Abstract. We present a new numerical homotopy continuation

More information

Numerical computation of the genus of an irreducible curve within an algebraic set

Numerical computation of the genus of an irreducible curve within an algebraic set Numerical computation of the genus of an irreducible curve within an algebraic set Dan Bates Chris Peterson Andrew J. Sommese Charles W. Wampler March 21, 2007 Abstract The common zero locus of a set of

More information

A Blackbox Polynomial System Solver on Parallel Shared Memory Computers

A Blackbox Polynomial System Solver on Parallel Shared Memory Computers A Blackbox Polynomial System Solver on Parallel Shared Memory Computers Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science The 20th Workshop on

More information

Calculus II. Monday, March 13th. WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20

Calculus II. Monday, March 13th. WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20 Announcements Calculus II Monday, March 13th WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20 Today: Sec. 8.5: Partial Fractions Use partial fractions to

More information

Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials

Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials Daniel J. Bates Jonathan D. Hauenstein Christopher Peterson Andrew J. Sommese June 30, 2008 Abstract Let A be

More information

A NUMERICAL LOCAL DIMENSION TEST FOR POINTS ON THE SOLUTION SET OF A SYSTEM OF POLYNOMIAL EQUATIONS

A NUMERICAL LOCAL DIMENSION TEST FOR POINTS ON THE SOLUTION SET OF A SYSTEM OF POLYNOMIAL EQUATIONS A NUMERICAL LOCAL DIMENSION TEST FOR POINTS ON THE SOLUTION SET OF A SYSTEM OF POLYNOMIAL EQUATIONS DANIEL J. BATES, JONATHAN D. HAUENSTEIN, CHRIS PETERSON, AND ANDREW J. SOMMESE Abstract. The solution

More information

Homotopy Methods for Solving Polynomial Systems tutorial at ISSAC 05, Beijing, China, 24 July 2005

Homotopy Methods for Solving Polynomial Systems tutorial at ISSAC 05, Beijing, China, 24 July 2005 Homotopy Methods for Solving Polynomial Systems tutorial at ISSAC 05, Beijing, China, 24 July 2005 Jan Verschelde draft of March 15, 2007 Abstract Homotopy continuation methods provide symbolic-numeric

More information

NUMERICAL COMPUTATION OF GALOIS GROUPS

NUMERICAL COMPUTATION OF GALOIS GROUPS Draft, May 25, 2016 NUMERICAL COMPUTATION OF GALOIS GROUPS JONATHAN D. HAUENSTEIN, JOSE ISRAEL RODRIGUEZ, AND FRANK SOTTILE Abstract. The Galois/monodromy group of a family of geometric problems or equations

More information

An intrinsic homotopy for intersecting algebraic varieties

An intrinsic homotopy for intersecting algebraic varieties An intrinsic homotopy for intersecting algebraic varieties Andrew J. Sommese Jan Verschelde Charles W. Wampler September 2, 2004 Abstract Recently we developed a diagonal homotopy method to compute a numerical

More information

numerical Schubert calculus

numerical Schubert calculus numerical Schubert calculus 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

NECKLACES COUNT POLYNOMIAL PARAMETRIC OSCULANTS TAYLOR BRYSIEWICZ. 1. Introduction

NECKLACES COUNT POLYNOMIAL PARAMETRIC OSCULANTS TAYLOR BRYSIEWICZ. 1. Introduction NECKLACES COUNT POLYNOMIAL PARAMETRIC OSCULANTS TAYLOR BRYSIEWICZ arxiv:1807.03408v1 [math.ag] 9 Jul 2018 Abstract. We consider the problem of geometrically approximating a complex analytic curve in the

More information

A Blackbox Polynomial System Solver on Parallel Shared Memory Computers

A Blackbox Polynomial System Solver on Parallel Shared Memory Computers A Blackbox Polynomial System Solver on Parallel Shared Memory Computers Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science 851 S. Morgan Street

More information

Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property

Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property Noah S. Daleo 1 and Jonathan D. Hauenstein 2 1 Department of Mathematics, North Carolina State University,

More information

Math 152 Take Home Test 1

Math 152 Take Home Test 1 Math 5 Take Home Test Due Monday 5 th October (5 points) The following test will be done at home in order to ensure that it is a fair and representative reflection of your own ability in mathematics I

More information

Math 107H Fall 2008 Course Log and Cumulative Homework List

Math 107H Fall 2008 Course Log and Cumulative Homework List Date: 8/25 Sections: 5.4 Math 107H Fall 2008 Course Log and Cumulative Homework List Log: Course policies. Review of Intermediate Value Theorem. The Mean Value Theorem for the Definite Integral and the

More information

Solving Polynomial Systems Equation by Equation

Solving Polynomial Systems Equation by Equation Solving Polynomial Systems Equation by Equation Andrew J. Sommese Jan Verschelde Charles W. Wampler 23 January 2006 Abstract By a numerical continuation method called a diagonal homotopy, one can compute

More information

on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems

on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems Jan Verschelde joint work with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer

More information

Polyhedral Methods for Positive Dimensional Solution Sets

Polyhedral Methods for Positive Dimensional Solution Sets Polyhedral Methods for Positive Dimensional Solution Sets Danko Adrovic and Jan Verschelde www.math.uic.edu/~adrovic www.math.uic.edu/~jan 17th International Conference on Applications of Computer Algebra

More information

HOMOTOPIES FOR INTERSECTING SOLUTION COMPONENTS OF POLYNOMIAL SYSTEMS

HOMOTOPIES FOR INTERSECTING SOLUTION COMPONENTS OF POLYNOMIAL SYSTEMS HOMOTOPIES FOR INTERSECTING SOLUTION COMPONENTS OF POLYNOMIAL SYSTEMS ANDREW J SOMMESE, JAN VERSCHELDE, AND CHARLES W WAMPLER Abstract We show how to use numerical continuation to compute the intersection

More information

Numerical Irreducible Decomposition

Numerical Irreducible Decomposition Numerical Irreducible Decomposition Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA e-mail: jan@math.uic.edu web: www.math.uic.edu/ jan CIMPA

More information

The calibrated trifocal variety

The calibrated trifocal variety The calibrated trifocal variety Joe Kileel May 7, 2014 This document represents an ongoing project to computationally study the so-called calibrated trifocal variety, started in Bernd Sturmfels spring

More information

Tropical Algebraic Geometry 3

Tropical Algebraic Geometry 3 Tropical Algebraic Geometry 3 1 Monomial Maps solutions of binomial systems an illustrative example 2 The Balancing Condition balancing a polyhedral fan the structure theorem 3 The Fundamental Theorem

More information

AN INEQUALITY OF KOSTKA NUMBERS AND GALOIS GROUPS OF SCHUBERT PROBLEMS arxiv: v1 [math.co] 27 May 2012

AN INEQUALITY OF KOSTKA NUMBERS AND GALOIS GROUPS OF SCHUBERT PROBLEMS arxiv: v1 [math.co] 27 May 2012 AN INEQUALITY OF KOSTKA NUMBERS AND GALOIS GROUPS OF SCHUBERT PROBLEMS arxiv:5.597v1 [math.co] 7 May CHRISTOPHER J. BROOKS, ABRAHAM MARTÍN DEL CAMPO, AND FRANK SOTTILE Abstract. We show that the Galois

More information

ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS

ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS TOMS, to appear 7 September 2011 ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS JONATHAN D. HAUENSTEIN AND FRANK SOTTILE Abstract. Smale s α-theory uses estimates related to the convergence

More information

CALTECH ALGEBRAIC GEOMETRY SEMINAR: A GEOMETRIC LITTLEWOOD-RICHARDSON RULE RAVI VAKIL

CALTECH ALGEBRAIC GEOMETRY SEMINAR: A GEOMETRIC LITTLEWOOD-RICHARDSON RULE RAVI VAKIL CALTECH ALGEBRAIC GEOMETRY SEMINAR: A GEOMETRIC LITTLEWOOD-RICHARDSON RULE RAVI VAKIL ABSTRACT. I will describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection

More information

Linear Algebra III Lecture 11

Linear Algebra III Lecture 11 Linear Algebra III Lecture 11 Xi Chen 1 1 University of Alberta February 13, 2015 Outline Minimal Polynomial 1 Minimal Polynomial Minimal Polynomial The minimal polynomial f (x) of a square matrix A is

More information

Absolute Factorization

Absolute Factorization Absolute Factorization 1 Linear Traces factoring a polynomial in two variables 2 Adjacent Minors an example from algebraic statistics 3 Changing Coordinates avoiding wrong factorizations 4 Monodromy Actions

More information

Integration of Rational Functions by Partial Fractions

Integration of Rational Functions by Partial Fractions Title Integration of Rational Functions by MATH 1700 MATH 1700 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 2 / 11 Rational functions A rational function is one of the form where P and Q are

More information

Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm

Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm Anton Leykin and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois

More information

Integration of Rational Functions by Partial Fractions

Integration of Rational Functions by Partial Fractions Title Integration of Rational Functions by Partial Fractions MATH 1700 December 6, 2016 MATH 1700 Partial Fractions December 6, 2016 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 Partial Fractions

More information

Real solutions to systems of polynomial equations and parameter continuation

Real solutions to systems of polynomial equations and parameter continuation Real solutions to systems of polynomial equations and parameter continuation Zachary A. Griffin Jonathan D. Hauenstein May 7, 2013 Abstract Given a parameterized family of polynomial equations, a fundamental

More information

TRACE TEST. x 3 +y 3 =3xy. collinear traces. Figure 1. Witness sets and the trace test for the folium of Descartes

TRACE TEST. x 3 +y 3 =3xy. collinear traces. Figure 1. Witness sets and the trace test for the folium of Descartes TRACE TEST ANTON LEYKIN, JOSE ISRAEL RODRIGUEZ, AND FRANK SOTTILE arxiv:1608.00540v3 [math.ag] 26 May 2017 Abstract. The trace test in numerical algebraic geometry verifies the completeness of a witness

More information

Solving Polynomial Systems Equation by Equation

Solving Polynomial Systems Equation by Equation Solving Polynomial Systems Equation by Equation arxiv:math/0503688v1 [math.na] 29 Mar 2005 Andrew J. Sommese Jan Verschelde Charles W. Wampler March 29, 2005 Abstract By a numerical continuation method

More information

GALOIS GROUPS OF SCHUBERT PROBLEMS. A Dissertation ABRAHAM MARTIN DEL CAMPO SANCHEZ

GALOIS GROUPS OF SCHUBERT PROBLEMS. A Dissertation ABRAHAM MARTIN DEL CAMPO SANCHEZ GALOIS GROUPS OF SCHUBERT PROBLEMS A Dissertation by ABRAHAM MARTIN DEL CAMPO SANCHEZ Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for

More information

8.3 Partial Fraction Decomposition

8.3 Partial Fraction Decomposition 8.3 partial fraction decomposition 575 8.3 Partial Fraction Decomposition Rational functions (polynomials divided by polynomials) and their integrals play important roles in mathematics and applications,

More information

computing an irreducible decomposition of A B looking for solutions where the Jacobian drops rank

computing an irreducible decomposition of A B looking for solutions where the Jacobian drops rank Diagonal Homotopies 1 Intersecting Solution Sets computing an irreducible decomposition of A B 2 The Singular Locus looking for solutions where the Jacobian drops rank 3 Solving Systems restricted to an

More information

MATH 2554 (Calculus I)

MATH 2554 (Calculus I) MATH 2554 (Calculus I) Dr. Ashley K. University of Arkansas February 21, 2015 Table of Contents Week 6 1 Week 6: 16-20 February 3.5 Derivatives as Rates of Change 3.6 The Chain Rule 3.7 Implicit Differentiation

More information

Preface. 2. Show the reader how to use Bertini to solve polynomial systems efficiently and interpret the output correctly.

Preface. 2. Show the reader how to use Bertini to solve polynomial systems efficiently and interpret the output correctly. Preface Applications Systems of polynomial equations are a common occurrence in problem formulations in engineering, science, and mathematics. Solution sets of such systems, i.e., algebraic sets, are well-behaved,

More information

Quality Up in Polynomial Homotopy Continuation

Quality Up in Polynomial Homotopy Continuation Quality Up in Polynomial Homotopy Continuation Jan Verschelde joint work with Genady Yoffe University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/

More information

Math 141: Lecture 11

Math 141: Lecture 11 Math 141: Lecture 11 The Fundamental Theorem of Calculus and integration methods Bob Hough October 12, 2016 Bob Hough Math 141: Lecture 11 October 12, 2016 1 / 36 First Fundamental Theorem of Calculus

More information

Homotopy Techniques for Tensor Decomposition and Perfect Identifiability

Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Luke Oeding Auburn University with Hauenstein (Notre Dame), Ottaviani (Firenze) and Sommese (Notre Dame) Oeding (Auburn) Homotopy

More information

Chordal networks of polynomial ideals

Chordal networks of polynomial ideals Chordal networks of polynomial ideals Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint work with Pablo

More information

Math 162: Calculus IIA

Math 162: Calculus IIA Math 62: Calculus IIA Final Exam ANSWERS December 9, 26 Part A. (5 points) Evaluate the integral x 4 x 2 dx Substitute x 2 cos θ: x 8 cos dx θ ( 2 sin θ) dθ 4 x 2 2 sin θ 8 cos θ dθ 8 cos 2 θ cos θ dθ

More information

RESTRICTIONS ON GALOIS GROUPS OF SCHUBERT PROBLEMS. A Dissertation by ROBERT LEE WILLIAMS

RESTRICTIONS ON GALOIS GROUPS OF SCHUBERT PROBLEMS. A Dissertation by ROBERT LEE WILLIAMS RESTRICTIONS ON GALOIS GROUPS OF SCHUBERT PROBLEMS A Dissertation by ROBERT LEE WILLIAMS Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the

More information

The maximum likelihood degree of rank 2 matrices via Euler characteristics

The maximum likelihood degree of rank 2 matrices via Euler characteristics The maximum likelihood degree of rank 2 matrices via Euler characteristics Jose Israel Rodriguez University of Notre Dame Joint work with Botong Wang Algebraic Statistics 2015 University of Genoa June

More information

Munkres Chapter 9. The Fundamental Group

Munkres Chapter 9. The Fundamental Group Munkres 51. Homotopy of Paths 1 Munkres Chapter 9. The Fundamental Group Note. These supplemental notes are based on James R. Munkres Topology, 2nd edition, Prentice Hall (2000). Note. We are interested

More information

Computing Puiseux Series for Algebraic Surfaces

Computing Puiseux Series for Algebraic Surfaces Computing Puiseux Series for Algebraic Surfaces Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago 851 South Morgan (M/C 249)

More information

A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set

A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set Dan Bates Chris Peterson Andrew J. Sommese Abstract Let F 1, F 2,..., F t be multivariate polynomials (with

More information

Real Root Isolation of Polynomial Equations Ba. Equations Based on Hybrid Computation

Real Root Isolation of Polynomial Equations Ba. Equations Based on Hybrid Computation Real Root Isolation of Polynomial Equations Based on Hybrid Computation Fei Shen 1 Wenyuan Wu 2 Bican Xia 1 LMAM & School of Mathematical Sciences, Peking University Chongqing Institute of Green and Intelligent

More information

Certifying reality of projections

Certifying reality of projections Certifying reality of projections Jonathan D. Hauenstein 1, Avinash Kulkarni 2, Emre C. Sertöz 3, and Samantha N. Sherman 1 1 Department of Applied and Computational Mathematics and Statistics, University

More information

Numerically Intersecting Algebraic Varieties via Witness Sets

Numerically Intersecting Algebraic Varieties via Witness Sets Numerically Intersecting Algebraic Varieties via Witness Sets Jonathan D. Hauenstein Charles W. Wampler April 19, 2012 Abstract The fundamental construct of numerical algebraic geometry is the representation

More information

Examples of numerics in commutative algebra and algebraic geo

Examples of numerics in commutative algebra and algebraic geo Examples of numerics in commutative algebra and algebraic geometry MCAAG - JuanFest Colorado State University May 16, 2016 Portions of this talk include joint work with: Sandra Di Rocco David Eklund Michael

More information

HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method

HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method Tsung-Lin Lee, Tien-Yien Li and Chih-Hsiung Tsai January 15, 2008 Abstract HOM4PS-2.0 is a software

More information

A multivariate generalization of Prony s method

A multivariate generalization of Prony s method A multivariate generalization of Prony s method Ulrich von der Ohe joint with Stefan Kunis Thomas Peter Tim Römer Institute of Mathematics Osnabrück University SPARS 2015 Signal Processing with Adaptive

More information

An Approach for Certifying Homotopy Continuation Paths: Univariate Case

An Approach for Certifying Homotopy Continuation Paths: Univariate Case An Approach for Certifying Homotopy Continuation Paths: Univariate Case ABSTRACT Juan Xu Beihang University Beijing, China xujuan0505@126.com Homotopy continuation is a well-known approach in numerical

More information

6x 2 8x + 5 ) = 12x 8

6x 2 8x + 5 ) = 12x 8 Example. If f(x) = x 3 4x + 5x + 1, then f (x) = 6x 8x + 5 Observation: f (x) is also a differentiable function... d dx ( f (x) ) = d dx ( 6x 8x + 5 ) = 1x 8 The derivative of f (x) is called the second

More information

Stepsize control for adaptive multiprecision path tracking

Stepsize control for adaptive multiprecision path tracking Stepsize control for adaptive multiprecision path tracking Daniel J. Bates Jonathan D. Hauenstein Andrew J. Sommese Charles W. Wampler II Abstract Numerical difficulties encountered when following paths

More information

Algunos ejemplos de éxito en matemáticas computacionales

Algunos ejemplos de éxito en matemáticas computacionales Algunos ejemplos de éxito en matemáticas computacionales Carlos Beltrán Coloquio UC3M Leganés 4 de febrero de 2015 Solving linear systems Ax = b where A is n n, det(a) 0 Input: A M n (C), det(a) 0. b C

More information

Matemáticas II: Segundo del Grado en Ingeniería Aeroespacial

Matemáticas II: Segundo del Grado en Ingeniería Aeroespacial Matemáticas II: Segundo del Grado en Ingeniería Aeroespacial Sergio Blanes, Dolors Roselló Ecuaciones diferenciales y transformadas de Laplace con aplicaciones L.M. Sánchez, M.P. Legua Ref.: 211-798 Capítulo

More information

Section IV.23. Factorizations of Polynomials over a Field

Section IV.23. Factorizations of Polynomials over a Field IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent

More information

On Approximate Linearized Triangular Decompositions

On Approximate Linearized Triangular Decompositions On Approximate Linearized Triangular Decompositions Marc Moreno Maza, Greg Reid, Robin Scott and Wenyuan Wu Abstract. In this series of papers On Approximate Triangular Decompositions, we describe progress

More information

Certificates in Numerical Algebraic Geometry. Jan Verschelde

Certificates in Numerical Algebraic Geometry. Jan Verschelde Certificates in Numerical Algebraic Geometry Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu FoCM

More information

Tropical Algebraic Geometry

Tropical Algebraic Geometry Tropical Algebraic Geometry 1 Amoebas an asymptotic view on varieties tropicalization of a polynomial 2 The Max-Plus Algebra at Work making time tables for a railway network 3 Polyhedral Methods for Algebraic

More information

Tropical Approach to the Cyclic n-roots Problem

Tropical Approach to the Cyclic n-roots Problem Tropical Approach to the Cyclic n-roots Problem Danko Adrovic and Jan Verschelde University of Illinois at Chicago www.math.uic.edu/~adrovic www.math.uic.edu/~jan 3 Joint Mathematics Meetings - AMS Session

More information

Chapter Generating Functions

Chapter Generating Functions Chapter 8.1.1-8.1.2. Generating Functions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 8. Generating Functions Math 184A / Fall 2017 1 / 63 Ordinary Generating Functions (OGF) Let a n (n = 0, 1,...)

More information

A Polyhedral Method to compute all Affine Solution Sets of Sparse Polynomial Systems

A Polyhedral Method to compute all Affine Solution Sets of Sparse Polynomial Systems A Polyhedral Method to compute all Affine Solution Sets of Sparse Polynomial Systems Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois

More information

The IMA Volumes in Mathematics and its Applications

The IMA Volumes in Mathematics and its Applications The IMA Volumes in Mathematics and its Applications Volume 146 Series Editors Douglas N. Arnold Arnd Scheel Institute for Mathematics and its Applications (IMA) The Institute for Mathematics and its Applications

More information

Chapter 7: Techniques of Integration

Chapter 7: Techniques of Integration Chapter 7: Techniques of Integration MATH 206-01: Calculus II Department of Mathematics University of Louisville last corrected September 14, 2013 1 / 43 Chapter 7: Techniques of Integration 7.1. Integration

More information

Computing Puiseux Series for Algebraic Surfaces

Computing Puiseux Series for Algebraic Surfaces Computing Puiseux Series for Algebraic Surfaces Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago 851 South Morgan (M/C 249)

More information

HIGHER-ORDER DEFLATION FOR POLYNOMIAL SYSTEMS WITH ISOLATED SINGULAR SOLUTIONS

HIGHER-ORDER DEFLATION FOR POLYNOMIAL SYSTEMS WITH ISOLATED SINGULAR SOLUTIONS HIGHER-ORDER DEFLATION FOR POLYNOMIAL SYSTEMS WITH ISOLATED SINGULAR SOLUTIONS ANTON LEYKIN, JAN VERSCHELDE, AND AILING ZHAO Abstract Given an approximation to a multiple isolated solution of a system

More information

Mathematics 136 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 19 and 21, 2016

Mathematics 136 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 19 and 21, 2016 Mathematics 36 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 9 and 2, 206 Every rational function (quotient of polynomials) can be written as a polynomial

More information