#16655: Resolvable TD/OA
-----------------------------------------+----------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorial designs | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #16598 | Stopgaps:
-----------------------------------------+----------------------------
Changes (by ncohen):
* status: new => needs_review
Old description:
> A resolvable `OA(k,n)` is a `OA(k,n+1)`. This is just user interface,
> nothing smart.
>
> Nathann
New description:
A resolvable `OA(k,n)` is a `OA(k,n+1)`, and the same holds for TD of
course. This patch adds a "resolvable" boolean to the two constructors to
get resolvable designs.
For OA, the classes are provided by sorting the blocks appropriately.
For TD, which are now `IncidenceStructure`, the same is not possible as
incidence structure sort their blocks. Thuuuuuus I was forced to create a
(useful) `is_resolvable` function (expect it to be slow on non-
ridiculously-small input) which returns the classes.
This is what turned this a priori straightforward patch into ... my whole
morning `:-P`
Nathann
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/ticket/16655#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.
For more options, visit https://groups.google.com/d/optout.
