Sequences of words characterizing finite solvable groups. (Q833316): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6534273
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00605-008-0034-6 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3816169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities for finite solvable groups and equations in finite simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of finite soluble groups by laws in a small number of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF FINITE SOLUBLE GROUPS BY LAWS IN TWO VARIABLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Betti numbers in arbitrary characteristic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of doubly transitive groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsolvable finite groups all of whose local subgroups are solvable / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00605-008-0034-6 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: A computer algebra solution to a problem in finite groups. / rank
 
Normal rank
Property / Recommended article: A computer algebra solution to a problem in finite groups. / qualifier
 
Similarity Score: 0.7804534
Amount0.7804534
Unit1
Property / Recommended article: A computer algebra solution to a problem in finite groups. / qualifier
 
Property / Recommended article
 
Property / Recommended article: A CHARACTERIZATION OF FINITE SOLUBLE GROUPS BY LAWS IN TWO VARIABLES / rank
 
Normal rank
Property / Recommended article: A CHARACTERIZATION OF FINITE SOLUBLE GROUPS BY LAWS IN TWO VARIABLES / qualifier
 
Similarity Score: 0.7505544
Amount0.7505544
Unit1
Property / Recommended article: A CHARACTERIZATION OF FINITE SOLUBLE GROUPS BY LAWS IN TWO VARIABLES / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4790431 / rank
 
Normal rank
Property / Recommended article: Q4790431 / qualifier
 
Similarity Score: 0.7426468
Amount0.7426468
Unit1
Property / Recommended article: Q4790431 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Two-variable identities for finite solvable groups. / rank
 
Normal rank
Property / Recommended article: Two-variable identities for finite solvable groups. / qualifier
 
Similarity Score: 0.73061866
Amount0.73061866
Unit1
Property / Recommended article: Two-variable identities for finite solvable groups. / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4459086 / rank
 
Normal rank
Property / Recommended article: Q4459086 / qualifier
 
Similarity Score: 0.7271153
Amount0.7271153
Unit1
Property / Recommended article: Q4459086 / qualifier
 
Property / Recommended article
 
Property / Recommended article: ON n-ENGEL PAIR SATISFYING CERTAIN CONDITIONS / rank
 
Normal rank
Property / Recommended article: ON n-ENGEL PAIR SATISFYING CERTAIN CONDITIONS / qualifier
 
Similarity Score: 0.70535034
Amount0.70535034
Unit1
Property / Recommended article: ON n-ENGEL PAIR SATISFYING CERTAIN CONDITIONS / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3223034 / rank
 
Normal rank
Property / Recommended article: Q3223034 / qualifier
 
Similarity Score: 0.6873391
Amount0.6873391
Unit1
Property / Recommended article: Q3223034 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Characterization of finite soluble groups by laws in a small number of variables / rank
 
Normal rank
Property / Recommended article: Characterization of finite soluble groups by laws in a small number of variables / qualifier
 
Similarity Score: 0.67553574
Amount0.67553574
Unit1
Property / Recommended article: Characterization of finite soluble groups by laws in a small number of variables / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4440645 / rank
 
Normal rank
Property / Recommended article: Q4440645 / qualifier
 
Similarity Score: 0.6661189
Amount0.6661189
Unit1
Property / Recommended article: Q4440645 / qualifier
 
Property / Recommended article
 
Property / Recommended article: BURNSIDE-TYPE PROBLEMS RELATED TO SOLVABILITY / rank
 
Normal rank
Property / Recommended article: BURNSIDE-TYPE PROBLEMS RELATED TO SOLVABILITY / qualifier
 
Similarity Score: 0.6612629
Amount0.6612629
Unit1
Property / Recommended article: BURNSIDE-TYPE PROBLEMS RELATED TO SOLVABILITY / qualifier
 

Latest revision as of 18:49, 27 January 2025

scientific article
Language Label Description Also known as
English
Sequences of words characterizing finite solvable groups.
scientific article

    Statements

    Sequences of words characterizing finite solvable groups. (English)
    0 references
    0 references
    12 August 2009
    0 references
    Finite nilpotent groups can be characterised by means of the identity \([x_0,x_1,\dots,x_n]=1\) for some \(n\in\mathbb{N}\) and all \(x_i\in G\), \(0\leq i\leq n\), or, as \textit{M. Zorn} has proved [in Bull. Am. Math. Soc. 42, 485-486 (1936; JFM 62.0088.10)], by means of the Engel identity \(e_n(x,y)=1\) for \(n\in\mathbb{N}\), where \(e_1(x,y)=[x,y]\) and \(e_n(x,y)=[e_{n-1}(x,y),y]\). During many years it has been an open question whether solvability could be described by an identity involving only two variables. Recently two such sequences of words have been found: \textit{T. Bandman, G.-M. Greuel, F. Grunewald, B. Kunyavskiĭ, G. Pfister, E. Plotkin} [Compos. Math. 142, No. 3, 734-764 (2006; Zbl 1112.20016)] gave the sequences \(u_n(x,y)\) defined by \(u_1(x,y)=x^{-2}y^{-1}x\) and \(u_n(x,y)=[xu_{n-1}(x,y)^{-1}x^{-1},yu_{n-1}(x,y)^{-1}y^{-1}]\), while \textit{J. N. Bray, J. S. Wilson, R. A. Wilson} [Bull. Lond. Math. Soc. 37, No. 2, 179-186 (2005; Zbl 1075.20008)] found the sequence \(s_1(x,y)=x\), \(s_n(x,y)=[s_{n-1}(x,y)^{-y},s_{n-1}(x,y)]\). In the paper under review, solvability of finite groups is characterised in terms of the following sequences: (1) \(v_1=yx^2\), \(v_k=[v_{k-1}^{y^{-1}x^{-1}},v_{k-1}^{x^{-1}}]\);\qquad (2) \(v_1=yx^2\), \(v_k=[v_{k-1}^{y^{-1}x^{-1}},v_{k-1}^{yx}]\); (3) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}}, v_{k-1}^x]\);\qquad (4) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{y^{-1}}]\); (5) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{xyx}]\);\qquad (6) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{y^{-1}x^{-1}y^{-1}}]\). These sequences characterise soluble groups in the sense that if there is an \(n\in\mathbb{N}\) such that \(v_n(x,y)=1\) for all \(x,y\in G\), then \(G\) is soluble. A minimal counterexample to this theorem must be a simple group whose proper subgroups are soluble. These groups were classified by \textit{J. G. Thompson} [Bull. Am. Math. Soc. 74, 383-437 (1968; Zbl 0159.30804)]. Some computations with SINGULAR or MAGMA, which are detailed in the PhD Thesis of the author, among other techniques of group theory, ring theory, and algebraic geometry, are used to show that there exist \(x,y\in G\) such that \(v_1(x,y)=v_2(x,y)\) and \(v_1(x,y)\neq 1\) (Lemma~2.1). This, combined with the techniques of Bandman et al., is enough to prove the main theorem.
    0 references
    finite soluble groups
    0 references
    words
    0 references
    identities
    0 references
    finite simple groups
    0 references
    Gröbner bases
    0 references
    Engel groups
    0 references
    laws
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references