English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we present and analyze computational results concerning smallcomplete caps in the projective spaces $\mathrm{PG}(N,q)$ of dimension $N=3$and $N=4$ over the finite field of order $q$. The results have been obtainedusing randomized greedy algorithms and the algorithm with fixed order of points(FOP). The computations have been done in relatively wide regions of $q$values; such wide regions are not considered in literature for $N=3,4$. The newcomplete caps are the smallest known. Basing on them, we obtained new upperbounds on $t_2(N,q)$, the minimum size of a complete cap in $\mathrm{PG}(N,q)$,in particular, \begin{align*} &t_{2}(N,q)<\sqrt{N+2}\cdotq^{\frac{N-1}{2^{\vphantom{H}}}}\sqrt{\ln q},\quad q\in L_{N},\quad N=3,4,\\&t_{2}(N,q)<\left(\sqrt{N+1}+\frac{1.3}{\ln(2q)}\right)q^{\frac{N-1}{2^{\vphantom{H}}}}\sqrt{\ln q},\quad q\in L_{N},\quadN=3,4, \end{align*} where \begin{align*} &L_{3}:=\{q\le 4673, ~q\\textrm{prime}\} \cup \{5003,6007,7001,8009\},\\ &L_{4}:=\{q\le 1361, ~q\\textrm{prime}\} \cup \{1409\}. \end{align*} Our investigations and resultsallow to conjecture that these bounds hold for all $q$.

Tables, bounds and graphics of the smallest known sizes of complete caps in the spaces $\mathrm{PG}(3,q)$ and $\mathrm{PG}(4,q)$