Notes

A summmary proof that the uniform spanning tree on a graph is a determinantal process, with the explicit derivation of the kernel. The proof presented is originally due to Benjamini-Lyons-Peres-Schramm

Notes on Hamiltonian Systems, by Tom Alberts

Main Result This note is about Cauchy matrices of the form $$ M = M(\mathbf{a}, \mathbf{b}) = \left( \frac{1}{a_i - b_j} \right)_{1 \leq i, j \leq n} $$ where $\mathbf{a}, \mathbf{b} \in \mathbb{C}^n$.