### Branched Covers of Contact Manifolds

- Series
- Dissertation Defense
- Time
- Thursday, October 10, 2013 - 12:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 170
- Speaker
- Meredith Casey – Georgia Tech

- You are here:
- Home
- News & Events

- Series
- Dissertation Defense
- Time
- Thursday, October 10, 2013 - 12:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 170
- Speaker
- Meredith Casey – Georgia Tech

- Series
- Dissertation Defense
- Time
- Friday, June 21, 2013 - 10:00 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Farbod Shokrieh – School of Mathematics, Georgia Tech

**Please Note:** Advisor: Dr. Matthew Baker

We study various binomial and monomial ideals related to the theory of
divisors, orientations, and matroids on graphs. We use ideas from potential
theory on graphs and from the theory of Delaunay decompositions for lattices
to describe minimal polyhedral cellular free resolutions for these ideals.
We will show that the resolutions of all these ideals are closely related
and that their Betti tables coincide. As corollaries we give conceptual
proofs of conjectures and questions posed by Postnikov and Shapiro, by
Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various
other results related in the theory of chip-firing games on graphs --
including Merino's proof of Biggs' conjecture and Baker-Shokrieh's
characterization of reduced divisors in terms of potential theory -- also
follow immediately from our general techniques and results.

- Series
- Dissertation Defense
- Time
- Monday, April 29, 2013 - 15:00 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Jingfang Liu – School of Mathematics, Georgia Tech

- Series
- Dissertation Defense
- Time
- Thursday, April 25, 2013 - 13:30 for 2 hours
- Location
- Skiles 005
- Speaker
- Ke Yin – School of Mathematics, Georgia Tech

- Series
- Dissertation Defense
- Time
- Tuesday, March 26, 2013 - 16:00 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Kai Ni – School of Mathematics, Georgia Tech

- Series
- Dissertation Defense
- Time
- Tuesday, February 5, 2013 - 15:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- James Scurry – Georgia Tech

- Series
- Dissertation Defense
- Time
- Tuesday, December 4, 2012 - 15:00 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Huijun Feng – School of Mathematics, Georgia Tech

- Series
- Dissertation Defense
- Time
- Monday, November 5, 2012 - 12:30 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 005
- Speaker
- Jinyong Ma – School of Mathematics, Georgia Tech

This work studies two topics in sequence analysis. In the first part, we
investigate the large deviations of the shape of the random RSK Young
diagrams, associated with a random word of size n whose letters are
independently drawn from an alphabet of size m=m(n). When the letters are
drawn uniformly and when both n and m converge together to infinity, m
not growing too fast with respect to n, the large deviations of the shape
of the Young diagrams are shown to be the same as that of the spectrum of
the traceless GUE. Since the length of the top row of the Young diagrams is
the length of the longest (weakly) increasing subsequence of the random
word, the corresponding large deviations follow. When the letters are drawn
with non-uniform probability, a control of both highest probabilities will
ensure that the length of the top row of the diagrams satisfies a large
deviation principle. In either case, speeds and rate functions are
identified. To complete this first part, non-asymptotic concentration bounds
for the length of the top row of the diagrams are obtained.
In the second part, we investigate the order of the r-th, 1\le r <
+\infty, central moment of the length of the longest common subsequence of
two independent random words of size n whose letters are identically
distributed and independently drawn from a finite alphabet. When all but one
of the letters are drawn with small probabilities, which depend on the size
of the alphabet, the r-th central moment is shown to be of order
n^{r/2}. In particular, when r=2, the order of the variance is linear.

- Series
- Dissertation Defense
- Time
- Thursday, November 1, 2012 - 13:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Arash Asadi – Math, GT

Please see http://www.aco.gatech.edu/dissert/asadi.html for further details.

- Series
- Dissertation Defense
- Time
- Tuesday, August 14, 2012 - 13:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Luke Postle – Math, GT

Details can be found at http://www.aco.gatech.edu/dissert/postle.html.