The prime power conjecture is true for \(n<2,000,000\)

zbMath0814.05015MaRDI QIDQ1346725

Daniel M. Gordon

Publication date: 6 April 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_1/volume1.html#R6

zbMATH Keywords

prime power conjectureabelian planar difference sets

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13)

Related Items (7)

Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza ⋮ Difference bases in cyclic groups ⋮ Transitive projective planes and insoluble groups ⋮ Uniqueness of some cyclic projective planes ⋮ Ordinary graphs and subplane partitions ⋮ New results on modular Golomb rulers, optical orthogonal codes and related structures ⋮ On difference sets with small \(\lambda \)

This page was built for publication: The prime power conjecture is true for \(n<2,000,000\)