Geodesic
The prime power conjecture is true for \(n2,000,000\)
The electronic journal of combinatorics, Tome 1 (1994)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1186
Classification : 05B10, 11B13
Mots-clés : prime power conjecture, abelian planar difference sets 
@article{10_37236_1186,
     author = {Daniel M. Gordon},
     title = {The prime power conjecture is true for \(n<2,000,000\)},
     journal = {The electronic journal of combinatorics},
     year = {1994},
     volume = {1},
     doi = {10.37236/1186},
     zbl = {0814.05015},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1186/}
}
TY  - JOUR
AU  - Daniel M. Gordon
TI  - The prime power conjecture is true for \(n<2,000,000\)
JO  - The electronic journal of combinatorics
PY  - 1994
VL  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1186/
DO  - 10.37236/1186
ID  - 10_37236_1186
ER  - 
%0 Journal Article
%A Daniel M. Gordon
%T The prime power conjecture is true for \(n<2,000,000\)
%J The electronic journal of combinatorics
%D 1994
%V 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1186/
%R 10.37236/1186
%F 10_37236_1186
Daniel M. Gordon. The prime power conjecture is true for \(n<2,000,000\). The electronic journal of combinatorics, Tome 1 (1994). doi: 10.37236/1186

Cité par Sources :