ISRN AlgebraVolume 2012 (2012), Article ID 367129, 19 pagesdoi:10.5402/2012/367129

Research Article

On the Existence of Difference Sets with and Is a Square

Adegoke Solomon Osifodunrin

Division of Sciences and Mathematics, Department of Mathematics, Livingstone College, Salisbury, NC 28144, USA

Received 20 January 2012; Accepted 8 February 2012

Academic Editors: A. V. Kelarev, D. Kressner, H. You, and A. Zimmermann

Copyright © 2012 Adegoke Solomon Osifodunrin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We combine Turyn's self-conjugacy result, variance technique, Dillon dihedral trick, and Sylow theorem to investigate the existence of () difference sets in which is a square and .

1. Introduction

Let be a multiplicative group of order and let be a subset of consisting of elements, where . is a nontrivial difference set if every nonidentity element can be reproduced times by the multiset . The natural number is known as the order of the difference set. The group structure determines the nature of the difference set. For instance, if the underlying group is abelian (resp., nonabelian or cyclic), then is abelian (resp., nonabelian or cyclic) difference set. The study of difference sets integrates various techniques ranging from algebraic number theory to geometry, algebra, and combinatorics [1]. There are many classical results on constructions and nonexistence of difference sets in the literature [2–14]. These results are mainly based on Hall’s multiplier concept [15] or Turyn’s self-conjugacy method [14]. Recently, Schmidt [13] developed a new method for studying combinatorial structures using group ring equations without any restrictive assumptions. Arasu [2], Arasu and Sehgal [3, 16], Baumert [4], Hughes [17], Iiams [7], Kibler [18], Kopilovich [10], Lander [11], and López and Sánchez [19] among other authors studied the existence of abelian difference sets with . They were able to either indicate the existence or otherwise of difference sets. Some of these authors also listed parameter sets that were open, whose existence or otherwise has been concluded by other authors. This paper mainly uses Turyn’s self-conjugacy approach to study a class of difference sets in which , where is a positive integer. We illustrate with examples where and the ideal generated by prime divisors of factors trivially in the respective cyclotomic rings. This assumption along with Dillon dihedral trick and Sylow theorems provide sufficient information required to decide the nonesxistence of the difference sets in some or all groups of order .

We assume that is a finite group of order . Section 2 gives a brief description of some basic results which include materials from group theory, representation, and algebraic number theories. Section 3 lists difference sets parameters that do not exist and examples of partial results of nonexistence of difference sets in groups of order .

2. Preliminaries

2.1. Difference Sets

Let be the ring of integers and be the field of complex numbers. Suppose that is a group of order and is a difference set in . We sometimes view the elements of as members of the group ring , which is a subring of the group algebra . Thus, represents both subset of and element of . The sum of inverses of elements of is . Consequently, is a difference set if and only if Suppose that is a difference set in a group of order and is a normal subgroup of . Suppose that is a homomorphism. We can extend by linearity, to the corresponding group rings. Thus, the difference set image in (also known as the contraction of with respect to the kernel ) is the multiset . Let be a left transversal of in . We can write , where the integer is known as the intersection number of with respect to . In this work, we will always use the notation for and denotes the number of times equals .

2.2. Representation and Algebraic Number Theories

A -representation of is a homomorphism, , where is the group of invertible matrices over . The positive integer is the degree of . A linear representation (character) is a representation of degree one. The set of all linear representations of is denoted by .   is an abelian group under multiplication and if is the derived group of , then is isomorphic to . Define to be a primitive th root of unity and to be the cyclotomic extension of the field of rational numbers, , where is the exponent of . Without loss of generality, we may replace by the field . Thus, the central primitive idempotents in is where is an irreducible character of .

Aliases are members of group ring which enable us to transfer information from to group algebra and then to . Let be an abelian group and let , be the set of characters of . The element is known as -alias if for and all , . Since , we can replace the occurrence of , which is a complex number by -alias, , an element of . Furthermore, two characters of are algebraic conjugate if and only if they have the same kernel and we denote the set of equivalence classes of by . The central rational idempotents in are obtained by summing over the equivalence classes on the 's under the action of the Galois group of over . That is, , .

For instance, suppose ( is prime) is a cyclic group whose characters are of the form , . Then the rational idempotents are The following is the general formula employed in the search of difference set [22].

