The Kakeya and restriction conjectures are two of the central
open problems in Euclidean Fourier analysis (with the second
logically implying the first, and progress on the first typically
implying progress on the second). Both of these have...
The Depth First Search (DFS) algorithm is one of the most
standard graph exploration algorithms, used normally to find the
connected components of an input graph. Though perhaps less popular
than its sister algorithm, Breadth First Search (BFS)...
Fluctuations of the current of one dimensional non equilibrium
diffusive systems are well understood. After a short review of the
one dimensional results, the talk will try to show that the
statistics of these fluctuations are exactly the same in...
