|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/5010
|
| Title: | A Puzzle-Based Synthesis Algorithm For a Triple Intersection of Schubert Varieties |
| Authors: | Brown, Andrew Alexander Harold |
| Keywords: | Schubet Calculus
Littlewood-Richardson rule
Puzzle
Synthesis |
| Approved Date: | 29-Jan-2010 |
| Date Submitted: | 28-Jan-2010 |
| Abstract: | This thesis develops an algorithm for the Schubert calculus of the Grassmanian.
Specifically, we state a puzzle-based, synthesis algorithm for a triple
intersection of Schubert varieties. Our algorithm is a reformulation of the
synthesis algorithm by Bercovici, Collins, Dykema, Li, and Timotin. We replace
their combinatorial approach, based on specialized Lebesgue measures,
with an approach based on the puzzles of Knutson, Tao and Woodward.
The use of puzzles in our algorithm is beneficial for several reasons, foremost
among them being the larger body of work exploiting puzzles. To understand
the algorithm, we study the necessary Schubert calculus of the Grassmanian
to define synthesis. We also discuss the puzzle-based Littlewood-Richardson
rule, which connects puzzles to triple intersections of Schubert varieties. We
also survey three combinatorial objects related to puzzles in which we include
a puzzle-based construction, by King, Tollu, and Toumazet, of the well
known Horn inequalities. |
| Program: | Combinatorics and Optimization |
| Department: | Combinatorics and Optimization |
| Degree: | Master of Mathematics |
| URI: | http://hdl.handle.net/10012/5010 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
