Dr. Eero Räty

Biography

Eero Räty works in the Department of Mathematics and Mathematical Statistics at Umeå University. His main research focuses include extremal probabilistic combinatorics, specifically the MaxCut problem, first-order convergence laws, and structured permutation classes. The MaxCut problem aims to determine the largest possible size of a cut in graph theory, seeking the maximum number of edges that can be crossed by the partition of a vertex set into disjoint subsets. His research is closely related to variations of this problem, including bisection width and positive discrepancy, with applications in theoretical computer science. Eero has made significant contributions by improving lower bounds related to positive discrepancy graphs and examining problems mainly through a combinatorial lens, utilizing tools from linear algebra. He received a Swedish Research Council Starting Grant for his project on discrepancies and other extremal problems for graphs. His educational background includes a Master of Mathematics from Trinity College, University of Cambridge, followed by a PhD in Pure Mathematics from the same institution. Currently, he is a Postdoctoral scholar at Umeå University and has been involved in teaching courses related to the foundations of logic and model theory as well as problem-solving and competition mathematics.

Research Interests

Experience