Finite soluble groups satisfying the swap conjecture.

DOI10.1007/S10801-015-0610-5MaRDI QIDQ902947zbMATH OpenOpenAlexWikidataFDO

Authors Andrea Lucchini

Publication date 4 January 2016

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10801-015-0610-5

zbMATH Keywords

connected graphsfinite soluble groupsgenerating graphsgraphs of generating tuplesnumbers of generatorsswap conjecture

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05)

Review text

Let \(G\) be a finite group and let \(d(G)\) be the minimal number of generators of \(G\). For any integer \(d\geq d(G)\), let \(V_d(G)=\{(g_1,\ldots,g_d)\in G^d\mid\langle g_1,\ldots,g_d\rangle=G\}\) be the set of all generating \(d\)-tuples. The ``swap graph \(\Delta_d(G)\) is considered: two vertices \((x_1,\ldots,x_d),(y_1,\ldots,y_d)\in V_d(G)\) are adjacent in the swap graph if and only if they differ only by one entry. \textit{R. F. Tennant} and \textit{E. C. Turner} [in Rocky Mt. J. Math. 22, No. 3, 1083-1095 (1992; Zbl 0790.20053)] proposed the conjecture that \(\Delta_d(G)\) is connected (``swap conjecture). The author of the current paper and \textit{E. Crestani} proved [in J. Algebra 376, 79-88 (2013; Zbl 1287.20024)] that the swap conjecture is true if \(d\geq d(G)+1\), for an arbitrary finite group. For the more difficult case when \(d=d(G)\), [in Isr. J. Math. 198, 63-74 (2013; Zbl 1300.20021)], the same authors proved that the 2-generated finite soluble groups satisfy the swap conjecture, and they also analyzed a weaker version of the swap conjecture. In the paper under review it is proved that the swap conjecture is true if \(G\) is a finite group whose derived subgroup has odd order (Theorem 1), or it is nilpotent (Corollary 3).

Recommendations

• The swap graph of the finite soluble groups
• The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.
• The swap conjecture of Tennant and Turner
• The generating graph of finite soluble groups.
• The swap conjecture

Cites work

• d-wise generation of prosolvable groups.
• Classes of Finite Groups
• Crowns and factorization of the probabilistic zeta function of a finite group.
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• The generating graph of finite soluble groups.
• The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.
• The swap conjecture
• The swap conjecture of Tennant and Turner
• Zu einem von B. H. und H. Neumann gestellten Problem

Cited in

(5)

• The swap conjecture
• The swap conjecture of Tennant and Turner
• The generating graph of a profinite group
• The swap graph of the finite soluble groups
• The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.

This page was built for publication: Finite soluble groups satisfying the swap conjecture.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902947)