Theorem 2.1. Let be an abelian group and be the set of equivalence classes of characters. Suppose that is a system of distinct representatives for the equivalence classes of . Then for , one has where is any -alias for .

Equation (2.4) is known as the rational idempotent decomposition of .

Suppose that is any nontrivial representation of degree and , where is the primitive root of unity. Suppose that is a nonidentity element. Then, . This shows that . Since is not an identity element, and ( is an integral domain). Consequently, , where is the identity matrix. Furthermore, if is a nontrivial representation of of degree then and .

Recall that the ring of integers of the cyclotomic field is . This ring is also an integral domain. Let , , . The number is irreducible if implies one of or is a unit. The element is prime if implies or [23]. A domain is a unique factorization domain (UFD) if factorization into irreducibles is possible and unique. In UFD, the irreducibles are also primes. In order to successfully obtain the difference set images, we need the aliases. Suppose that is an abelian factor group of exponent and is a difference set image in . If is not a principal character of , then is an algebraic equation in . The determination of the alias requires the knowledge of how the ideal generated by factors in cyclotomic ring , where is the th root of unity. If , then by (2.4), we seek such that . The task of solving the algebraic equation is sometimes made easier if we consider the factorization of principal ideals . Suppose we are able to find such that , where is the Euler -function. A theorem due to Kronecker [12, 13] states that any algebraic integer whose all conjugates have absolute value 1 must be a root of unity. We use this theorem to characterize the solutions. If there is any other solution to the algebraic equation, then it must be of the form , where is a unit.

The following result is used to determine the number of factors of an ideal in a ring: suppose is any prime and is an integer such that . Suppose that is the order of in the multiplicative group of the modular number ring . Then the number of prime ideal factors of the principal ideal in the cyclotomic integer ring is , where is the Euler -function, that is, [25]. For instance, the ideal generated by 2 has two factors in , the ideal generated by 7 has two factors in , while the ideal generated by 3 has four factors in . On the other hand, since is a power of 2, the ideal generated by 2 is said to completely ramifies as power of in .

According to Turyn [14], an integer is said to be semi-primitive modulo if for every prime factor of , there is an integer such that . In this case, −1 belongs to the multiplicative group generated by . Furthermore, is self-cosnjugate modulo if every prime divisor of is semi primitive modulo , where is the largest divisor of relatively prime to . This means that all prime ideals over in are fixed by complex conjugation. For instance, , where , 5, 10 and , , 4, 8. Thus, is fixed by conjugation in , , 4, 5, 8, 10, 50.

Remark 2.2. If in cyclotomic ring , where is an ideal and is an odd integer, then there is no solution to . To see this, assume that a exist such that . Then has factors but has odd factors.

Remark 2.3. Let us consider the ideal generated by 2 which has two factors in the cyclotomic ring . We claim that the algebraic number 2 is prime in this ring. Since (23, 11, 5) difference sets exist, and there exists such that and . This implies that and . Consequently, . Suppose that the algebraic number 2 is not prime in . As ([23], chapter 3), we seek , such that and . The equation has no integer solution. Thus, there is no algebraic number such that . In fact, has no solution, where , 3, 5, 7, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22. However, the equation has trivial solutions and , where , 3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22, 25. We noticed that since the class number of the cyclotomic ring is 3, the equation has nontrivial solutions , , and . Also, has nontrivial solutions for , 8, 12, 18, 6², 8², 12², 16², 18² and 24².

In this paper, we will use the phase factors trivially in if the ideal generated by is prime or ramifies in ; is self-conjugate modulo ; the ideal generated by has odd factors or the algebraic equation has no solution or has trivial solutions. In summary, suppose that is the difference set image of order in the cyclic factor group , where is a group with exponent . Suppose that factors trivially in and is a nontrivial representation of . Then , is the th root of unity [13].

2.3. Characteristics of Difference Set Images in Subgroup of a Group

In this subsection, we use the attributes of subgroups of a group to obtain information about the difference set image in the subgroups. Dillon [5] proved the following results which will be used to obtain difference set images in dihedral group of a certain order if the difference images in the cyclic group of same order are known.

