En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 20F05 4 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

On subgroups of R. Thompson's group $F$ - Sapir, Mark (Auteur de la Conférence) | CIRM H

Post-edited

We provide two ways to show that the R. Thompson group $F$ has maximal subgroups of infinite index which do not fix any number in the unit interval under the natural action of $F$ on $(0,1)$, thus solving a problem by D. Savchuk. The first way employs Jones' subgroup of the R. Thompson group $F$ and leads to an explicit finitely generated example. The second way employs directed 2-complexes and 2-dimensional analogs of Stallings' core graphs, and gives many implicit examples. We also show that $F$ has a decreasing sequence of finitely generated subgroups $F>H_1>H_2>...$ such that $\cap H_i={1}$ and for every $i$ there exist only finitely many subgroups of $F$ containing $H_i$.[-]
We provide two ways to show that the R. Thompson group $F$ has maximal subgroups of infinite index which do not fix any number in the unit interval under the natural action of $F$ on $(0,1)$, thus solving a problem by D. Savchuk. The first way employs Jones' subgroup of the R. Thompson group $F$ and leads to an explicit finitely generated example. The second way employs directed 2-complexes and 2-dimensional analogs of Stallings' core graphs, ...[+]

20F65 ; 20E07 ; 20F05

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Generating big mapping class groups - Fanoni, Federica (Auteur de la Conférence) | CIRM H

Multi angle

The mapping class group of a surface is the group of its homeomorphisms up to homotopy. A natural question to ask is: what is a good set of generators? If the surface is compact (or more generally of finite type) there are multiple satisfactory answers. If the surface is of infinite type, the question is wide open. I will discuss this problem and present a partial (negative) result in this context. Joint work with Sebastian Hensel.

57K20 ; 20F05 ; 20F65

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Complex Hyperbolic Lattices - Parker, John R. (Auteur de la Conférence) | CIRM H

Multi angle

Lattices in SU(2,1) can be viewed in several different ways: via their geometry as holomorphic complex hyperbolic isometries, as monodromy groups of hypergeometric functions, via algebraic geometry as ball quotients and (sometimes) using arithmeticity. In this talk I will describe these different points of view using examples constructed by Deligne and Mostow and by Deraux, Paupert and myself.

22E40 ; 20F05 ; 20F36 ; 32M25

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

The classification of excursions - Mishna, Marni (Auteur de la Conférence) | CIRM H

Multi angle

Excursions are walks which start and end at prescribed locations. In this talk we consider the counting sequences of excursions, more precisely, the functional equations their generating functions satisfy. We focus on two sources of excursion problems: walks defined by their allowable steps, taken on integer lattices restricted to cones; and walks on Cayley graphs with a given set of generators. The latter is related to the cogrowth problems of groups. In both cases we are interested in relating the nature of the generating function (i.e. rational, algebraic, D-finite, etc.) and combinatorial properties of the models. We are also interested in the relation between the excursions, and less restricted families of walks.
Please note: A few corrections were made to the PDF file of this talk, the new version is available at the bottom of the page.[-]
Excursions are walks which start and end at prescribed locations. In this talk we consider the counting sequences of excursions, more precisely, the functional equations their generating functions satisfy. We focus on two sources of excursion problems: walks defined by their allowable steps, taken on integer lattices restricted to cones; and walks on Cayley graphs with a given set of generators. The latter is related to the cogrowth problems of ...[+]

05A15 ; 05C25 ; 60G50 ; 20F05

Sélection Signaler une erreur