On the existence of cyclic difference sets with small parameters
Leonard D. Baumert, Daniel M. Gordon
Abstract
Previous surveys by Baumert and Lopez and Sanchez have resolved the existence of cyclic (v,k,lambda) difference sets with k <= 150, except for six open cases. In this paper we show that four of those difference sets do not exist. We also look at the existence of difference sets with k <= 300 and cyclic Hadamard difference sets with v <= 10,000. Finally, we extend an earlier search of the second author to show that no cyclic projective planes exist with non-prime power orders up to two billion.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.