Theorem 2.4 (dillon dihedral trick). Let be an abelian group and let be the generalized dihedral extension of . That is, . If contains a difference set, then so does every abelian group which contains as a subgroup of index 2.

Corollary 2.5. If the cyclic group does not contain a (nontrivial) difference set, then neither does the dihedral group of order .

Remark 2.6. We look at subgroup properties of a group that can aid the construction of difference set image. For the convenience of the reader, we reproduce the idea of Gjoneski et al. [26]. Suppose that is a group of order with a central involution . We take to be the transversal of in so that every element in is viewed as , , . Denote the set of all integral combinations, of elements of , by . Using the two representations of subgroup and Frobenius reciprocity theorem [27], we may write any element of the group ring in the form Furthermore, let be the group ring element created by replacing every occurrence of in by 1. Also, let be the group ring element created by replacing every occurrence of in by −1. Then where and , , . As , and are both in , and . We may equate with the homomorphic image of in . Consequently, if is a difference set, then the coefficients of in the expression for will be intersection number of in the coset [26]. In particular, it can be shown that if is a subgroup of a group such that then the difference set image in is where , is a difference set in , or , and is the size of the difference set. Equation (2.8) is true as long as or .

2.4. Amalgamation of Results

In this paper, we study difference sets in which and the ideal generated by factors trivially in the cyclotomic ring . That is, if , then up to units in . This method is very useful in the investigation of difference sets in solvable groups. A group is solvable if the sequence terminates in the identity, , in a finite number of steps, each is the derived group of the preceding one [28]. Consequently, each , the factor group is Abelian. We now state the extended Sylow theorem in solvable groups ([28], page 141).

Theorem 2.7. Let be a solvable group of order , in which . Then (1) possesses at least one subgroup of order ; (2)any two subgroups of order are conjugates;(3)any subgroup whose order divides is contained in a subgroup of order ; (4)the number of subgroups of order may be expressed as a product of factors, each of which (a) is congruent to 1 modulo some prime factor of , and (b) is a power of a prime and divides one of the chief factors of .

The next three criteria enable us to rule out the existence of difference sets.

Criterion 1. Suppose that is a group of order , where is prime, and are integers. Then does not admit if there exists a normal subgroup of such that(1), is a natural number, (2), (3) factors trivially in the cyclotomic ring , where is the th root of unity, (4)the difference set solution in is one of the forms , or , .

Proof. The nonexistence of viable difference set image in implies that does not admit difference set.

In this criterion, we may replace with if is prime power, , , and the ideal generated by factors trivially in , where is a prime divisor of (see Remark 2.3).

Criterion 2. Suppose that is a group of even order and is a factor group of with , where is prime. Let be an element of order 2 in . Then does not admit if(1), is a natural number, (2) factors trivially in the cyclotomic rings , where is th root of unity, (3)the difference set solution in is one of the forms ,   or ,  ; alternatively, the difference set image in is one of the forms ,   or ,  .

Proof. The proof follows from Criterion 1 and the fact that if , the cyclotomic rings and are the same.

Criterion 3. Suppose that is a group of order , where is prime and is an integer. Suppose that is a factor group of of order . The group does not admit difference set if there exists a normal subgroup such that and(1),   is a natural number, (2)every prime divisor of factors trivially in the cyclotomic rings , where is th root of unity, (3)the difference set solution in is of the form , and is an odd integer or (4)the difference set solution in is of the form , is an even integer, is an odd integer, and .

Proof. There are two groups of order , cyclic and dihedral groups. Since every prime divisor of factors trivially in the cyclotomic rings , , it follows that factors trivially in . Consequently, the difference set image in is of the form or . Suppose that the difference set image in is of the form and is an odd integer. Using (2.8), the difference set image in is where , is the difference set image in , with or and is the generator of . Since is odd, consists of at least odd entries while consists of at least even entries. Thus, (2.8) has no integer solutions. On the other hand, suppose that the difference set image in is of the form , is an even integer, is odd an odd integer, and . The difference set image is of the form (2.9) with . Since is even and is odd, and have two entries that are fractions. In particular, we can translate if necessary, to ensure that the coefficients of the identity in both components are and , respectively. The sum and difference of these two entries are, respectively, and . But and . Hence, is a negative integer. Thus, there is no difference set image in and the criterion follows.

