The following pages link to (Q4940063):
Displaying 6 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs (Q868334) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← 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)
- On the minimum size of complete arcs and minimal saturating sets in projective planes (Q2441416) (← links)
