#19499: Mathon's graphs on 784 vertices
-------------------------------------+-------------------------------------
       Reporter:  dimpase            |        Owner:
           Type:  enhancement        |       Status:  needs_work
       Priority:  major              |    Milestone:  sage-6.10
      Component:  graph theory       |   Resolution:
       Keywords:                     |    Merged in:
        Authors:  Dima Pasechnik     |    Reviewers:
Report Upstream:  N/A                |  Work issues:
         Branch:                     |       Commit:
  u/dimpase/mathon784                |  6c7e85187a0d695ef3856b83d08eaaa0520f1fc0
   Dependencies:                     |     Stopgaps:
-------------------------------------+-------------------------------------

Comment (by ncohen):

 > as you can claim a bit of understanding of strongly regular graphs,

 Ahahah. I wouldn't claim that. Neither with strongly regular graphs, nor
 with combinatorial designs. I know the extent of what I don't know on
 these topics.. `:-P`

 > It took off when people wanted to use orbitals to study permutation
 groups. Orbitals of a permutation group (0-1 matrices specifying the
 partition of the set of 2-tuples induced by the group action) define an
 object called, variously, coherent configuration, coherent algebra...
 Restricting to transitive groups, one has homogeneous coherent
 configurations, a.k.a. (non-commutative) association schemes. And then in
 several important cases one gets commutativity of these matrices, and thus
 the (usual) association schemes.
 >
 > A bit later coding theorists wanted to use algebra to study codes, which
 are special kinds of cliques in Hamming (or Johnson) graphs.
 > But the distance k graphs, for all, k, of these graphs also form
 association scheme...
 >
 > And so this was born...

 HMmmmmm... Thank you for this historical view `:-)`

 About this patch: needs_work, needs_review?

 Nathann

--
Ticket URL: <http://trac.sagemath.org/ticket/19499#comment:13>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.

Reply via email to