Previous Conferences & Workshops

Via four applications: distribution modeling, probability estimation, data compression, and classification, we argue that when learning from data, discrete values should be ignored except for just their appearance-order pattern. Along the way, we...

We consider an open quantum system consisting of two spins 1/2 (qubits) interacting with thermal reservoirs (environments). Each spin is coupled to its own local reservoir, and the spins are coupled to a common third reservoir (collective coupling)...

We will explain how toroidal compactifications of certain Kuga families of abelian varieties over integral models of PEL-type Shimura varieties, including for example all those products of universal abelian schemes, can be constructed by a uniform...

We discuss the dynamics of soliton-like solutions of the nonlinear Schroedinger-Gross Pitaevskii equation. After a review of basic results, we outline recent work on the large time energy distribution in multimoded systems and on gap-solitons...

We formulate several new boundary value problems for the 2D Navier-Stokes system. In all cases, we obtain quantitative decay estimates of the Fourier modes for both the vorticity and the velocity. In some special cases we found that the Fourier...

Planarity is a central theme in graph theory and combinatorial geometry, dating back to Euler. There are many beautiful characterizations of planar graphs such as Kuratowski's forbidden minor theorem and Koebe's circle packing theorem from the 1930s...

I will discuss a lower bound of $\omega(n^(k/4))$ on the size of constant-depth $(AC_0)$ circuits solving the k-clique problem on n-vertex graphs. This bound follows from a stronger result that $AC_0$ circuits of size $O(n^(k/4))$ almost surely fail...