Notice that there are five factor groups of order if and four factor groups if . Criterion 3 rules out the existence of difference set images in and . In addition to conditions of Criterion 3, if factors trivially also in , then three of the four or five factor groups (, and ) of order do not admit difference sets.

3. Some Difference Sets Parameters (Tables 1–5)

Table 1: Parameter sets that do not exist by Criterion 1. and parameters with asterisk indicate new results.

(, , )

Factoring of in
No. of groups of order
Solutions in

1
(115, 19, 3)
4
2
23
Remark 2.3
1

2
(1333, 37, 1)
6
2, 3
43

1

3
(221, 45, 9)
6
2, 3
17

1

4
(145, 64, 28)
6
2, 3
29
,
1

5
(1463, 86, 5)
9
3
19

1

6
(583, 97, 16)
9
3
53

1

7
(345, 129, 48)
9
3
23
Remark 2.3
1

8
(3503, 103, 3)
10
2, 5
113

1

9
(2185, 105, 5)
10
2, 5
23
Remark 2.3
1

10
(1309, 109, 9)
10
2, 5
17

1

11
(1037, 112, 12)
10
2, 5
61

1

(621, 125, 25)
10
2, 5
69
2 factors trivially in ,
5
in ; None in

13
(469, 144, 44)
10
2, 5
67

1

14
(407, 175, 75)
10
2, 5
37

1

15
(3151, 126, 5)
11
11
137

1

(483, 241, 120)
11
11
23

2
in ; None in

17
(561, 176, 55)
11
11
187
11 factors trivially in ,
1
in ; None in

18
(20881, 145, 1)
12
2, 3
157

1

19
(1591, 160, 16)
12
2, 3
43

1

20
(9805, 172, 3)
13
13
37

1

(3895, 177, 8)
13
13
19

2

(1711, 190, 21)
13
13
29

2

23
(2323, 216, 20)
14
14
23

1

(9951, 200, 4)
14
2, 7
107

2

25
(8041, 201, 5)
14
2, 7
43

1

26
(793, 352, 156)
14
2, 7
61

1

27
(50851, 226, 1)
15
3, 5
241

1

(2871, 246, 21)
15
3, 5
29

2

29
(2491, 250, 25)
15
3, 5
53

1

(13573, 261, 5)
16
2
277

2

31
(4879, 271, 15)
16
2
41

1

(26815, 328, 4)
18
2, 3
173

2

(4551, 351, 27)
18
2, 3
41

2

(16975, 369, 8)
19
19
97

2

(15171, 370, 9)
19
19
389

2

36
(2599, 433, 72)
19
19
113

1

37
(11455, 415, 15)
20
2, 5
29

1

38
(3657, 457, 57)
20
2, 5
53

1

39
(194923, 442, 1)
21
3, 7
463

1

40
(28609, 448, 7)
21
3, 7
67

1

(18533, 452, 11)
21
3, 7
43

2

(13833, 456, 15)
21
3, 7
53

2

43
(4891, 490, 49)
21
3, 7
73

1

44
(3649, 513, 72)
21
3, 7
89

1

45
(2941, 540, 99)
21
3, 7
173

1

46
(1919, 686, 245)
21
3, 7
101

1

47
(1769, 833, 392)
21
3, 7
61

1

(78895, 487, 3)
22
2, 11
509

2

49
(20461, 496, 12)
22
2, 11
37

1

50
(4081, 561, 77)
22
2, 11
53

1

51
(3835, 568, 84)
22
2, 11
59

1

52
(3601, 576, 92)
22
2, 11
277

1

53
(94165, 532, 3)
23
23
37

1

(18531, 545, 16)
23
23
71

2

55
(8557, 621, 45)
24
2, 3
43

1

56
(2959, 783, 207)
24
2, 3
269

1

(131253, 628, 3)
25
5
653

2

58
(11289, 664, 39)
25
5
53

1

59
(6205, 705, 80)
25
5
73

1

60
(3115, 865, 240)
25
5
89

1

Table 2: Partial results in groups of order by Criterion 1. and parameters with asterisk indicate new results. ? means the number of groups of order is unknown.

(, , )

Factoring of in
No. of groups of order
No. of groups ruled out
Solutions in

