Abstract
A computer search method for finding small complete caps inPG(d,q) is considered. The problem is formulated as a combinatorial optimization problem to which record-to-record travel, a stochastic local search method, is applied. Several new complete caps are found and upper bounds on the number of points in the smallest complete caps inPG(d,q) are tabulated for small parameters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
