#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):
Here it is. We will also have to add a similar warning in the OA module
someday (about results changing/disappearing). Though given that the goal
is to match the results of the MOLS I do not think we should worry too
much about designs disappearing, it will be the other way around `:-P`
Really, the heuristic to find holes can only give better results than
those which are expected in theory, as we deal with actual designs and do
not consider the "general properties of some OA(k,n)". We know more about
a single design that theory does, and we can compute maximum independent
sets while they can't.
And if some construction requires a specific OA, well, they will have to
explain it somewhere an we can then implement it.
Branch updated !
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16370#comment:29>
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.
