*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Title: Problems in Catalan mixing and matchings in regular hypergraphs
Time: Monday September 12, 2016, 9AM
Location: Skiles 006
Advisor:
Dr. Prasad Tetali, School of Mathematics and School of Computer Science
Committee:
Dr. Prasad Tetali, School of Mathematics and School of Computer Science
Dr. Santanu Dey, School of Industrial and Systems Engineering
Dr. Milena Mihail, School of Computer Science
Dr. Dana Randall, School of Computer Science and School of Mathematics
Dr. William Trotter, School of Mathematics
Reader:
Dr. David Galvin, Department of Mathematics, University of Notre Dame
Abstract:
This dissertation consists of two parts, falling under the closely related fields of counting and sampling.
In the first part, we explore the relationships between several natural notions of adjacency on Catalan structures and their associated random walks. We use a matroid interpretation of Dyck words of length 2n to give a new order n^2 bound on the mixing time for the transposition walk. We also give a general mixing bound for random walks on the Boolean cube when censored to remain within some large monotone subset.
In the second part, we extend several related extremal results about the number of matchings and independent sets in regular graphs. First we propose a method for tackling the Upper Matching Conjecture of Friedland, et al. for matchings of small fixed size. Next we prove a conjecture of Galvin regarding the extremal graph for number of Widom-Rowlinson configurations, a particular instance of graph homomorphisms. Finally, we make progress towards unifying the extremal bounds of Kahn, Galvin & Tetali, and Zhao for independent sets and of Davies, et al., for matchings by giving two general bounds for matchings in regular, uniform hypergraphs, improving on a similar bound due to Ordentlich & Roth.
