The Final Four Jim Davis Irsee conference September 2014 John - - PowerPoint PPT Presentation

the final four
SMART_READER_LITE
LIVE PREVIEW

The Final Four Jim Davis Irsee conference September 2014 John - - PowerPoint PPT Presentation

The Final Four Jim Davis Irsee conference September 2014 John Dillon, Taylor Applebaum, Gavin McGrew, Tahseen Rabbani, Daniel Habibi, Kevin Erb, Erin Geoghan The Final Result The Final Four Jim Davis Irsee conference September 2014 2017


slide-1
SLIDE 1

The Final Four

Jim Davis Irsee conference September 2014 John Dillon, Taylor Applebaum, Gavin McGrew, Tahseen Rabbani, Daniel Habibi, Kevin Erb, Erin Geoghan

slide-2
SLIDE 2

The Final Four

Jim Davis Irsee conference September 2014 John Dillon, Taylor Applebaum, Gavin McGrew, Tahseen Rabbani, Daniel Habibi, Kevin Erb, Erin Geoghan

The Final Result

2017 Jonathan Jedwab, Ken Smith, William Y

  • lland
slide-3
SLIDE 3

Statement of Problem

Which groups of order 256 contain a (256, 120, 56) difference set?

slide-4
SLIDE 4

History lesson #1

  • Groups of order 16
  • 1960s Kibler does computer search.
  • 12 of 14 have difference sets
slide-5
SLIDE 5

History lesson #2

  • Groups of order 64
  • 1990s Dillon does computer search.
  • 259 of 267 have difference sets
slide-6
SLIDE 6

Modular group

  • Original proof: didn’t exist
  • Ken Smith: construction!
slide-7
SLIDE 7

Statement of Problem

Which groups of order 256 contain a (256, 120, 56) difference set? Issue: there are 56,092 nonisomorphic groups!

slide-8
SLIDE 8

Outline of talk

  • Motivation
  • Easy examples
  • Nonexistence
  • Constructions
  • Computer searches
  • Final thoughts
slide-9
SLIDE 9

Key example

x x x x x x

slide-10
SLIDE 10

Key example

x x x x x x

(1,0) (0,1) (1,2) (1,3) (2,1) (3,1)

slide-11
SLIDE 11

Key example

X X X X X X

slide-12
SLIDE 12

Similar group

X X X X X X

slide-13
SLIDE 13

Move it around!

X X X X X X

slide-14
SLIDE 14

Independently move pieces

X X X X X X

slide-15
SLIDE 15

Independently move pieces

X X X X X X

slide-16
SLIDE 16

Independently move pieces

X X X X X X

slide-17
SLIDE 17

Independently move pieces

X X X X X X

slide-18
SLIDE 18

W

  • rks here too

X X X X X X

slide-19
SLIDE 19

W

  • rks here too

X X X X X X

slide-20
SLIDE 20

W

  • rks here too

X X X X X X

slide-21
SLIDE 21

Nonexistence

G/H large and cyclic no (256,120,56) DS

slide-22
SLIDE 22

Nonexistence

G/H large and cyclic no (256,120,56) DS G/H large and dihedral no (256,120,56) DS

slide-23
SLIDE 23

Nonexistence

G/H large and cyclic no (256,120,56) DS G/H large and dihedral no (256,120,56) DS

That is it!! Rules out 43 groups.

slide-24
SLIDE 24

Nonexistence

G/H large and cyclic no (256,120,56) DS G/H large and dihedral no (256,120,56) DS

That is it!! Rules out 43 groups.

56,092-43 = 56,049

slide-25
SLIDE 25

Dillon-McFarland (Drisko)

If H < G is normal, H=(Z2)

4, then G has a DS

slide-26
SLIDE 26

Dillon-McFarland (Drisko)

If H < G is normal, H=(Z2)

4, then G has a DS

~42,300 groups have such a normal subgroup

slide-27
SLIDE 27

Dillon-McFarland (Drisko)

If H < G is normal, H=(Z2)

4, then G has a DS

~42,300 groups have such a normal subgroup ~56000-42300 = ~13700

slide-28
SLIDE 28

Product constructions

G, H have DSs GxH has DS

slide-29
SLIDE 29

Product constructions

G, H have DSs GxH has DS Handles ~9500 of remaining groups

slide-30
SLIDE 30

Product constructions

G, H have DSs GxH has DS Handles ~9500 of remaining groups ~13700-9500 = ~4200

slide-31
SLIDE 31

[G:H] = 4

~3500 groups 795 groups remaining! (Down to 714 a little later)

slide-32
SLIDE 32

Z4 x Z4 x Z2

  • 649 of the remaining groups had a normal

subgroup

  • (16,8,8,-) covering EBSs
slide-33
SLIDE 33

Why does this work?

  • BiBj-1 = cG for i = j
  • giBiBi(-1)gi-1 nice?
slide-34
SLIDE 34

Modification of other methods

  • K-Matrices
  • Representation Theory
slide-35
SLIDE 35

Final Four

  • SmallGroup(256,408)
  • SmallGroup(256,501)
  • SmallGroup(256,536)
  • SmallGroup(256,6700)
slide-36
SLIDE 36

Final Four

  • SmallGroup(256,408)
  • SmallGroup(256,501)
  • SmallGroup(256,536)
  • SmallGroup(256,6700)

a2 = b32 = c2 = d2 = 1, cbc-1=ba, dbd-1=b23c, dcd-1=b16ac

slide-37
SLIDE 37

Final Four

  • SmallGroup(256,408)
  • SmallGroup(256,501)
  • SmallGroup(256,536)
  • SmallGroup(256,6700)

b64 = a2 = c2 = 1, aba-1=b33, cbc-1 = ba

slide-38
SLIDE 38

Final Four

  • SmallGroup(256,408)
  • SmallGroup(256,501)
  • SmallGroup(256,536)
  • SmallGroup(256,6700)

b64=a4=1, aba-1=b-17

slide-39
SLIDE 39

Final Four

  • SmallGroup(256,408)
  • SmallGroup(256,501)
  • SmallGroup(256,536)
  • SmallGroup(256,6700)

b32=a4=c2=1, aba-1=b-17, cbc-1=b17a2

slide-40
SLIDE 40

Where now?

Conjecture???: the large cyclic and large dihedral quotient nonexistence criteria are necessary and sufficient for a difference set in a 2-group to exist.

slide-41
SLIDE 41

Related work

  • Bent functions!
  • Relative difference sets in nonabelian groups.
  • # of distinct difference sets in a given group
  • Inequivalent designs