Enumerating coherent configurations of small order Matan Ziv-Av - - PowerPoint PPT Presentation

▶
enumerating coherent configurations of small order
SMART_READER_LITE
LIVE PREVIEW

Enumerating coherent configurations of small order Matan Ziv-Av - - PowerPoint PPT Presentation

May 02, 2023 96 likes •311 views

Enumerating coherent configurations of small order Matan Ziv-Av Ben Gurion University of the Negev MTAGT, Villanova, June 2-5 2014 Coherent configurations A partition of 2 , M = R 1 , . . . , R r is a coherent configuration if CC1 i

slide-1
SLIDE 1

Enumerating coherent configurations of small

  • rder

Matan Ziv-Av

Ben Gurion University of the Negev

MTAGT, Villanova, June 2-5 2014

slide-2
SLIDE 2

Coherent configurations

A partition of Ω2, M = R1, . . . , Rr is a coherent configuration if

CC1 ∀i ∈ [1, r]∃i′ ∈ [1, r]R−1

i

= Ri′ CC2 ∃I ′ ⊆ [1, r]

  • i∈I ′

Ri = ∆ CC3 ∀i, j, k ∈ [1, r]∀(x, y) ∈ Rk|{z ∈ X|(x, z) ∈ Ri ∧ (z, y) ∈ Rj}| = pk

ij

If Ri = ∆ then M is called an association scheme. The partition of ∆ defines a partition of Ω.

slide-3
SLIDE 3

Structure of coherent configurations

AS1 CB ∗ AS2

   AS1 CB ∗ AS2         AS1 CB1 CB2 CB3 ∗ AS2 CB4 CB5 ∗ ∗ AS3 CB6 ∗ ∗ ∗ AS4    

slide-4
SLIDE 4

Structure of coherent configurations

AS1 CB ∗ AS2

   AS1 CB ∗ AS2         AS1 CB1 CB2 CB3 ∗ AS2 CB4 CB5 ∗ ∗ AS3 CB6 ∗ ∗ ∗ AS4     By CB I mean a color partition of the complete (directed) bipartite graph into biregular subgraphs:

slide-5
SLIDE 5

Similar enumerations

Hanaki and Miyamoto enumerated all association schemes of

  • rder up to 30, as well as those of orders 32, 33, 34 and 38.

http://math.shinshu-u.ac.jp/~hanaki/as/ All SRGs (rank 3 symmetric association schemes) on up t0 48 vertices are enumerated http: //www.win.tue.nl/~aeb/graphs/srg/srgtab1-50.html All S-rings (association scheme with a regular subgroup of automorphisms) of order up to 63 were enumerated by Pech & Reichard, Z. http://my.svgalib.org/s-rings/wschur.tar.gz

slide-6
SLIDE 6

Using enumeration of AS to enumerate CCs

    AS1 CB ∗ AS2    

slide-7
SLIDE 7

Previous attempts

Shiratsuchi (1997) and Nagatomo & Junichi (2009) enumerated CCs of order up to 13. “Most of the classification was done by hand, and we also use ‘Mathematica’ partially.”

slide-8
SLIDE 8

Previous attempts

Shiratsuchi (1997) and Nagatomo & Junichi (2009) enumerated CCs of order up to 13. “Most of the classification was done by hand, and we also use ‘Mathematica’ partially.” Sven Riechard (2012) enumerated CCs of order up to 13.

slide-9
SLIDE 9

Previous attempts

Shiratsuchi (1997) and Nagatomo & Junichi (2009) enumerated CCs of order up to 13. “Most of the classification was done by hand, and we also use ‘Mathematica’ partially.” Sven Riechard (2012) enumerated CCs of order up to 13. The results don’t agree.

slide-10
SLIDE 10

Results

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806

slide-11
SLIDE 11

Non-schurian CCs

The smallest non-Schurian strongly regular graph is Shrikhande graph of order 16.

slide-12
SLIDE 12

Non-schurian CCs

The smallest non-Schurian strongly regular graph is Shrikhande graph of order 16. The smallest non-Schurian association scheme is a tournament of order 15.

slide-13
SLIDE 13

Non-schurian CCs

The smallest non-Schurian strongly regular graph is Shrikhande graph of order 16. The smallest non-Schurian association scheme is a tournament of order 15. The smallest known non-Schurian coherent configuration is of

  • rder 15 (the same association scheme).
slide-14
SLIDE 14

Non-schurian CCs

The smallest non-Schurian strongly regular graph is Shrikhande graph of order 16. The smallest non-Schurian association scheme is a tournament of order 15. The smallest known non-Schurian coherent configuration is of

  • rder 15 (the same association scheme).

Natural questions arise:

Is there a non-Schurian coherent configuration of smaller

  • rder?

Are there other non-Schurian coherent configurations of order 15?

slide-15
SLIDE 15

Confidence in results

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806

slide-16
SLIDE 16

Fully confident I

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806 These results can be achieved with a GAP “one-liner”:

n:=8;;Sn:=SymmetricGroup(n);; Size(Filtered( List(ConjugacyClassesSubgroups(Sn),Representative), x->x=Intersection( List(Orbits(x,Tuples([1..n],2),OnTuples), y->Stabilizer(Sn,Set(y),OnSetsTuples))) ));

slide-17
SLIDE 17

Fully confident II

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806 All three efforts agree on these results. Can be easily calculated by calculating all mergings of trivial (rank n2) configuration.

slide-18
SLIDE 18

A little bit confident

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806 Each effort got different results. Others provide only “intereseting” data, so it is hard to say if the disagreement is in intereseting or in trivial results.

slide-19
SLIDE 19

A little bit confident

Size 1 2 3 4 5 6 7 8 CCs 1 2 4 10 15 38 57 143 Scuhurian 1 2 4 10 15 38 57 143 Size 9 10 11 12 13 CCs 228 492 769 1845 2806 Scuhurian 228 492 769 1845 2806 Each effort got different results. Others provide only “intereseting” data, so it is hard to say if the disagreement is in intereseting or in trivial results. Third time lucky?

slide-20
SLIDE 20

Thank you for your attention