#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: | e469bb5b23d7862b48082f1cba9fd946dd7dc406
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/16370 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> An OA does not determine uniquely a graph. As Kanappan said there are at
least three natural ones and there are many more non-trivial
constructions. So calling it `graphs.OrthogonalArrayGraph` completely
misleading.
WTF MAN ! THIS IS THE TERMINOLOGY USED ON ALL PAGES OF BROUWER'S WEBSITE !
I am not the one who made this terminology, go tell him !
> About the syntax, let me cite Andries Brouwer:
Be honest and also copy/paste the answer I gave him.
> If you have a set with a collection of subsets, that is called a
hypergraph, and the subsets are called hyperedges. Given a hypergraph, one
can make the intersection graph. The vertices of the hypergraph are the
hyperedges. Two distinct vertices are adjacent when their intersection is
nonempty. This is a construction that occurs in many different places. A
design is a hypergraph with certain regularity properties. But this
intersection graph is needed for many types of design.
I know what an intersection graph is and I said ONE THOUSAND FUCKING TIMES
that we need a contructor for that. That's totally unrelated.
> It makes no sense to design a system where intersection graph gets
different names depending on the type of design one used as input.
Copy/paste my answer to that. Or create a ticket to remove the words from
`words.*` which can be obtained through `words.FixedPointOfMorphism`.
THIS DOES NOT MAKE ANY F******* SENSE !
> So the name could be either
`graphs.IntersectionGraphOfOneOrthogonalArray` or simply a subcase of
`graphs.IntersectionGraph`. And I am in favour of the second one.
I don't give a fuck. Either you think a bit or we close this ticket as
wontfix, I am tired of discussing trivialities forever. I have work to do.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:32>
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.
