HEИндивидуална стипендия2023–2025

MapSurf · Combinatorial and Geometric Methods for Mapping Class Groups of Surfaces

„Хоризонт Европа“ — Действия „Мария Склодовска-Кюри“

Период
2023-09-01 → 2025-08-31
Финансиране от ЕС
175 920 €
Участници
2
Схема
HORIZON-TMA-MSCA-PF-EF

Линиите свързват координатора с партньорите.

Накратко на български

Групите на плитките изследват симетриите на повърхности, като например как се преплитат няколко фиксирани точки в диск. Тези математически методи помагат да се разбере как се трансформират и „разбъркват“ различните геометрични форми.

Този кратък обзор е генериран от изкуствен интелект

Кратко обяснение, генерирано от езиков модел по текста на CORDIS. Оригиналът е по-долу.

Резултати накратко

Combinatorial and Geometric Methods for Mapping Class Groups of Surfaces

In this project, we study groups called braid groups. Suppose we have a disc, and we fix n points in that disc, where n is some whole number. Let’s call this disc with n marked points D_n. We consider symmetries of this disc D_n. In this context (geometric topology) a symmetry is a transformation called a homeomorphism taking D_n back to itself. We require that the homeomorphism takes each of the n marked points to a marked point, but not necessarily to the same one. The braid group on n strands is the group of all homeomorphisms from D_n to itself, up to a natural equivalence. To visualize an example of a homeomorphism of D_n, imagine that at the left of a round cake tin, we pour vanilla batter, and at the right of the tin we pour chocolate batter. At n points in the tin, we insert a vertical skewer, and we start dragging the skewers through the cake mix, always bringing the collection of n skewers back to the same n points. Intuitively, we understand that the vanilla and chocolate batters will start to swirl together, and the more we repeat our motions, the more the two batters will get mixed. This is the principle we use to study homeomorphisms of D_n: we have some subset that is fixed at the beginning and we look at how it gets “mixed” by our homeomorphisms. However, there is an important difference with our cake example: in practice we can’t separate two cake batters which have been mixed together. On the contrary, with homeomorphisms we can also “unmix”. Indeed, every homeomorphism has an inverse which undoes its effects. Braid groups are a special case of mapping class groups of surfaces. The disc D_n with n marked points is special among surfaces because we can draw it in the plane. However, a generic surface cannot be drawn in the plane. For example, a torus is a surface that looks like a rubber ring or the surface of a doughnut. We have surfaces that look like doughnuts with arbitrarily many “holes”, and we call the number of “holes” the genus of the surface. Surfaces of genus at least 1 cannot be drawn in the plane. For surfaces of positive genus, we can still consider the group of symmetries of the surfaces, which we call the mapping class group of the surface. The fact that the disc D_n with n marked points can be drawn in the plane means that we can study braid groups in a more hands-on way than other mapping class groups. A turning point in the study of mapping class groups of surfaces was a paper of Masur and Minsky in 2000, which fits into the setting of geometric group theory. This field of mathematics aims to understand groups (coming from algebra), by how they act on spaces (coming from geometry). Masur and Minsky studied the mapping class group of a surface by looking at its action on certain geometric spaces associated to the surface. A key idea in their work is that for each surface we have a hierarchy of spaces associated to the surface, and we can understand homeomorphisms by how they act on the different spaces in this hierarchy. Masur and Minsky’s hierarchy machinery is integral in the modern study of mapping class groups, and has inspired major new directions in geometric group theory (for example, the theory of hierarchically hyperbolic spaces). Although the hierarchy machinery has been the topic of much research, it can be quite daunting to researchers who come to it for the first time. The topic of our project is to leverage the hands-on nature of the braid group to give a simple and visual description of how a hierarchy might play out in this special case.

Текст от CORDIS, на английски · Данни: CORDIS, © Европейски съюз

Цел на проекта

Given a mathematical object, a common theme is to study the symmetries of that object. In this project, the objects are compact topological surfaces, and the group of symmetries is the mapping class group.In this project, we will investigate simplicial graphs associated to surfaces, which have proved to be key tools in the study of both the algebraic and the geometric structure of mapping class groups. Studying the geometry of groups has proved to be a profound way to study their algebraic properties. We will focus on a graph called the pants graph, whose vertices represent pants decompositions of the surface (collections of homotopy classes of simple closed curves that cut the surface into spheres with three holes). The pants graph is significant not only in the study of mapping class groups, but also in studying the hyperbolic geometry of surfaces and 3-manifolds.The first part of the project is to understand how distances between vertices in the pants graph are related to the number of intersections between the corresponding pants decompositions. For a related graph, the curve graph, it is known that the distance between two vertices is bounded above by a logarithmic function of the number of intersections, but the methods do not immediately generalise to the pants graph. We will also investigate questions of computational complexity around computing distances in the pants graph. This part of the project will include a secondment at a computer science department.The second part of the project is to investigate maps from the pants graph to itself which preserve distances up to bounded error (such maps are called quasi-isometries). In a general metric space, the group of quasi-isometries is much bigger than the isometry group, but for most pants graphs, Bowditch proved that the two groups coincide, a property called quasi-isometric rigidity. We aim to prove that the same is true for three of the remaining unsolved cases.

Оригинален текст от CORDIS (на английски).

Участници

Връзки

Данни: CORDIS, © Европейски съюз