On 4-general sets in finite projective spaces

05/23/2023
by   Francesco Pavese, et al.
0

A 4-general set in PG(n,q) is a set of points of PG(n,q) spanning the whole PG(n,q) and such that no four of them are on a plane. Such a pointset is said to be complete if it is not contained in a larger 4-general set of PG(n, q). In this paper upper and lower bounds for the size of the largest and the smallest complete 4-general set in PG(n,q), respectively, are investigated. Complete 4-general sets in PG(n,q), q ∈{3,4}, whose size is close to the theoretical upper bound are provided. Further results are also presented, including a description of the complete 4-general sets in projective spaces of small dimension over small fields and the construction of a transitive 4-general set of size 3(q + 1) in PG(5, q), q ≡ 1 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2018

Packing Plane Spanning Trees into a Point Set

Let P be a set of n points in the plane in general position. We show tha...
research
08/08/2018

An Improved Bound for Weak Epsilon-Nets in the Plane

We show that for any finite set P of points in the plane and ϵ>0 there e...
research
03/24/2022

Geometric Dominating Sets

We consider a minimizing variant of the well-known No-Three-In-Line Prob...
research
03/29/2021

An upper bound on the size of Sidon sets

In this entry point into the subject, combining two elementary proofs, w...
research
09/20/2022

New lower bounds for cap sets

A cap set is a subset of 𝔽_3^n with no solutions to x+y+z=0 other than w...
research
05/07/2021

Bounds for the sum of distances of spherical sets of small size

We derive upper and lower bounds on the sum of distances of a spherical ...
research
02/07/2019

Bounds for the VC Dimension of 1NN Prototype Sets

In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an im...

Please sign up or login with your details

Forgot password? Click here to reset