Events & Seminars

2019 May 21

Special groups theory seminar: Abdalrazzaq R A Zalloum (Suny Buffalo) "Regular languages for hyperbolic-like geodesics".

4:00pm to 5:00pm

Location: 

Ross 63
Combinatorial group theory began with Dehn's study of surface groups, where he used arguments from hyperbolic geometry to solve the word/conjugacy problems. In 1984, Cannon generalized those ideas to all "hyperbolic groups", where he was able to give a solution to the word/conjugacy problem, and to show that their growth function satisfies a finite linear recursion. The key observation that led to his discoveries is that the global geometry of a hyperbolic group is determined locally: first, one discovers the local picture of G, then the recursive structure
2019 May 21

Special groups theory seminar: Abdalrazzaq R A Zalloum (Suny Buffalo) "Regular languages for hyperbolic-like geodesics".

4:00pm to 5:00pm

Location: 

Ross 63
Combinatorial group theory began with Dehn's study of surface groups, where he used arguments from hyperbolic geometry to solve the word/conjugacy problems. In 1984, Cannon generalized those ideas to all "hyperbolic groups", where he was able to give a solution to the word/conjugacy problem, and to show that their growth function satisfies a finite linear recursion. The key observation that led to his discoveries is that the global geometry of a hyperbolic group is determined locally: first, one discovers the local picture of G, then the recursive structure
2019 May 13

NT & AG Seminar: "A dream desingularization algorithm", Michael Temkin (HU)

2:30pm to 4:00pm

Location: 

Ross 70
Abstract: Any birational geometer would agree that the best algorithm for resolution of singularities should run by defining a simple invariant of the singularity and iteratively blowing up its maximality locus. The only problem is that already the famous example of Whitney umbrella shows that this is impossible, and all methods following Hironaka had to use some history and resulted in more complicated algorithms. Nevertheless, in a recent work with Abramovich and Wlodarczyk we did construct such an algorithm, and an independent description of a similar
2019 May 07

Anatoly Vershik (St. Petersburg) Соmbinatorial (locally finite) еncoding of the Bernoulli processes with infinite entropy.

2:00pm to 3:00pm

Abstract. The realization of m.p automorphisms as transfer on the space of the paths on the graded graphs allows to use new kind of encoding of one-sided Bernoulli shift. I will start with simple example how to realize Bernoulli shift in the locally finite space (graph) $\prod_n {1,2,\dots n}$ (triangle compact.) Much more complicated example connected to old papers by S.Kerov-Vershik and recent by Romik-Sniady in which one-sided Bernoulli shift is realized as Schutzenberger transfer on the space of infinite Young tableaux with Plancherel Measure. These examples open series of

Pages