#16370: OA(k,n) strongly regular graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.3
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | e3c1c2180178c94d883db945dc33f2b457330cbc
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Yo !
> All right. But as Brouwer said himself in his answer it would be much
more consistent to have
> {{{
> sage: designs.MyPreferedDesign(x,y,z).block_intersection_graph()
> }}}
I would be interested to see the line of his email that mention either a
class or a method, but this is a good syntax anyway, and you will find the
same in my comment above.
> and not
> {{{
> sage: graphs.BlockIntersectionGraphFromMyPreferedDesign(x,y,z)
> }}}
Well then I am sorry for him, but I study graph theory and I know I wanted
to build strongly regular graphs before knowing what an OA is. And I
believe that it makes sense to have as many constructors of strongly
regular graphs in `graph.*`, even though the graphs could be built by
other means. That's more or less the point of having a database of graph
constructors, same for groups, same for words, same for everything else.
Don't you have both a `words.ThueMorseWord` and
`words.FixedPointOfMorphism` ?
> hum: k=k(n-1)
Ahah. Yeah, I know. I tried to phrase it to avoid confusions, but ....
yeah `:-P`
If you see another way..
> I see two more obstructions right now:
> - having a function with two integers as input makes anybody think that
there is a unique graph associated with all OA(k,n). I do not believe that
this is True. It must be very clear in the documentation.
No problem. I can even add that it may change between versions of Sage.
> - the function `designs.orthogonal_array` might not give the same output
between two releases of Sage. So if somebody starts working on OA(5,19)
and loves it and find out that three months after her graph disappear, it
would be a disaster.
A disaster indeed. I will mention that too in a second.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:28>
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.
