Keller's conjecture for certain finite groups (Q1178929)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Keller's conjecture for certain finite groups
scientific article

    Statements

    Keller's conjecture for certain finite groups (English)
    0 references
    0 references
    26 June 1992
    0 references
    If \(G\) is a finite abelian group written additively, \(g\) is an element of \(G\), and \(n\geq 2\) is an integer, we denote the set \(\{0,g,\dots,(n- 1)g\}\) by \([g,n]\). If \(A_ 1,\dots,A_ m\) are subsets of \(G\), we say that \(A_ 1+\dots+A_ m\) is a factorization of \(G\) if each element of \(G\) has exactly one representation as a sum \(a_ 1+\dots+a_ m\), where \(a_ i\in A_ i\) for \(i=1,\dots,m\). Also, if \(B\) and \(C\) are subsets of \(G\), we let \(B-C\) denote the set of all differences \(b-c\) between elements \(b\in B\) and \(c\in C\). The group-theoretical form of Keller's conjecture is as follows: For all finite abelian groups \(G\), if \(H+[x_ 1,r_ 1]+\dots+[x_ m,r_ m]\) is a factorization of \(G\), then for some \(i\in \{1,\dots,m\}\), we have \(r_ ix_ i\in H-H\). \textit{A. D. Sands} [Proc. Edinb. Math. Soc., II. Ser. 22, 17-21 (1979; Zbl 0407.20042)] showed that Keller's conjecture holds for cyclic groups of order \(p^ aq^ b\), where \(p\) and \(q\) are distinct primes. \textit{K. Corrádi} and \textit{S. Szabó} [J. Algebra 119, 213-217 (1988; Zbl 0656.20058)] showed this for abelian groups of type \((p^ a,p^ b)\), \(p\) prime. In the paper under review the author adapts a method of Corrádi and Szabó to give a short proof of the above two results and to prove that the conjecture holds for abelian groups of type \((p^ a,p^ b,p,\dots,p)\), \(p\) prime, and for abelian groups of type \((p^ a,p^ b,q,\dots,q)\), where \(p\) and \(q\) are distinct primes and \(p\geq 5\).
    0 references
    0 references
    finite abelian groups
    0 references
    factorization
    0 references
    Keller's conjecture
    0 references

    Identifiers

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