1
(171, 51, 15)
6
2,3
19

5
2

2
(155, 56, 20)
6
2,3
31
2 factors trivially [20]
2
1

3
(231, 70, 21)
7
7
77
7 factors trivially in ,
2
1
in ; None in

(2325, 84, 3)
9
3
31

10
3
,

(10101, 101, 1)
10
2,5
37

14
5

6
(715, 154, 33)
11
11
143
11 factors trivially in ,
2
1
in ; None in

(7155, 147, 3)
12
2,3
53

?
?

(38613, 197, 1)
14
2,7
211

5
2

(5859, 203, 7)
14
2,7
31
2 factors trivially [20]
?
?

(903, 287, 91)
14
2,7
43

7
2

(2255, 392, 68)
18
2,3
41

7
2

(160401, 401, 1)
20
2,5
421

5
2

(23607, 407, 7)
20
2,5
61

11
5

(22451, 450, 9)
21
3,7
157

2
1

(2619, 561, 120)
21
3,7
97

13
5

16
(2211, 715, 231)
22
2,11
67

4
1

17
(7450, 573, 44)
23
23
149

10
5

18
(111555, 579, 3)
24
2,3
67

?
?

19
(37961, 585, 9)
24
2,3
29

2
1

20
(23247, 591, 15)
24
2,3
41

?
?

21
(25641, 641, 16)
25
5
37

14
4

Table 3: Parameter sets that do not exist by Criterion 2. and parameters with asterisk indicate new results. No diff. set image in implies no difference set image in Dihedral group of same order.

(, , )

Factoring of in
No. of groups of order
Solutions in

1
(56, 11, 2)
3
3
14

13
in

2
(154, 18, 2)
4
2
22

4
in

3
(66, 26, 10)
4
2
22

2
;

4
(112, 37, 2)
5
5
14

43

(690, 53, 4)
7
7
10

8

6
(496, 55, 6)
7
7
62
7 factors trivially see [21]
42
in

(306, 61, 12)
7
7
34

10
in

(2146, 66, 2)
8
2
74

4
in

(806, 70, 6)
8
2
26

4
in

(430, 78, 14)
8
2
86

4
in

(370, 82, 18)
8
2
74

4
;

(266, 106, 42)
8
2
38

4
in

(3404, 83, 2)
9
3
46
Remark 2.3
11
in

(714, 93, 12)
9
3
34

12
in

(2668, 127, 6)
11
11
46
Remark 2.3
11
in

(1704, 131, 10)
11
11
142

39
in

(1450, 162, 18)
12
2,3
58

10
in

(760, 253, 84)
13
13
38

39

(13054, 229, 4)
15
3,5
122

4
in

(4064, 239, 14)
15
3, 5
254

195
in

(3268, 243, 18)
15
3,5
86

9
in

(2278, 253, 28)
15
3,5
134

4
in

(1886, 261, 36)
15
3,5
46
Remark 2.3
4
in

(1406, 281, 56)
15
3,5
74

4
in

(1054, 325, 100)
15
3,5
34

4

(918, 393, 168)
15
3,5
34

30

(902, 425, 200)
15
3,5
82

4

(33154, 258, 2)
16
2
274

10
in

(11398, 262, 6)
16
2
278

4
in

(2466, 290, 34)
16
2
274

10
;

(1660, 316, 60)
16
2
166

11
in

(1066, 426, 170)
16
2
82

4
;

(7526, 301, 12)
17
17
106

4
in

(5796, 305, 16)
17
17
46

111
in

(20758, 408, 8)
20
2,5
214

4
in

(7474, 424, 24)
20
2,5
74

4
in

(5038, 438, 38)
20
2,5
458

4
in

(2014, 550, 150)
20
2,5
106

4
;

(1918, 568, 168)
20
2,5
274

4
in

(24346, 541, 12)
23
23
94

8
in

(34282, 586, 10)
24
2, 3
122

4
in

(20770, 645, 20)
25
5
134

12
in

Table 4: Partial results in groups of order by Criterion 2. and parameters with asterisk indicate new results. No difference set image in implies no diff. set image in Dihedral group of same order. ? means the number of groups of order is unknown.

(, , )

Factoring of in
No. of groups of order
No. of groups ruled out
Solutions in

