#14562: Steiner Quadruple Systems
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by ncohen):
* status: new => needs_review
Old description:
> Wow.
> This patch is scary.
> Really scary.
> The construction is awful, and there's not much that I could do to make
> the code clear.
> The point is that I do not understand the construction myself, and I did
> not try either, I just wanted to implement it. And it already took
> Quiiiiiiiiiiiiiite a lot of times, and headaches `:-)`
>
> This patch implements a method that returns a Steiner Quadruple System
> whenever it exists. It follows the construction from Haim Hanani in a
> paper from 1960, which gives 6 differents constructions to make a large
> system from a small one, and all must be used to solve all cases.
>
> Considering that I was able to test this code until `n =`, and that all
> constructions have been tested for different values of `n`, I believe
> that this code is a correct counterpart of the paper itself. That's what
> makes me think that there is no typo in the code anymore (I fixed one
> thousand of them while writing it). So, even if it is very, very scary
> and unclear, I think that it is correct... Experimentally `:-)`
>
> Nathann
New description:
Wow.
This patch is scary.
Really scary.
The construction is awful, and there's not much that I could do to make
the code clear.
The point is that I do not understand the construction myself, and I did
not try either, I just wanted to implement it. And it already took
Quiiiiiiiiiiiiiite a lot of time, and headaches `:-)`
This patch implements a method that returns a Steiner Quadruple System
whenever it exists. It follows the construction from Haim Hanani in a
paper from 1960, which gives 6 differents constructions to make a large
system from a small one, and all must be used to solve all cases.
Considering that I was able to test this code until `n =300`, and that all
constructions have been tested for different values of `n`, I believe that
this code is a correct counterpart of the paper itself. That's what makes
me think that there is no typo in the code anymore (I fixed one thousand
of them while writing it). So, even if it is very, very scary and unclear,
I think that it is correct... Experimentally `:-)`
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14562#comment:1>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
