1994
DOI: 10.1007/bf01388454
|View full text |Cite
|
Sign up to set email alerts
|

A survey of partial difference sets

Abstract: Abstract. Let G be a finite group of order v. A k-element subset D of G is called a (v, k, 3,,/z)-partial difference set if the expressions gh -1, for g and h in D with g ~ h, represent each nonidentity element in D exactly ), times and each nonidentity element not in D exactly # times. If e t~ D and g E D iff g-1 E D, then D is essentially the same as a strongly regular Cayley graph. In this survey, we try to list all important existence and nonexistence results concerning partial difference sets. In particul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
255
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 204 publications
(256 citation statements)
references
References 59 publications
1
255
0
Order By: Relevance
“…, C e−1 , where C i = θ i G and θ is a primitive root of F q . In many cases, a partial difference set D can be found by taking an appropriate union of orbits (see [8]), and in this case the strongly regular graph generated by D is obviously a quasi m-Cayley graph, where the point at infinity is the zero element of the field.…”
Section: Quasi M-cayley Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…, C e−1 , where C i = θ i G and θ is a primitive root of F q . In many cases, a partial difference set D can be found by taking an appropriate union of orbits (see [8]), and in this case the strongly regular graph generated by D is obviously a quasi m-Cayley graph, where the point at infinity is the zero element of the field.…”
Section: Quasi M-cayley Graphsmentioning
confidence: 99%
“…However, among the other 14 graphs in this family there are six more graphs that are quasi m-Cayley graphs on some cyclic group. In particular, two of the graphs are quasi m-Cayley graphs on a cyclic group C n for each (m, n) ∈ {(4, 6), (6,4), (8,3)}, and four of the graphs are quasi 8-Cayley graphs on a cyclic group C 3 (but are neither quasi 4-Cayley graphs nor 6-Cayley graphs on a cyclic group). The symbols of the graphs that are distinct from the Paley graph P (25) are listed in the appendix (only the symbols with respect to a quasi (4, 6)-semiregular automorphism are given for the two first ones).…”
Section: (M N)-circulant Quasi M-cayley Strongly Regular Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…, R d ) a group scheme if X is a group and (xg, yg) ∈ R i whenever (x, y) ∈ R i for all g ∈ X and all i = 0, . Such a subring is also known as a Schur ring of G [29] and it is the Bose-Mesner ring of the scheme. Conversely, every Schur ring of G gives rise to a group scheme of G and such a scheme will be simply denoted by (G; D 0 , D 1 , .…”
Section: Introductionmentioning
confidence: 99%
“…partial difference sets containing the identity of G, can be similarly defined. The reader can find more details on strongly regular graphs in [6,19] and on partial difference sets in [29].…”
Section: Introductionmentioning
confidence: 99%