Difference sets with \(n=2p^m\) (Q1383823): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5340151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two addition theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multipliers of difference sets / rank
 
Normal rank

Revision as of 11:03, 28 May 2024

scientific article
Language Label Description Also known as
English
Difference sets with \(n=2p^m\)
scientific article

    Statements

    Difference sets with \(n=2p^m\) (English)
    0 references
    18 July 1999
    0 references
    Multipliers are a central tool in the investigation of abelian \((v,k,\lambda)\)-difference sets. It is sometimes conjectured that for all divisors \(t\) of the order \(n=k-\lambda\) with \(\gcd(t,v)=1\), the map \(x\to x^t\) is a multiplier. However, the proofs of most multiplier theorems require some technical conditions like \(n > \lambda\). The author shows that this condition, used in the proof of a multiplier theorem of \textit{H. B. Mann} and \textit{S. K. Zaremba} [Ill. J. Math. 13, 378-382 (1969; Zbl 0174.04203)], can be removed. As a corollary, \(p\) is a multiplier of any \((v,k,\lambda)\)-difference set of order \(2p^m\), where \(p\) is an odd prime not dividing \(v\). Muzychuk also improves a multiplier theorem of Weisheng for the case that the order \(n\) is divisible by 3. The proofs use the techniques developed in McFarland's thesis.
    0 references
    difference set
    0 references
    multiplier
    0 references
    0 references
    0 references
    0 references

    Identifiers