![]() |
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 > Short loxodromics in graph products
Short loxodromics in graph productsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Macarena Arenas. Let G be a finitely generated group, with finite generating set S. Suppose G contains elements with some property that we’re interested in. Can we find elements with this property uniformly quickly in G? That is, does S^n contain an element with this property for a bounded n? We will discuss this question for graph products, where the elements we are looking for are ones with nice hyperbolic properties, such as loxodromic and Morse elements. We will also talk about consequences for the growth of these groups. This is joint work with Elia Fioravanti. 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 listsBiophysical Techniques Lecture Series 2019 BRC Seminar Series Office of Scholarly CommunicationOther talks'An indirect way of detecting viruses: MDA5 guards against infection by surveying cellular RNA homeostasis' Data validation through anomaly detection for Gaia DR4 Bohnenblust--Hille inequalities and low-degree learning The Social Stratification of Ur III Umma The story of nature: A human history A bound on the quantum value of all compiled nonlocal games |