1
(78, 22, 6)
4
2
26

6
4
in

2
(204, 29, 4)
5
5
34

12
10
in

(1140, 68, 4)
8
2
38

41
29
in

(396, 80, 16)
8
2
66

30
15
None in

(300, 92, 48)
8
2
50

49
9
in

(980, 89, 8)
9
3
14

34
31

(456, 105, 24)
9
3
38

54
39
in

(1856, 106, 6)
10
2, 5
58

1630
1387
in

(7504, 123, 2)
11
11
134

?
?
in

(3876, 125, 4)
11
11
34

40
34
in

(2870, 152, 8)
12
2, 3
82

12
8
in

(666, 210, 66)
12
2, 3
74

18
10
in

(610, 232, 88)
12
2, 3
122

6
4
in

(14536, 171, 2)
13
13
46
Remark 2.3
?
?
in

(7440, 173, 4)
13
13
62

?
?
in

(5076, 175, 6)
13
13
94

?
?
in

(2716, 181, 12)
13
13
194

11
9
in

(19504, 198, 2)
14
2, 7
106

?
?
in

(1696, 226, 30)
14
2, 7
212

235
194

(8856, 231, 6)
15
3, 5
82

?
?
in

(1508, 275, 50)
15
3, 5
58

15
11
in

(976, 351, 126)
15
3, 5
122

51
14
in

(3256, 280, 24)
16
2
74

?
?
in

(1036, 460, 204)
16
2
74

11
9
;

(21390, 293, 4)
17
17
62

36
16
in

(52976, 326, 2)
18
2, 3
86
See Remark 2.2 for
?
?
in

(18096, 330, 6)
18
2, 3
58

?
?
in

(1776, 426, 102)
18
2, 3
74

260
170
in

(65704, 363, 2)
19
19
382

?
?
in

(22388, 367, 6)
19
19
386

15
11
in

(13728, 371, 10)
19
19
26

?
?

(7960, 379, 18)
19
19
398

?
?
in

(5084, 391, 30)
19
19
82

11
9
in

(2256, 451, 90)
19
19
94

?
?
in

(40704, 404, 4)
20
2, 5
106

?
?
in

(16770, 410, 10)
20
2, 5
86

48
24
in

(1830, 590, 190)
20
2, 5
122

18
8

(49369, 445, 4)
21
3, 7
466

15
11
in

(17064, 453, 12)
21
3, 7
158

?
?
in

(14756, 455, 14)
21
3, 7
34

27
23

(10604, 461, 20)
21
3, 7
482

11
9
in

(7380, 471, 30)
21
3, 7
82

149
89
in

(5336, 485, 44)
21
3, 7
46
Remark 2.3
?
?

(3128, 531, 90)
21
3, 7
46
Remark 2.3
?
?

(2408, 581, 140)
21
3, 7
86

?
?
in

(70890, 533, 4)
23
23
278

24
16
in

(47616, 535, 8)
23
23
62

?
?
in

(13776, 551, 22)
23
23
82

?
?

(166754, 578, 2)
24
2, 3
86

12
8
in

(56358, 582, 6)
24
2, 3
202

?
?
in

(10388, 612, 36)
24
2, 3
106

34
28
in

(4844, 668, 92)
24
2, 3
346

11
9
in

(3690, 714, 138)
24
2, 3
82

30
20
in

(3172, 756, 180)
24
2, 3
122

15
11
,

(2332, 1036, 460)
24
2, 3
106

11
9
in

(196252, 627, 2)
25
5
326

?
?
in

(66256, 631, 6)
25
5
82

?
?
in

(50008, 633, 8)
25
5
94

?
?
in

(17524, 649, 24)
25
5
674

15
11

(14280, 655, 30)
25
5
34

?
?

(11040, 665, 40)
25
5
12

?
?
in

(11040, 665, 40)
25
5
46
Remark 2.3
?
?

(5104, 729, 104)
25
5
58

?
?

(2812, 937, 312)
25
5
74

11
9

Table 5: Partial results in groups of order by Criterion 3. Parameters with asterisk indicate new results.? means the number of groups of order is unknown.

(, , )

Factoring of in
No. of groups of order
No. of groups ruled out
Solutions in

1
(40, 13, 4)
3
3

