Opened 7 years ago

Last modified 7 years ago

#16655 closed enhancement

Resolvable TD/OA — at Version 1

Reported by: ncohen Owned by:
Priority: major Milestone: sage-6.4
Component: combinatorial designs Keywords:
Cc: vdelecroix, knsam, dimpase, brett Merged in:
Authors: Nathann Cohen Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: #16598 Stopgaps:

Status badges

Description (last modified by ncohen)

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

Change History (1)

comment:1 Changed 7 years ago by ncohen

  • Description modified (diff)
  • Status changed from new to needs_review
Note: See TracTickets for help on using tickets.