Combinatorics of determinantal identities
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Includes bibliographical references (p. 125-129). === In this...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2009
|
Subjects: | |
Online Access: | http://dspace.mit.edu/handle/1721.1/43790 http://hdl.handle.net/1721.1/43790 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-43790 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-437902019-05-02T15:38:06Z Combinatorics of determinantal identities Konvalinka, Matjaž Igor Pak. Massachusetts Institute of Technology. Dept. of Mathematics. Massachusetts Institute of Technology. Dept. of Mathematics. Mathematics. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Includes bibliographical references (p. 125-129). In this thesis, we apply combinatorial means for proving and generalizing classical determinantal identities. In Chapter 1, we present some historical background and discuss the algebraic framework we employ throughout the thesis. In Chapter 2, we construct a fundamental bijection between certain monomials that proves crucial for most of the results that follow. Chapter 3 studies the first, and possibly the best-known, determinantal identity, the matrix inverse formula, both in the commutative case and in some non-commutative settings (Cartier-Foata variables, right-quantum variables, and their weighted generalizations). We give linear-algebraic and (new) bijective proofs; the latter also give an extension of the Jacobi ratio theorem. Chapter 4 is dedicated to the celebrated MacMahon master theorem. We present numerous generalizations and applications. In Chapter 5, we study another important result, Sylvester's determinantal identity. We not only generalize it to non-commutative cases, we also find a surprising extension that also generalizes the master theorem. Chapter 6 has a slightly different, representation theory flavor; it involves representations of the symmetric group, and also Hecke algebras and their characters. We extend a result on immanants due to Goulden and Jackson to a quantum setting, and reprove certain combinatorial interpretations of the characters of Hecke algebras due to Ram and Remmel. by Matjaž Konvalinka. Ph.D. 2009-07-01T16:53:37Z 2009-07-01T16:53:37Z 2008 2008 Thesis http://dspace.mit.edu/handle/1721.1/43790 http://hdl.handle.net/1721.1/43790 261340304 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/43790 http://dspace.mit.edu/handle/1721.1/7582 129 p. application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Mathematics. |
spellingShingle |
Mathematics. Konvalinka, Matjaž Combinatorics of determinantal identities |
description |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Includes bibliographical references (p. 125-129). === In this thesis, we apply combinatorial means for proving and generalizing classical determinantal identities. In Chapter 1, we present some historical background and discuss the algebraic framework we employ throughout the thesis. In Chapter 2, we construct a fundamental bijection between certain monomials that proves crucial for most of the results that follow. Chapter 3 studies the first, and possibly the best-known, determinantal identity, the matrix inverse formula, both in the commutative case and in some non-commutative settings (Cartier-Foata variables, right-quantum variables, and their weighted generalizations). We give linear-algebraic and (new) bijective proofs; the latter also give an extension of the Jacobi ratio theorem. Chapter 4 is dedicated to the celebrated MacMahon master theorem. We present numerous generalizations and applications. In Chapter 5, we study another important result, Sylvester's determinantal identity. We not only generalize it to non-commutative cases, we also find a surprising extension that also generalizes the master theorem. Chapter 6 has a slightly different, representation theory flavor; it involves representations of the symmetric group, and also Hecke algebras and their characters. We extend a result on immanants due to Goulden and Jackson to a quantum setting, and reprove certain combinatorial interpretations of the characters of Hecke algebras due to Ram and Remmel. === by Matjaž Konvalinka. === Ph.D. |
author2 |
Igor Pak. |
author_facet |
Igor Pak. Konvalinka, Matjaž |
author |
Konvalinka, Matjaž |
author_sort |
Konvalinka, Matjaž |
title |
Combinatorics of determinantal identities |
title_short |
Combinatorics of determinantal identities |
title_full |
Combinatorics of determinantal identities |
title_fullStr |
Combinatorics of determinantal identities |
title_full_unstemmed |
Combinatorics of determinantal identities |
title_sort |
combinatorics of determinantal identities |
publisher |
Massachusetts Institute of Technology |
publishDate |
2009 |
url |
http://dspace.mit.edu/handle/1721.1/43790 http://hdl.handle.net/1721.1/43790 |
work_keys_str_mv |
AT konvalinkamatjaz combinatoricsofdeterminantalidentities |
_version_ |
1719025303553048576 |