14
10
,

(400, 57, 8)
7
7

221
166
,

(280, 63, 14)
7
7

40
30
,

(220, 73, 24)
7
7

15
7
,

(820, 91, 10)
9
3

20
7
,

(540, 99, 18)
9
3

119
56
,

(3876, 125, 4)
11
11

40
32
,

(1464, 133, 12)
11
11

61
30
,

(988, 141, 30)
11
11

11
5
,

(756, 151, 30)
11
11

189
96
,

(2380, 183, 14)
13
13

35
15
,

(1056, 211, 42)
13
13

1028
995
,

(1456, 195, 26)
13
13

179
171
,

(1380, 197, 28)
13
13

29
15
,

(1548, 273, 48)
15
3, 5

46
6
,

(1160, 305, 80)
15
3, 5

49
33
,

(1012, 337, 112)
15
3, 5
Remark 2.3
13
5
,

(1300, 433, 144)
17
17

50
16
,

(5220, 307, 18)
17
17

113
50
,

(5220, 307, 18)
17
17

113
50
,

(5220, 307, 18)
17
17

113
50
,

(33216, 365, 4)
19
19

?
?
,

(11564, 373, 12)
19
19

28
16
,

(7240, 381, 20)
19
19

?
?
,

(4368, 397, 36)
19
19

?
?
,

(4180, 399, 38)
19
19

36
15
,

(2508, 437, 76)
19
19

34
20
,

(1976, 475, 114)
19
19

39
30
,

(1624, 541, 180)
19
19

56
30
,

(1520, 589, 228)
19
19

178
147
,

(97904, 443, 2)
21
3, 7

?
?
,

(11680, 459, 18)
21
3, 7

?
?
,

(9724, 463, 22)
21
3, 7

35
15
,

(7840, 469, 28)
21
3, 7

?
?
,

(7380, 471, 30)
21
3, 7

149
66
,

(3128, 531, 90)
21
3, 7

?
?
,

(2756, 551, 110)
21
3, 7

20
5
,

(2296, 595, 154)
21
3, 7

?
?
,

(1904, 693, 252)
21
3, 7

186
147
,

(1836, 735, 294)
21
3, 7

117
56
,

(1820, 749, 308)
21
3, 7

35
15
,

(1800, 771, 330)
21
3, 7

749
412
,

(47616, 535, 6)
23
23

?
?
,

(35980, 537, 8)
23
23

35
15
,

(12720, 553, 24)
23
23

?
?
,

(12720, 553, 24)
23
23

?
?
,

(7176, 575, 46)
23
23

?
?
,

(4320, 617, 88)
23
23

?
?
,

(3220, 667, 138)
23
23

27
15
,

(2760, 713, 184)
23
23

?
?
,

(2760, 713, 184)
23
23

?
?
,

(2380, 793, 264)
23
23

35
15
,

(2380, 793, 264)
23
23

35
15
,

(196252, 627, 2)
25
5

?
?
,

(196252, 627, 2)
25
5

?
?
,

(40260, 635, 10)
25
5

370
66
,

(16276, 651, 26)
25
5

20
5
,

(14280, 655, 30)
25
5

?
?
,

(11040, 665, 40)
25
5

?
?
,

(9100, 675, 50)
25
5

118
50
,

(6328, 703, 78)
25
5

?
?
,

(4620, 745, 120)
25
5

140
66
,

(4380, 755, 130)
25
5

53
15
,

(3400, 825, 200)
25
5

?
?
,

(3060, 875, 250)
25
5

113
50
,

(2640, 1015, 390)
25
5

?
?
,

(2520, 1145, 520)
25
5

?
?
,

We list some parameter sets (both known and new) that do not exist. In each of these cases, is a group of order and is a group homomorphism. Suppose that is a -subset of and such that factors trivially in the cyclotomic ring . We use Criteria 1, 2 and 3 to rule out the existence of difference set. Examples of such parameters are listed in Tables 1 and 3. We also listed partial results in Tables 2, 4, and 5.

References

D. Jungnickel, A. Pott, and K. W. Smith, “Difference sets,” in The CRC Handbook of Combinatorial Designs, Preprint, C. J. Colbourn and J. H. Dinitz, Eds., CRC Press, 2005.

