<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:46:21Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5010" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5010</identifier><datestamp>2017-03-21T16:31:47Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="6a3e1bdd-93f2-408e-b412-a319bd97dfe6" confidence="600">Brown, Andrew Alexander Harold</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-01-29T19:27:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-01-29T19:27:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-01-29T19:27:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010-01-28</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5010</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis develops an algorithm for the Schubert calculus of the Grassmanian.&#xd;
Specifically, we state a puzzle-based, synthesis algorithm for a triple&#xd;
intersection of Schubert varieties. Our algorithm is a reformulation of the&#xd;
synthesis algorithm by Bercovici, Collins, Dykema, Li, and Timotin. We replace&#xd;
their combinatorial approach, based on specialized Lebesgue measures,&#xd;
with an approach based on the puzzles of Knutson, Tao and Woodward.&#xd;
The use of puzzles in our algorithm is beneficial for several reasons, foremost&#xd;
among them being the larger body of work exploiting puzzles. To understand&#xd;
the algorithm, we study the necessary Schubert calculus of the Grassmanian&#xd;
to define synthesis. We also discuss the puzzle-based Littlewood-Richardson&#xd;
rule, which connects puzzles to triple intersections of Schubert varieties. We&#xd;
also survey three combinatorial objects related to puzzles in which we include&#xd;
a puzzle-based construction, by King, Tollu, and Toumazet, of the well&#xd;
known Horn inequalities.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Schubet Calculus</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Littlewood-Richardson rule</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Puzzle</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Synthesis</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A Puzzle-Based Synthesis Algorithm For a Triple Intersection of Schubert Varieties</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>