Inequalities and Asymptotic Formulas in Algebraic Combinatorics

This thesis concerns certain inequalities and asymptotic formulas in algebraic combinatorics. It consists of two separate parts. The first part studies inequalities concerning triangular-grid billiards and plabic graphs of Lam–Postnikov essential dimension 2. The material in this part is based on jo...

Full description

Bibliographic Details
Main Author: Jiradilok, Pakawut
Other Authors: Postnikov, Alexander
Format: Thesis
Published: Massachusetts Institute of Technology 2022
Online Access:https://hdl.handle.net/1721.1/144514
_version_ 1826213150835343360
author Jiradilok, Pakawut
author2 Postnikov, Alexander
author_facet Postnikov, Alexander
Jiradilok, Pakawut
author_sort Jiradilok, Pakawut
collection MIT
description This thesis concerns certain inequalities and asymptotic formulas in algebraic combinatorics. It consists of two separate parts. The first part studies inequalities concerning triangular-grid billiards and plabic graphs of Lam–Postnikov essential dimension 2. The material in this part is based on joint work with Colin Defant. The second part studies inequalities and asymptotic formulas concerning large-scale rook placements.
first_indexed 2024-09-23T15:44:08Z
format Thesis
id mit-1721.1/144514
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T15:44:08Z
publishDate 2022
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/1445142022-08-30T03:08:28Z Inequalities and Asymptotic Formulas in Algebraic Combinatorics Jiradilok, Pakawut Postnikov, Alexander Massachusetts Institute of Technology. Department of Mathematics This thesis concerns certain inequalities and asymptotic formulas in algebraic combinatorics. It consists of two separate parts. The first part studies inequalities concerning triangular-grid billiards and plabic graphs of Lam–Postnikov essential dimension 2. The material in this part is based on joint work with Colin Defant. The second part studies inequalities and asymptotic formulas concerning large-scale rook placements. Ph.D. 2022-08-29T15:52:41Z 2022-08-29T15:52:41Z 2022-05 2022-06-07T15:33:55.267Z Thesis https://hdl.handle.net/1721.1/144514 In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology
spellingShingle Jiradilok, Pakawut
Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title_full Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title_fullStr Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title_full_unstemmed Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title_short Inequalities and Asymptotic Formulas in Algebraic Combinatorics
title_sort inequalities and asymptotic formulas in algebraic combinatorics
url https://hdl.handle.net/1721.1/144514
work_keys_str_mv AT jiradilokpakawut inequalitiesandasymptoticformulasinalgebraiccombinatorics