國立高雄大學圖資館 |

Language: English

Back

Combinatorial Problems Related to Optimal Transport and Parking Functions /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial Problems Related to Optimal Transport and Parking Functions /Jan Kretschmann.
Author:	Kretschmann, Jan,
Description:	1 electronic resource (138 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 85-07, Section: B.
Notes:	Advisors: Willenbring, Jeb F.; Harris, Pamela E. Committee members: Bell, Allen; Stockbridge, Richard; Spade, David.
Contained By:	Dissertations Abstracts International85-07B.
Subject:	Mathematics.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30817645
ISBN:	9798381376326

Combinatorial Problems Related to Optimal Transport and Parking Functions /
Kretschmann, Jan,

Combinatorial Problems Related to Optimal Transport and Parking Functions /Jan Kretschmann. - 1 electronic resource (138 pages)

Source: Dissertations Abstracts International, Volume: 85-07, Section: B.

In the first part of this work, we provide contributions to optimal transport through work on the discrete Earth Mover's Distance (EMD). We provide a new formula for the mean EMD by computing three different formulas for the sum of width-one matrices: the first two formulas apply the theory of abstract simplicial complexes and result from a shelling of the order complex, whereas the last formula uses Young tableaux. Subsequently, we employ this result to compute the EMD under different cost matrices satisfying the Monge property. Additionally, we use linear programming to compute the EMD under non-Monge cost matrices, giving an interpretation of the EMD as a distance measure on pie charts. Furthermore, we generalize our result to the n-dimensional EMD, by providing two different formulas for the sum of width-one tensors: once approaching the problem from the perspective of Young tableaux and once through the theory of abstract simplicial complexes by shelling of the n-dimensional order complex.In the second part, we provide contributions to the topic of parking functions. We provide background on the topic and show a connection to the first part of this work through certain statistics on parking functions used in the shuffle conjecture. Furthermore, we provide enumerative formulas for different generalizations of parking functions, allowing cars to have varying lengths. Additionally, we show a surprising connection between certain restricted parking objects and the Quicksort algorithm. At last, we will use the intersection of a subset of parking functions and Fubini rankings to characterize and enumerate Boolean algebras in the weak Bruhat order of Sn.

English

ISBN: 9798381376326Subjects--Topical Terms:

184409
Mathematics.
Subjects--Index Terms:

Abstract simplicial complexes

Combinatorial Problems Related to Optimal Transport and Parking Functions /
LDR:03271nmm a22004453i 4500 001 676279
005 20250420214333.5
006 m o d
007 cr|nu||||||||
008 250901s2023 miu||||||m |||||||eng d
020 $a 9798381376326
035 $a (MiAaPQD)AAI30817645
035 $a AAI30817645
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Kretschmann, Jan, $e author. $0 (orcid)0000-0002-0053-8957 $3 990025
245 1 0 $a Combinatorial Problems Related to Optimal Transport and Parking Functions / $c Jan Kretschmann.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 1 electronic resource (138 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: Dissertations Abstracts International, Volume: 85-07, Section: B.
500 $a Advisors: Willenbring, Jeb F.; Harris, Pamela E. Committee members: Bell, Allen; Stockbridge, Richard; Spade, David.
502 $b Ph.D. $c The University of Wisconsin - Milwaukee $d 2023.
520 $a In the first part of this work, we provide contributions to optimal transport through work on the discrete Earth Mover's Distance (EMD). We provide a new formula for the mean EMD by computing three different formulas for the sum of width-one matrices: the first two formulas apply the theory of abstract simplicial complexes and result from a shelling of the order complex, whereas the last formula uses Young tableaux. Subsequently, we employ this result to compute the EMD under different cost matrices satisfying the Monge property. Additionally, we use linear programming to compute the EMD under non-Monge cost matrices, giving an interpretation of the EMD as a distance measure on pie charts. Furthermore, we generalize our result to the n-dimensional EMD, by providing two different formulas for the sum of width-one tensors: once approaching the problem from the perspective of Young tableaux and once through the theory of abstract simplicial complexes by shelling of the n-dimensional order complex.In the second part, we provide contributions to the topic of parking functions. We provide background on the topic and show a connection to the first part of this work through certain statistics on parking functions used in the shuffle conjecture. Furthermore, we provide enumerative formulas for different generalizations of parking functions, allowing cars to have varying lengths. Additionally, we show a surprising connection between certain restricted parking objects and the Quicksort algorithm. At last, we will use the intersection of a subset of parking functions and Fubini rankings to characterize and enumerate Boolean algebras in the weak Bruhat order of Sn.
546 $a English
590 $a School code: 0263
650 4 $a Mathematics. $3 184409
650 4 $a Applied mathematics. $3 377601
650 4 $a Theoretical physics. $3 708751
653 $a Abstract simplicial complexes
653 $a Optimal transport
653 $a Parking functions
653 $a Young tableaux
653 $a Quicksort algorithm
690 $a 0405
690 $a 0753
690 $a 0364
710 2 $a The University of Wisconsin - Milwaukee. $b Mathematics. $e degree granting institution. $3 990026
720 1 $a Willenbring, Jeb F. $e degree supervisor.
720 1 $a Harris, Pamela E. $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 85-07B.
790 $a 0263
791 $a Ph.D.
792 $a 2023
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30817645