AbstractLet m2′(3,q) be the largest value of k (k<q2+1) for which there exists a complete k-cap in PG(3,q), q even. In this paper, the known upper bound on m2′(3,q) is improved. We also improve a number of intervals, for k, for which there does not exist a complete k-cap in PG(3,q), q even
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the si...
In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of 픽nq with no ...
It has been verified that in PG(4,4) the smallest size of complete caps is 20 and that the values fr...
AbstractA very difficult problem for complete caps in PG(r,q) is to determine their minimum size. Th...
AbstractThe smallest known complete caps in PG(n,2) have size 23(2(n−6)/2)−3 if n≥10 is even and siz...
We settle the question of the maximal size of caps in PG(4, 4), with the help of a computer program
The smallest known complete caps in PG(n, 2) have size 23(2 (n−6)/2) − 3ifn ≥ 10 is even and size 1...
AbstractIn 1959, Segre constructed a complete (3q+2)-cap inPG(3, q),qeven. This showed that the size...
AbstractIn PG(3,q) with q≡3mod4 and q⩾7, a complete (q2+q+4)/2-cap is constructed. A characterizatio...
AbstractOne of the crucial problem about caps is to determine the spectrum of the values of k for wh...
In this work complete caps in PG(N, q) of size O(q(N-1/2) log(300) q) are obtained by probabilistic ...
In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a sub...
AbstractWe prove that 45 is the size of the largest caps in AG(5,3), and such a 45-cap is always obt...
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the si...
In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a sub...
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the si...
In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of 픽nq with no ...
It has been verified that in PG(4,4) the smallest size of complete caps is 20 and that the values fr...
AbstractA very difficult problem for complete caps in PG(r,q) is to determine their minimum size. Th...
AbstractThe smallest known complete caps in PG(n,2) have size 23(2(n−6)/2)−3 if n≥10 is even and siz...
We settle the question of the maximal size of caps in PG(4, 4), with the help of a computer program
The smallest known complete caps in PG(n, 2) have size 23(2 (n−6)/2) − 3ifn ≥ 10 is even and size 1...
AbstractIn 1959, Segre constructed a complete (3q+2)-cap inPG(3, q),qeven. This showed that the size...
AbstractIn PG(3,q) with q≡3mod4 and q⩾7, a complete (q2+q+4)/2-cap is constructed. A characterizatio...
AbstractOne of the crucial problem about caps is to determine the spectrum of the values of k for wh...
In this work complete caps in PG(N, q) of size O(q(N-1/2) log(300) q) are obtained by probabilistic ...
In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a sub...
AbstractWe prove that 45 is the size of the largest caps in AG(5,3), and such a 45-cap is always obt...
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the si...
In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a sub...
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the si...
In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of 픽nq with no ...
It has been verified that in PG(4,4) the smallest size of complete caps is 20 and that the values fr...
DOI
Add to ORKG