COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Commuting probability in infinite groups
Commuting probability in infinite groupsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Maurice Chiodo. In a finite group G one can ask what the probability is that two elements chosen independently uniformly at random commute. It is clear that if G has an abelian subgroup of bounded index then this probability should be bounded from below. A beautiful theorem of Peter Neumann from the 1980s shows that the converse is also true in a certain precise sense. Antolin, Martino and Ventura consider the same question for infinite groups, choosing the two random elements with respect to a certain limit of finite probability measures. They conjecture that for any “reasonable” sequence of measures Neumann’s result should still hold. They also prove some special cases of this conjecture. In this talk I will show that the Antolin-Martino-Ventura conjecture holds with effective quantitative bounds if we take the sequence of measures defined by the successive steps of a simple random walk, or the uniform measures on a Folner sequence. I will also present a concrete interpretation of the word “reasonable” that is sufficient to force a sequence of measures to obey the conjecture. If I have time I will present an application to conjugacy growth. This talk is part of the Geometric Group Theory (GGT) Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMuseum of Zoology Design and use of chemical tools to modulate gene expression in cancer cells based on the targeting of DNA methyltransferase CEDiROther talksComparative perspectives on social inequalities in life and death: an interdisciplinary conference Joseph Banks: science, culture and the remaking of the Indo-Pacific world Positive definite kernels for deterministic and stochastic approximations of (invariant) functions Beating your final boss battle, or presenting with confidence and style (easy mode) Systems for Big Data Applications: Revolutionising personal computing |