The prime power conjecture is true for \(n<2,000,000\) (Q1346725)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The prime power conjecture is true for \(n<2,000,000\) |
scientific article; zbMATH DE number 741547
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The prime power conjecture is true for \(n<2,000,000\) |
scientific article; zbMATH DE number 741547 |
Statements
The prime power conjecture is true for \(n<2,000,000\) (English)
0 references
6 April 1995
0 references
Summary: The Prime Power Conjecture (PPC) states that abelian planar difference sets of order \(n\) exist only for \(n\) a prime power. Evans and Mann verified this for cyclic difference sets for \(n\leq 1600\). In this paper we verify the PPC for \(n\leq 2,000,000\), using many necessary conditions on the group of multipliers.
0 references
prime power conjecture
0 references
abelian planar difference sets
0 references
