#16866: Radical difference families
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | 58fed55ef22232a32f3beffae76f4121e775c58e
u/vdelecroix/16866 | Stopgaps:
Dependencies: #16863 |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
I am trying to review this patch but I am lost in many places for the
moment, so it may not be ligthning quick. About {{{one_cyclic_tiling}}}:
the DLX algorithm is a pure exhaustive search. It enumerates all subsets
of tiles, and explores everything until the current set cannot be extended
anymore. There is no "smart cut" to detect easily that something cannot be
completed. That algorithm is nothing but a "very careful and smart"
implementation of that search, and so I do not believe that it is always
the best.
Theoretically, what should be called there is `IncidenceStructure.packing`
(this is exactly the problem that you want to solve).
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16866#comment:11>
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.
