#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 | af1af3242be804d31bf81ecc0db94f7378b0f152
Pasechnik | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dimpase/matpc |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dimpase):
Replying to [comment:5 dimpase]:
> Should we have a function that attempts to construct an SRG with
parameters `(4z+1,2z,z-1,z)` ?
>
> One can do this either for `4z+1` a prime power (then it could be Paley
graph), or
> `4z+1=(4t+1)(4t-1)^2`, for `t` for which the construction of this ticket
works, in particular so that there is an SRG with parameters
`(4t+1,2t,t-1,t)`. I.e. there is a recursion.
>
so if we want a proper `is_whatever()` function (which will absorb
`is_paley()`) dealing with such graphs, we need to be able to say with
certainty that we can build it, before returning a promise (i.e. that
`t[0](*t[1:])` thing) to build it.
This will need something like what we do for (skew) Hadamard matrices;
where should such functions for graphs go?
--
Ticket URL: <http://trac.sagemath.org/ticket/19545#comment:6>
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.