K. T. Arasu, “On Lander's conjecture for the case ,” in Proceedings of the 1st Carbondale Combinatorics Conference, vol. 1, pp. 5–11, 1987.

K. T. Arasu and S. K. Sehgal, “Non-existence of some difference sets,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 32, pp. 207–211, 2000.

L. D. Baumert, Cyclic Difference Sets, vol. 182 of Lecture Notes in Mathematics, Springer, Berlin, Germany, 1971.

J. F. Dillon, “Variations on a scheme of McFarland for noncyclic difference sets,” Journal of Combinatorial Theory. Series A, vol. 40, no. 1, pp. 9–21, 1985.

M. Hall, Jr., Combinatorial Theory, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, New York, NY, USA, 2nd edition, 1986, A Wiley-Interscience Publication.

J. E. Iiams, “Lander's tables are complete,” in Difference Sets, Sequences and Their Correlation Properties, vol. 542, pp. 239–257, Klumer Academic, Dordrecht, The Netherlands, 1999.

Y. J. Ionin and M. S. Shrikhande, Combinatorics of Symmetric Designs, vol. 5 of New Mathematical Monographs, Cambridge University Press, Cambridge, UK, 2006.

D. Jungnickel and A. Pott, “Difference sets: an introduction,” in Difference Sets, Sequences and Their Correlation Properties, vol. 542, pp. 259–295, Klumer Academic, Dordrecht, The Netherlands, 1999.

L. E. Kopilovich, “Difference sets in noncyclic abelian groups,” Cybernetics, vol. 25, no. 2, pp. 153–157, 1989.

E. S. Lander, Symmetric Designs: An Algebraic Approach, vol. 74 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, UK, 1983.

A. Pott, Finite Geometry and Character Theory, vol. 1601 of Lecture Notes in Mathematics, Springer, Berlin, Germany, 1995.

B. Schmidt, “Cyclotomic integers and finite geometry,” Journal of the American Mathematical Society, vol. 12, no. 4, pp. 929–952, 1999.

R. J. Turyn, “Character sums and difference sets,” Pacific Journal of Mathematics, vol. 15, pp. 319–346, 1965.

M. Hall, Jr., “Cyclic projective planes,” Duke Mathematical Journal, vol. 14, pp. 1079–1090, 1947.

K. T. Arasu and S. K. Sehgal, “On abelian difference sets,” in Algebra: Some Recent Advances, pp. 1–27, Birkhäuser, Basle, Switzerland, 1999.

D. R. Hughes, “Biplanes and semi-biplanes,” in Proceedings of the Australian Conference on Combinatorial Mathematics, vol. 686 of Lecture Notes in Mathematics, pp. 55–58, Springer, Berlin, Germany, 1978.

R. E. Kibler, “A summary of noncyclic difference sets,” Journal of Combinatorial Theory. Series A, vol. 25, no. 1, pp. 62–67, 1978.

A. V. López and M. A. G. Sánchez, “On the existence of abelian difference sets with ,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 23, pp. 97–112, 1997.

B. Franklin and S. Sam, “Non existence of some cyclic difference sets,” 2007.

A. S. Osifodunrin, “On the existence of non-abelian (210, 77, 28), (336, 135, 54) and (496, 55,6) difference sets,” Discrete Mathematics, Algorithms and Applications, vol. 3, no. 1, pp. 121–137, 2011.

R. A. Liebler, “The inversion formula,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 13, pp. 143–160, 1993.

I. Stewart and D. Tall, Algebraic Number Theory and Fermat's Last Theorem, A K Peters, Natick, Mass, USA, Third edition, 2002.

S. L. Ma, “Planar functions, relative difference sets, and character theory,” Journal of Algebra, vol. 185, no. 2, pp. 342–356, 1996.

S. Lang, Algebraic Number Theory, Addison-Wesley Publishing, Reading, Mass, USA, 1970.

O. Gjoneski, A. S. Osifodunrin, and K. W. Smith, on existence of (176, 50, 14) and (704, 38,2) difference sets, to appear

W. Ledermann, Introduction to Group Characters, Cambridge University Press, Cambridge, UK, 1977.

M. Hall, Jr., The theory of Groups, The Macmillan Company, New York, NY, USA, 1959.