#19545: Mathon's pseudocylic strongly regular graphs.
-------------------------+-------------------------------------------------
Reporter: | Owner:
dimpase | Status: new
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: Dima | 543b98ceb86259cf01a933dbafa7da1deed63510
Pasechnik | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dimpase/matpc |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dimpase):
OK, I did a bit more than just adding explicit graph parameters
{{{
+ .. TODO::
+
+ The current implementation only gives a subset of all possible
graphs that can be
+ obtained using this construction. A full implementation should
rely on a database
+ of conference matrices (or, equivalently, on a database of
s.r.g.'s with parameters
+ `(4t+1,2t,t-1,t)`. Currently we make an extra assumtion that
`4t+1` is a prime power.
+ The first case where we miss a construction is `t=11`, where we
could (recursively)
+ use the graph for `t=1` to construct a graph on 83205 vertices.
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19545#comment:15>
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.
