-
-
Notifications
You must be signed in to change notification settings - Fork 487
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Strength 2 Covering Array constructions #37372
Conversation
call them based on inputted paramters. Added methods include direct implementation of optimal arrays in the database of small combinatorial designs, methods that create a CA(N,t=2,k,v=2), for either k or N inputted and a recursive method that removes columns from a larger array. Added required documentation and reference for new methods.
Documentation preview for this PR (built with commit 0aa6f44; changes) is ready! 🎉 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This looks good in terms of logic. Some changes should be made for standardization and correctness.
more generally so it does not need to be changed if things are added. Also edited some functions to produce the same output more efficiently. Fixed some formatting and punctuation errors.
The Lint check is failing because of a 'check == True' statement I made. I used it because the function 'orthogonal_array' may output 'Unknown', in which case I would like to ignore it. What is the recommended way that I handle this? |
Changed ValueError to NotImplementedError
Co-authored-by: Matthias Köppe <mkoeppe@math.ucdavis.edu>
Co-authored-by: Matthias Köppe <mkoeppe@math.ucdavis.edu>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM
This patch aims to add functionality to the covering arrays module that was recently added to SageMath. It adds methods that create many covering arrays of strength 2 that can later be used for recursive constructions as well. Specifically: added methods to generate covering arrays and a main CA function to call them based on inputted parameters. Added methods include direct implementation of optimal arrays in the database of small combinatorial designs, methods that create a CA(N,t=2,k,v=2), for either k or N inputted and a recursive method that removes columns from a larger array. Added required documentation and reference for new methods. This fixes sagemath#37371 URL: sagemath#37372 Reported by: Aaron Dwyer Reviewer(s): Aaron Dwyer, Matthias Köppe, Sebastian Raaphorst
This patch aims to add functionality to the covering arrays module that was recently added to SageMath. It adds methods that create many covering arrays of strength 2 that can later be used for recursive constructions as well.
Specifically: added methods to generate covering arrays and a main CA function to call them based on inputted parameters.
Added methods include direct implementation of optimal arrays in the database of small combinatorial designs, methods that create a CA(N,t=2,k,v=2), for either k or N inputted and a recursive method that removes columns from a larger array. Added required documentation and reference for new methods.
This fixes #37371