The 95256-cap in PG(12; 4) is complete
Combinatorics
2015-09-24 v1
Abstract
We describe an algorithm for testing the completeness of caps in PG(r; q), q even. It allowed us to check that the 95256-cap in PG(12; 4) recently found by Fu el al. (see [14]) is complete.
Cite
@article{arxiv.1509.07059,
title = {The 95256-cap in PG(12; 4) is complete},
author = {D. Bartoli and S. Marcugini and A. Milani and F. Pambianco},
journal= {arXiv preprint arXiv:1509.07059},
year = {2015}
}
Related papers
View all related →
Combinatorics · Mathematics
A computer based classification of caps in PG(5,2)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
2012-03-06
Combinatorics · Mathematics
A computer based classification of caps in PG(4,2)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
2012-03-06
Combinatorics · Mathematics
A computer based classification of caps in PG(4,3)
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
2012-03-06
Combinatorics · Mathematics
On k-caps in PG(n, q), with q even and n \geq 4
Joseph A. Thas
2017-10-09
Combinatorics · Mathematics
New inductive constructions of complete caps in $PG(N,q)$, $q$ even
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
2009-01-06
Combinatorics · Mathematics
Completeness of cubic curves in PG(2, q), q <= 81
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
2015-10-29
Combinatorics · Mathematics
A probabilistic construction of small complete caps in projective spaces
Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco
2014-06-20
Combinatorics · Mathematics
Small complete caps in ${\rm PG}(4n + 1, q)$
Antonio Cossidente, Bence Csajbók, Giuseppe Marino, Francesco Pavese
2021-06-01
Combinatorics · Mathematics
On k-caps in PG(n, q), with q even and n \geq 3
J. A. Thas
2017-08-21
Logic in Computer Science · Computer Science
Admissibility in Finitely Generated Quasivarieties
George Metcalfe, Christoph Röthlisberger
2015-07-01
Combinatorics · Mathematics
Tables, bounds and graphics of the smallest known sizes of complete caps in the spaces $\mathrm{PG}(3,q)$ and $\mathrm{PG}(4,q)$
Daniele Bartoli, Alexander A. Davydov, Alexey A. Kreshchuk, Stefano Marcugini +1
2016-11-01
Combinatorics · Mathematics
Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture
Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
2017-06-08
Computational Complexity · Computer Science
Imperfect Gaps in Gap-ETH and PCPs
Mitali Bafna, Nikhil Vyas
2019-07-19
Computational Complexity · Computer Science
The Complexity of Checking Partial Total Positivity
Daniel Carter, Charles Johnson
2021-09-21
Combinatorics · Mathematics
On planar arcs of size $(q+3)/2$
Gülizar Günay, Michel Lavrauw
2021-05-25
Combinatorics · Mathematics
Minimal complete arcs in PG(2,q), q<= 32
Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
2010-05-20
Data Structures and Algorithms · Computer Science
Efficient Completion of Weighted Automata
Johannes Waldmann
2016-09-14
Computational Complexity · Computer Science
About accuracy of the solution of NP-complete tasks
Rustem Valeyev
2014-09-30
Computational Complexity · Computer Science
Refutation of Aslam's Proof that NP = P
Frank Ferraro, Garrett Hall, Andrew Wood
2009-05-15
Computational Complexity · Computer Science
Response to Refutation of Aslam's Proof that NP = P
Javaid Aslam
2017-10-10
Computational Complexity · Computer Science
The Packed Interval Covering Problem is NP-complete
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
2019-06-11
Logic · Mathematics
A Topological Completeness Theorem for Transfinite Provability Logic
Juan P. Aguilera
2019-05-07
Representation Theory · Mathematics
The Quiver Problem is NP Complete
Victor Kac, Bangzheng Li
2025-08-06
Computational Geometry · Computer Science
Spherical coverage verification
Marko D. Petkovic, Dragoljub Pokrajac, Longin Jan Latecki
2015-03-19
Combinatorics · Mathematics
New sizes of complete arcs in PG(2,q)
Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
2010-08-31