The following pages link to (Q4352950):
Displaying 19 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Complete \((k,3)\)-arcs from quartic curves (Q281309) (← links)
- Existence of \(V(m,t)\) vectors (Q698033) (← links)
- Parallel methods for absolute irreducibility testing (Q1009361) (← links)
- On completing three cyclically generated transversals to a Latin square (Q1017414) (← links)
- On cyclically resolvable cyclic Steiner 2-designs (Q1284162) (← links)
- Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). (Q1428519) (← links)
- On plane arcs contained in cubic curves (Q1604419) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
- Small complete caps in three-dimensional Galois spaces (Q2447808) (← links)
- Algebraic constructions of complete \(m\)-arcs (Q2678450) (← links)
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order (Q2689353) (← links)
- \(V(m,t)\) and its variants (Q5935434) (← links)
- Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)
- Plane curves giving rise to blocking sets over finite fields (Q6063135) (← links)
- On complete \(m\)-arcs (Q6066480) (← links)
- Most plane curves over finite fields are not blocking (Q6201503) (← links)
