Partial difference sets in C₂^n C₂^n

From MaRDI portal
Publication:2297723



Abstract: We give an algorithm for enumerating the regular nontrivial partial difference sets (PDS) in the group Gn=C2nimesC2n. We use our algorithm to obtain all of these PDS in Gn for 2leqnleq9, and we obtain partial results for n=10 and n=11. Most of these PDS are new. For nle4 we also identify group-inequivalent PDS. Our approach involves constructing tree diagrams and canonical colorings of these diagrams. Both the total number and the number of group-inequivalent PDS in Gn appear to grow super-exponentially in n. For n=9, a typical canonical coloring represents in excess of 10146 group-inequivalent PDS, and there are precisely 2520 reversible Hadamard difference sets.





Describes a project that uses

Uses Software






This page was built for publication: Partial difference sets in \(C_{2^n} \times C_{2^n}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297723)