On Combinatorics, Integrability and Puzzles
MetadataShow full item record
In the last decade, many old and new results in combinatorics have been shown using the theory of quantum integrable systems from particle physics. The key to solving such problems is the derivation of an underlying Yang-Baxter equation. In this thesis, we explore some of the results in this area, focusing on two proofs due to Zinn-Justin in. The first is a proof of Knutson, Tao and Woodward’s puzzle rule which states that Littlewood-Richardson coefficients count the number of tilings of an equilateral triangle with three different types of tiles. The second result concerns Knutson and Tao's product rule for two factorial Schur functions. We present an extension of Zinn-Justin's constructions to Grothendieck polynomials and close with an overview of integrable vertex models. The purpose of this thesis is to make "combinatorics and integrability" more accessible to the general mathematician and illustrate the power and elegance of these ideas.
Cite this version of the work
Timothy Miller (2020). On Combinatorics, Integrability and Puzzles. UWSpace. http://hdl.handle.net/10012/16458
Showing items related by title, author, creator and subject.
Haraldson, Joseph (University of Waterloo, 2019-08-07)This thesis is a wide ranging work on computing a “lower-rank” approximation of a matrix polynomial using second-order non-linear optimization techniques. Two notions of rank are investigated. The first is the rank as the ...
Arnold, Andrew (University of Waterloo, 2016-03-03)Interpolation is the process of learning an unknown polynomial f from some set of its evaluations. We consider the interpolation of a sparse polynomial, i.e., where f is comprised of a small, bounded number of terms. Sparse ...
Ghaddar, Bissan (University of Waterloo, 2011-08-26)Polynomial programming, a class of non-linear programming where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the past decade. Polynomial programming is ...