Opened 2 years ago
Last modified 3 months ago
#30090 new enhancement
Implemented test function for BIBDs
Reported by: | gh-Ivo-Maffei | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-9.8 |
Component: | combinatorial designs | Keywords: | bibd |
Cc: | Dima Pasechnik | Merged in: | |
Authors: | Ivo Maffei | Reviewers: | |
Report Upstream: | N/A | Work issues: | |
Branch: | u/gh-Ivo-Maffei/bibd_tests (Commits, GitHub, GitLab) | Commit: | 675378180b8201601fcfa15226a0a2dcd7c7a2f1 |
Dependencies: | #30037 | Stopgaps: |
Description
Implemented a function to test the recursive construction given in the method balanced_incomplete_block_design
.
Change History (10)
comment:1 Changed 2 years ago by
Cc: | Dima Pasechnik added |
---|
comment:2 Changed 2 years ago by
I meant testing every construction available, as if you build a full database of (v,k,l) for which Sage does/does not know how to build a design.
comment:3 Changed 2 years ago by
Commit: | 5982cc82749c77d5193de24a8b4a50c4a05361ce → 675378180b8201601fcfa15226a0a2dcd7c7a2f1 |
---|
comment:4 Changed 2 years ago by
I rebased the branch to Sage 9.2.beta4. I know the docstring is wrong and the function now doesn't work (see #30102), but I would like to know if this is a good structure for the function.
The idea is to test whether Sage can build the BIBDs Sage claims to be able to build, then to test that there are not parameters that Sage is able to build but claims it can't.
It should be a quite comprehensive test, but it feels like the second part is going to be hard to maintain. I'm not sure that's the best approach. I'm not sure how much I should trust sage and the existing code and how much needs to be checked in the test function.
comment:5 Changed 2 years ago by
Milestone: | sage-9.2 → sage-9.3 |
---|
comment:6 Changed 22 months ago by
Milestone: | sage-9.3 → sage-9.4 |
---|
Setting new milestone based on a cursory review of ticket status, priority, and last modification date.
comment:7 Changed 17 months ago by
Milestone: | sage-9.4 → sage-9.5 |
---|
comment:8 Changed 12 months ago by
Milestone: | sage-9.5 → sage-9.6 |
---|
comment:9 Changed 8 months ago by
Milestone: | sage-9.6 → sage-9.7 |
---|
comment:10 Changed 3 months ago by
Milestone: | sage-9.7 → sage-9.8 |
---|
This function takes in a maximum value for
v
and a range forlambda
and then tests all possible BIBDs that can arise from the recursive construction. I'm not sure if this is what you meant, or if you were thinking at a more general function.