Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it

612115 views
1
Let $G$ be a finite group and $N\subseteq G$. The set $R\subseteq G$
2
with $|R|=k$ is called a ``relative difference set of order
3
$k-\lambda$ relative to the forbidden set $N$'' if the following
4
properties hold:
5
6
\beginlist%ordered{(a)}
7
\item{(a)} The multiset $\{ a.b^{-1}\colon a,b\in R\}$ contains
8
every nontrivial ($\neq 1$) element of $G-N$ exactly $\lambda$
9
times.
10
\item{(b)} $\{ a.b^{-1}\colon a,b\in R\}$ does not contain
11
any non-trivial element of $N$.
12
\endlist
13
14
Let $D\subseteq G$ be a difference set, then the incidence structure
15
with points $G$ and blocks $\{Dg\;|\;g\in G\}$ is called the
16
*development* of $D$. In short: ${\rm dev} D$. Obviously, $G$ acts on
17
${\rm dev}D$ by multiplication from the right.
18
19
Relative difference sets with $N=1$ are called (ordinary) difference
20
sets. The development of a difference set with $N=1$ and $\lambda=1$
21
is projective plane of order $k-1$.
22
23
In group ring notation a relative difference set satisfies
24
$$
25
RR^{-1}=k+\lambda(G-N).
26
$$
27
28
The set $D\subseteq G$ is called *partial relative difference set*
29
with forbidden set $N$, if
30
$$
31
DD^{-1}=\kappa+\sum_{g\in G-N}v_gg
32
$$
33
34
holds for some $1\leq\kappa\leq k$ and $0\leq v_g \leq \lambda$ for
35
all $g\in G-N$. If $D$ is a relative difference set then ,obviously,
36
$D$ is also a partial relative difference set.
37
38
39
*IMPORTANT NOTE*
40
41
\package{RDS} implicitly assumes that the *every* partial difference
42
set contains the identity element (see the notion of equivalence in
43
"RDS:Introduction" for the mathematical reason). However, the identity
44
*must not* be contained in the lists representing partial relative
45
difference sets.
46
47
So in \package{RDS}, the difference set `[ (), (1,2,3,4,5,6,7),
48
(1,4,7,3,6,2,5) ]' is represented by the list `[ (1,2,3,4,5,6,7),
49
(1,4,7,3,6,2,5) ]'. And no set of three non-trivial permutations will
50
be accepted as an ordinary difference set of `Group((1,2,3,4,5,6,7))'.
51
52
For this reason the lists returned by functions like "AllDiffsets" do
53
only contain non-trivial elements and look too short.
54
55
56
57
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
58
%%
59
%E ENDE
60
%%
61
62