國立虎尾科技大學 |

Combinatorial Analysis of Continuous Problems.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Combinatorial Analysis of Continuous Problems./
Author:	Tsukerman, Emmanuel.
Description:	1 online resource (75 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
Contained By:	Dissertation Abstracts International78-12B(E).
Subject:	Applied mathematics. -
Online resource:	click for full text (PQDT)
ISBN:	9780355263046

Combinatorial Analysis of Continuous Problems.
Tsukerman, Emmanuel.

Combinatorial Analysis of Continuous Problems. - 1 online resource (75 pages)

Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

Many objects in mathematics, at first sight, seem to belong to the domain of continuous mathematics. These objects are continuous, smooth and infinite, far different from the discrete and finite objects that are the classical domain of combinatorics. Objects of the former type are, for instance, determinants of matrices (which can take on every complex value), Grassmannians (which are smooth manifolds), and the eigenvalues of matrices (which take on any tuple of complex values). In the latter class lie objects such as paths in graphs, finite groups and generating functions. Applications of the study of such finite objects to the continuous ones would seem unlikely, or at least, trivial. For example, one may count the number of minors of a matrix, but that's about it. As we will demonstrate, however, this is not the case. The field of combinatorics has developed into a mature field of study, and it is the author's view that combinatorics can be used as a toolbox to obtain interesting and deep information on all areas of mathematics, continuous especially.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355263046Subjects--Topical Terms:

1069907
Applied mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Combinatorial Analysis of Continuous Problems.
LDR:03587ntm a2200361Ki 4500 001 909686
005 20180426091043.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355263046
035 $a (MiAaPQ)AAI10255190
035 $a (MiAaPQ)berkeley:16783
035 $a AAI10255190
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Tsukerman, Emmanuel. $3 1180587
245 1 0 $a Combinatorial Analysis of Continuous Problems.
264 0 $c 2017
300 $a 1 online resource (75 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
500 $a Advisers: Bernd Sturmfels; Lauren Williams.
502 $a Thesis (Ph.D.) $c University of California, Berkeley $d 2017.
504 $a Includes bibliographical references
520 $a Many objects in mathematics, at first sight, seem to belong to the domain of continuous mathematics. These objects are continuous, smooth and infinite, far different from the discrete and finite objects that are the classical domain of combinatorics. Objects of the former type are, for instance, determinants of matrices (which can take on every complex value), Grassmannians (which are smooth manifolds), and the eigenvalues of matrices (which take on any tuple of complex values). In the latter class lie objects such as paths in graphs, finite groups and generating functions. Applications of the study of such finite objects to the continuous ones would seem unlikely, or at least, trivial. For example, one may count the number of minors of a matrix, but that's about it. As we will demonstrate, however, this is not the case. The field of combinatorics has developed into a mature field of study, and it is the author's view that combinatorics can be used as a toolbox to obtain interesting and deep information on all areas of mathematics, continuous especially.
520 $a In this work, we will demonstrate this by studying three different continuous problems using the techniques of combinatorics. The first problem concerns the study of symmetric matrices and their principal- and almost-principal minors. Here the main result is a proof of a conjectural combinatorial formula of Kenyon and Pemantle (2014) for the entries of a square matrix in terms of its connected principal and almost-principal minors. The second problem is the study of Bruhat interval polytopes. These polytopes arise as the moment-map images of Richardson varieties of flag varieties. Their study is motivated in part by the integrable system called the Toda lattice. Information obtained about these polytopes can be readily translated to information about the Richardson varieties. For instance, the dimension of the polytope will be used to determine when the Richardson variety is toric. The third problem will pertain to the study of the spectral theory of tensors via tropical methods. We show that an elegant theory in which there is a unique tropical eigenvalue arises. We describe briefly how the corresponding eigenvalue informs us of the asymptotic behavior of the corresponding classical eigenvalues.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Mathematics. $3 527692
655 7 $a Electronic books. $2 local $3 554714
690 $a 0364
690 $a 0405
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, Berkeley. $b Mathematics. $3 1180510
773 0 $t Dissertation Abstracts International $g 78-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10255190 $z click for full text (PQDT)