#15431: Transversal Design TD(6,12)
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.2
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 4adf6b5792919daea356c66d511fc621776d0a77
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/15431 |
Dependencies: |
#15287 #15368 |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Hi Nathann,
I am very happy with the `EmptySetError`. Could you raise it *before* the
check t=2 ?
OA and TD are the same objects up to relabeling. More precisely, an OA is
a TD with sets V1 = V2 = ... = Vn = [n] whereas you choose the convention
V1 = [n], V2 = [n,2n], ... for the TD. I do not see the point of having
two different functions... please tell me.
It seems that backtracking might be an approach to build TD when there are
no other constructions. It might also be helpful to build all TD up to
isomorphism. Do you know how hard would it be ?
Curiosity question: if you build a TD with k=n+t-1 do we know if for any
two Si, Sj their intersection has t-1 elements ? (answering yes would help
the backtracking)
--
Ticket URL: <http://trac.sagemath.org/ticket/15431#comment:10>
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.
