Bordered Floer homology, due to Lipshitz, Ozsváth, and Thurston, is a Heegaard Floer homology theory for 3-manifolds with connected boundary. This theory associates to the boundary surface (with suitable parameterization) a differential graded algebra A(Z). Our invariant comes in two versions: a left differential (type D) module over A(Z), or its dual, a right A-infinity (type A) module over A(Z). In this talk, we will focus on the case of 3-manifolds with torus boundary, and will explicitly describe how to compute type D structures of knot complements.
TBA
In this talk we will explore the interplay between tropical convexity and its classical counterpart. In particular, we will focus on the tropical convex hull of convex sets and polyhedral complexes. We give a vertex description of the tropical convex hull of a line segment and of a ray in Rn/R1 and show that tropical convex hull and classical convex hull commute in R3/R1. Finally, we prove results on the dimension of tropical convex fans and give an upper bound on the dimension of the tropical convex hull of tropical curves under certain hypothesis.
The talk will be held online via Bluejeans, use the following link to join the meeting.
Please Note: The seminar is held in BlueJeans: https://bluejeans.com/900271747
A central question in ergodic theory is whether sequences obtained by sampling along the orbits of a given dynamical system behave similarly to sequences of i.i.d. random variables. Here we consider this question from a spectral-theoretic perspective. Specifically, we study large Hermitian matrices whose entries are defined by evaluating the exponential function along orbits of the skew-shift on the 2-torus with irrational frequency. We prove that their global eigenvalue distribution converges to the Wigner semicircle law, a hallmark of random matrix statistics, which evidences the quasi-random nature of the skew-shift dynamics. This is joint work with Arka Adhikari and Horng-Tzer Yau.
An edge-colored graph $G$ is called \textit{rainbow} if every edge of $G$ receives a different color. The \textit{anti-Ramsey} number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [{\em J. Graph Theory, 2016}] conjectured that for any fixed $t$, $r(n,t)=\binom{n-2}{2}+t$ whenever $n\geq 2t+2 \geq 6$. We show their conjecture is true and also determine $r(n,t)$ when $n = 2t+1$. Together with previous results, this gives the anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees for all values of $n$ and $t$. Joint work with Linyuan Lu.
