Previous Conferences & Workshops

Although the existence of a symplectic filling is well-understood for many contact 3-manifolds, complete classifications of all symplectic fillings of a particular contact manifold are more rare. Relying on a recognition theorem of McDuff for closed...

Let \(G\) be a finite group, and let \(a\), \(b\), \(c\),... be independent random elements of \(G\), chosen at uniform distribution. What is the distribution of the element obtained by a fixed word in the letters \(a\), \(b\), \(c\),..., such as \...

The chromatic number \(k(G)\) of a graph \(G\) is always at least the size of its largest clique (denoted by \(w(G)\)), and there are graphs with \(w(G)=2\) and \(k(G)\) arbitrarily large. On the other hand, the perfect graph theorem asserts that if...