The finite images of finitely generated groups
By D. Segal. 2001
84 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/74742a683dcbba4c965a979c5f828455ab56d4c0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ievgen V. Bondarenko
- John S. Wilson
- Yehuda Shalom
- Miklós Abért
- Alexander Lubotzky
- Michael Larsen
- Terence Tao
- Prateek Jain
In Discrete Mathematics and Combinatorics
- Terence Tao
- Miklós Abért
- Alexander Lubotzky
- Ievgen V. Bondarenko
- John S. Wilson
- Yehuda Shalom
- Michael Larsen
- Van H. Vu
In Electrical and Electronic Engineering
- Ievgen V. Bondarenko
- John S. Wilson
- Yehuda Shalom
- Miklós Abért
- Alexander Lubotzky
- Michael Larsen
- Terence Tao
- Matthew Inglis
Citations in the corpus
- On exponential growth and uniformly exponential growth for groups (2004, methodology): “Finitely generated examples were first constructed by Neumann [9], and further groups of a similar type appear in Segal [ 12 ].”
- Group Laws and Free Subgroups in Topological Groups (2003, background): “Examples are the first Grigorchuk group [7], Wilson’s group of non-uniform exponential growth [18], Segal’s group of slow subgroup growth [11], and the group constructed by Grigorchuk and Zuk in [8], which is not in the class SG but (as Bartholdi and Virág have recently shown in [2]) is amenable.”
- A Finitary Version of Gromov’s Polynomial Growth Theorem (2009, background): “It has been shown in [25] that here no super-polynomial bound could yield the same characterization as the polynomial one, of being virtually solvable of finite rank (a remarkable result of Lubotzky, Mann and Segal [15], which relies, among other things, on Lazard’s deep p-adic analogue of Hilbert’s”
- Representation Growth of Linear Groups (2006, background): “Now if we look at V (p) = {v | v / ∈ S , v|p} i.e.”
- Finite generation of iterated wreath products (2010, methodology): “Segal [11] and others to construct certain groups with interesting properties.”