Friday, November 16, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tyler Foster – Florida State University
Let K be a non-trivially valued non-Archimedean field, R its valuation subring. A formal Gubler model is a formal R-scheme that comes from a polyhedral decomposition of a tropical variety. In this talk, I will present joint work with Sam Payne in which we show that any formal model of any compact analytic domain V inside a (not necessarily projective) K-variety X can be dominated by a formal Gubler model that extends to a model of X. This result plays a central role in our work on "structure sheaves" on tropicalizations and our work on adic tropicalization. If time permits I will explain some of this work.
Friday, November 16, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Stavros Garoufalidis – Georgia Tech and MPI
I will explain some connections between the counting of incompressible surfaces in hyperbolic 3-manifolds with boundary and the 3Dindex of Dimofte-Gaiotto-Gukov. Joint work with N. Dunfield, C. Hodgson and H. Rubinstein, and, as usual, with lots of examples and patterns.
Consider a linear combination of independent identically distributed random variables $X_1, . . . , X_n$ with fixed weights $a_1, . . . a_n$. If the random variablesare continuous, the sum is almost surely non-zero. However, for discrete random variables an exact cancelation may occur with a positive probability. Thisprobability depends on the arithmetic nature of the sequence $a_1, . . . a_n$. We will discuss how to measure the relevant arithmetic properties and how to evaluate the probability of the exact and approximate cancelation.
Random matrices arise naturally in various contexts ranging from theoretical physics to computer science. In a large part of these problems, it is important to know the behavior of the spectral characteristics of a random matrix of a large but fixed size. We will discuss a recent progress in this area illustrating it by problems coming from combinatorics and computer science:
Condition number of “full” and sparse random matrices. Consider a system of linear equations Ax = b where the right hand side is known only approximately. In the process of solving this system, the error in vector b gets magnified by the condition number of the matrix A. A conjecture of von Neumann that with high probability, the condition number of an n × n random matrix with independent entries is O(n) has been proven several years ago. We will discuss this result as well as the possibility of its extension to sparse matrices.
Random matrices in combinatorics. A perfect matching in a graph with an even number of vertices is a pairing of vertices connected by edges of the graph. Evaluating or even estimating the number of perfect matchings in a given graph deterministically may be computationally expensive. We will discuss an application of the random matrix theory to estimating the number of perfect matchings in a de- terministic graph.
Random matrices and traffic jams. Adding another highway to an existing highway system may lead to worse traffic jams. This phenomenon known as Braess’ paradox is still lacking a rigorous mathematical explanation. It was recently explained for a toy model, and the explanation is based on the properties of the eigenvectors of random matrices.
(Based on joint work with Cécile Mailler)Consider a stochastic process that behaves as a d-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the time it has already spent there. This process has been analyzed in the physics literature under the name "random walk with preferential relocations", where it is argued that the position of the walker after n steps, scaled by log(n), converges to a Gaussian random variable; because of the log spatial scaling, the process is said to undergo a "slow diffusion". We generalize this model by allowing the underlying random walk to be any Markov process and the random run-lengths (time between two relocations) to be i.i.d.-distributed. We also allow the memory of the walker to fade with time, meaning that when a relocations occurs, the walker is more likely to go back to a place it has visited more recently. We prove rigorously the central limit theorem described above by associating to the process a growing family of vertex-weighted random recursive trees and a Markov chain indexed by this tree. The spatial scaling of our relocated random walk is related to the height of a typical vertex in the random tree. This typical height can range from doubly-logarithmic to logarithmic or even a power of the number of nodes of the tree, depending on the form of the memory.
Wednesday, November 14, 2018 - 16:30 for 1.5 hours (actually 80 minutes)
Location
Skiles 006
Speaker
Michael Wigal – Georgia Tech
Continuation of last week's talk. For a graph on n
vertices, a vertex partition A,B,C is a f(n)-vertex separator if |C|≤f(n) and |A|,|B|≤2n/3 and (A,B)=∅. A theorem from Gary Miller states for an embedded 2-connected planar graph with maximum face size d there exists a simple cycle such that it is vertex separator of size at most 2√dn. This has applications in divide and conquer algorithms.
Wednesday, November 14, 2018 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Rohan Ghanta – SoM Georgia Tech
We shall consider a three-dimensional Quantum Field Theory model of an electron
bound to a Coulomb impurity in a polar crystal and exposed to a homogeneous
magnetic field of strength B > 0. Using an argument of Frank and Geisinger
[Commun. Math. Phys. 338, 1-29 (2015)] we can see that as B → ∞ the ground-
state energy is described by a one-dimensional minimization problem with a delta-
function potential. Our contribution is to extend this description also to the ground-
state wave function: we shall see that as B → ∞ its electron density in the direction
of the magnetic field converges to the minimizer of the one-dimensional problem.
Moreover, the minimizer can be evaluated explicitly.
Wednesday, November 14, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Hyunki Min – Georgia Tech
Unlike
symplectic structures in 4-manioflds, contact structures are abundant in
3-dimension. Martinet showed that there exists a contact structure on any
closed oriented 3-manifold. After that Lutz showed that there exist a contact
structure in each homotopy class of plane fields. In this talk, we will review
the theorems of Lutz and Martinet.