L3

We also state some connections to some open problems.

This is intended as an introductory talk about one of the most

important (and most geometric) aspects of Geometric Group Theory. No

prior knowledge of any maths will be assumed.

In Riemannian geometry there are several notions of rank

defined for non-positively curved manifolds and with natural extensions

for groups acting on non-positively curved spaces.

The talk shall explain how various notions of rank behave for

mapping class groups of surfaces. This is joint work with J. Behrstock.

Graphs and digraphs behave quite differently, and many classical results for graphs are often trivially false when extended to general digraphs. Therefore it is usually necessary to restrict to a smaller family of digraphs to obtain meaningful results. One such very natural family is Eulerian digraphs, in which the in-degree equals out-degree at every vertex.

In this talk, we discuss several natural parameters for Eulerian digraphs and study their connections. In particular, we show that for any Eulerian digraph G with n vertices and m arcs, the minimum feedback arc set (the smallest set of arcs whose removal makes G acyclic) has size at least $m^2/2n^2+m/2n$, and this bound is tight. Using this result, we show how to find subgraphs of high minimum degrees, and also long cycles in Eulerian digraphs. These results were motivated by a conjecture of Bollob\'as and Scott.

Joint work with Ma, Shapira, Sudakov and Yuster

It is very well known that every graph on $n$ vertices and $m$ edges admits a bipartition of size at least $m/2$. This bound can be improved to $m/2 + (n-1)/4$ for connected graphs, and $m/2 + n/6$ for graphs without isolated vertices, as proved by Edwards, and Erd\"os, Gy\'arf\'as, and Kohayakawa, respectively. A bisection of a graph is a bipartition in which the size of the two parts differ by at most 1. We prove that graphs with maximum degree $o(n)$ in fact admit a bisection which asymptotically achieves the above bounds.These results follow from a more general theorem, which can also be used to answer several questions and conjectures of Bollob\'as and Scott on judicious bisections of graphs.
Joint work with Po-Shen Loh and Benny Sudakov

This is a report of joint work with T. Koppe, P. Majumdar, and K.

 Ray.

I will define new partition functions for theories with targets on toric

singularities via

products of old partition functions on  crepant resolutions. I will

present explicit examples 

and show that the  new partition functions turn out to be homogeneous on

MacMahon factors.