The prime power conjecture is true for \(n<2,000,000\)
type: Item
instance of: scholarly article
title: The prime power conjecture is true for \(n<2,000,000\)
zbMATH Open document ID: 0814.05015
author: Daniel M. Gordon
published in: The Electronic Journal of Combinatorics
publication date: 1995-04-06T00:00:00Z
full work available at URL: R6
review text: 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.
Mathematics Subject Classification ID: 05B10
Mathematics Subject Classification ID: 11B13
zbMATH DE Number: 741547
zbMATH Keywords: prime power conjecture
zbMATH Keywords: abelian planar difference sets
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 741547