Full Record

Author | Hein, Nickolas Jason |

Title | Reality and Computation in Schubert Calculus |

URL | http://hdl.handle.net/1969.1/151084 |

Publication Date | 2013 |

Date Available | 2013-12-16 20:02:29 |

Date Accessioned | 2013-12-16 20:02:29 |

University/Publisher | Texas A&M University |

Abstract | The Mukhin-Tarasov-Varchenko Theorem (previously the Shapiro Conjecture) asserts that a Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. When conjectured, it sparked interest in real osculating Schubert calculus, and computations played a large role in developing the surrounding theory. Our purpose is to uncover generalizations of the Mukhin-Tarasov-Varchenko Theorem, proving them when possible. We also improve the state of the art of computationally solving Schubert problems, allowing us to more effectively study ill-understood phenomena in Schubert calculus. We use supercomputers to methodically solve real osculating instances of Schubert problems. By studying over 300 million instances of over 700 Schubert problems, we amass data significant enough to reveal generalizations of the Mukhin-Tarasov- Varchenko Theorem and compelling enough to support our conjectures. Combining algebraic geometry and combinatorics, we prove some of these conjectures. To improve the efficiency of solving Schubert problems, we reformulate an instance of a Schubert problem as the solution set to a square system of equations in a higher- dimensional space. During our investigation, we found the number of real solutions to an instance of a symmetrically defined Schubert problem is congruent modulo four to the number of complex solutions. We proved this congruence, giving a generalization of the Mukhin-Tarasov-Varchenko Theorem and a new invariant in enumerative real algebraic geometry. We also discovered a family of Schubert problems whose number of real solutions to a real osculating instance has a lower bound depending only on the number of defining flags with real osculation points. We conclude that our method of computational investigation is effective for uncovering phenomena in enumerative real algebraic geometry. Furthermore, we point out that our square formulation for instances of Schubert problems may facilitate future experimentation by allowing one to solve instances using certifiable numerical methods in lieu of more computationally complex symbolic methods. Additionally, the methods we use for proving the congruence modulo four and for producing an |

Subjects/Keywords | Schubert Calculus; Square Systems; Certification; Real Algebraic Geometry; Computational Algebraic Geometry; Enumerative Algebraic Geometry |

Contributors | Sottile, Frank (advisor); Landsberg, Joseph (committee member); Rojas, J. Maurice (committee member); Amato, Nancy (committee member) |

Language | en |

Country of Publication | us |

Record ID | handle:1969.1/151084 |

Repository | tamu |

Date Indexed | 2017-09-06 |

Issued Date | 2013-06-21 00:00:00 |