2013
DOI: 10.1307/mmj/1387226167
|View full text |Cite
|
Sign up to set email alerts
|

Sofic profile and computability of Cremona groups

Abstract: In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most polynomial of degree d. We also observe that finitely generated subgroups of the Cremona group have a solvable word problem. This provides examples of finitely generated groups with no embeddings into any Cremona group, answering a question of S. Cantat.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(22 citation statements)
references
References 46 publications
0
22
0
Order By: Relevance
“…In [9] are given examples of finitely generated (and even finitely presented) groups that do not admit embeddings into any Cremona group, which gives an answer to Cantat's question about the existence of such groups (see also [7]). These examples are based on Theorem 1.2 of [10], according to which the word problem is solvable in every finitely generated subgroup of any Cremona group. However, the answer to the above question -and even in a stronger form, with the addition of the condition of simplicity of the subgroup -can be obtained without using this theorem.…”
Section: Corollaries 1 and 2 Formulated Below Follow From Theorem 1 I...mentioning
confidence: 99%
See 1 more Smart Citation
“…In [9] are given examples of finitely generated (and even finitely presented) groups that do not admit embeddings into any Cremona group, which gives an answer to Cantat's question about the existence of such groups (see also [7]). These examples are based on Theorem 1.2 of [10], according to which the word problem is solvable in every finitely generated subgroup of any Cremona group. However, the answer to the above question -and even in a stronger form, with the addition of the condition of simplicity of the subgroup -can be obtained without using this theorem.…”
Section: Corollaries 1 and 2 Formulated Below Follow From Theorem 1 I...mentioning
confidence: 99%
“…Thus, in view of (2), (3), (10), (11), we have σ X = id. Hence, σ is a nonidentity element of the kernel of homomorphism (6).…”
mentioning
confidence: 97%
“…A weakness of Definition 2.3 is that it depends on the presentation of G. Following [Cor13], we can define another version of hyperlinear profile which is independent of the presentation, while still being in the spirit of Definition 2.3. Given a finite subset E of G containing the identity, let σ(E; δ, ǫ) be defined similarly to η(E; δ, ǫ), but with U(C d ) replaced by the group S d of d × d permutation matrices.…”
Section: A Presentation-independent Version Of Hyperlinear Profilementioning
confidence: 99%
“…Given a finite subset E of G containing the identity, let σ(E; δ, ǫ) be defined similarly to η(E; δ, ǫ), but with U(C d ) replaced by the group S d of d × d permutation matrices. Then σ(E) is a two-parameter version of the sofic profile defined in [Cor13]. Specifically, the sofic profile of E is (7.1) N → N ∪ {+∞} : n → σ E; 2 − 2 n , 2 n .…”
Section: A Presentation-independent Version Of Hyperlinear Profilementioning
confidence: 99%
“…cantat and j. xie group. One does not know whether groups of birational transformations share the same properties (see [14] and [21]). The following result implies Theorem C of the introduction.…”
Section: Central Extensions and Simple Groupsmentioning
confidence: 99%