1. Introduction
Algebraic varieties in a finite projective space have few finite
intersection sizes with all the members of one (or more than one)
prescribed family of subspaces. Thus, it is natural to ask if it is
possible to reconstruct their structure starting from these intersection
numbers and possibly other additional arithmetic and/or geoemetric
conditions. A first example for such a characterization problem is the
famous theorem of B. Segre (1954) [9] which characterizes the non–degenerate
conics of , odd, as sets of –points intersected by any line in
at most two points. There is a wide literature devoted to this problem,
mostly when there are only two possibilities for the intersection sizes
(cf e.g. [2,5,7,8,10] and the
references cited therein). Whereas less is known, as regards sets with
more than two intersection sizes, (cf e.g. [3,4,10]).
Recently, some papers have been published concerning
characterizations of cones with a Baer subplane or an Hermitian arc as
base (director) curve in –dimensional finite projective spaces,
as sets of points of with three intersection numbers with respect to the planes
[1,6,4,3]. In [1], using a combination of
combinatorial methods and algebraic geometry over finite fields, the
author obtains a characterization of the Hermitian cone in as a surface of
degree and with intersection
sizes with the planes as those of an Hermitian cone and using this
result on cones she gets also a characterization of (nonsingular)
Hermitian surfaces in .
In this paper, we present a combinatorial characterization of
Hermitian cones of starting from
slightly weaker conditions than those assumed in [1].
Before to state our result, we recall some definitions to which we
refer throughout the paper.
Let be the –dimensional
(desarguesian) projective pace of order , and be integers
such that and for any integer ,
, let denote the family of all
the –dimensional subspaces of
. A subset of points of is a –set of class
if for every . Furthermore, if for every there is at
least one subspace such that is of type . The integers are the
intersection numbers of (with respect to the dimension
). If one says that is of
line
(plane)–class
(type) (resp. ).
Let be a subset of
points of , a line (plane)
intersecting in exactly
points is called –line (plane). If a -line (plane) is called
tangent. An external line is
a –line.
An Hermitian arc (or
unital of is a set of points of of size and of line–type .
Let be a plane of and be a Hermitian arc in , and a point not in . A Hermitian
cone is the set of points of which is the union of
the lines through and any point
of .
We are going to prove the following result.
Theorem 1.1. Let be a prime power and be an integer. A set of points of of plane-type , such that
any line intersecting in at least points
is contained in ,
if is an –plane with no line contained
in , then at each point
of there is at
least one tangent line,
is a Hermitian cone of .
Let us end this section by recalling the statement of the result in
[1] referred to
above.
Theorem 1.2 (Aguglia 2019 [
1]).
Let be a
surface of degree of . If is of plane–type then is a cone projecting a
Hermitian curve in a plane from
a point not in .
In this theorem, –planes
not containing –lines, for
are nonsingular Hermitian
curves and so Hermitian arcs and therefore Theorem 1.1 shows
that it is not necessary to assume that all the planar slices of the set
are algebraic curves.
2. The proof
Throughout this section, the number of –lines, (), in a plane is denoted
with . For the
number of all –planes of and the number of all
–planes passing through a line
of the space are denoted with
and , respectively.
The following Lemmata give the proof of Theorem 1.
Lemma 2.1. is of plane–type
.
Proof. If , then , which is not possible. Thus, there is a point of point of
not in . Then, by Remark 3.2 in [7] either or and
. The latter
possibilty gives a contradiction and so it follows that . From it follows that , and so is of plane–type . 
Lemma 2.2. There is at least one
–line.
Proof. Let be a
–plane, if there is a
point of , say , in not on a –line, then counting the number of
points of via
the lines of passing through
gives , a
contradiction. Hence, every point of is on a –line. 
In particular, –lines do
exist and a –plane contains no external line.
Lemma 2.3. A
–plane which contains
no
–line intersects
in a Hermitian arc, and so
contains no external line.
Proof. Let be a
–plane with no line
contained in , then every
point of belongs
to exactly one tangent line and
–lines. Double counting gives
and , thus and
so the slice
is a set of points of of size
and of line type that is an hermitian arc. 
Lemma 2.4. There is no external line to
.
Proof. Assume on the contrary, that there is an external
line, say . All the planes on
are –planes, and so .
Let be a tangent line, counting
the number of points of
via the planes on , yields
thus , and .
So, and no –plane contains a tangent line. Let
be a –plane, on each point of there are at most two
–lines, and there exists a point,
say , of on exactly two –lines, one –line and two –lines. Let be the other two points of the
–line on . Since on each point of there is at least one –line, belongs to at least one –line, and since any –line not on has to intersect the two –lines on , it follows that on there is no –line, a contradiction. 
Hence, is a blocking
set. Thus, –planes intersects in exactly one –line.
If there is no –line, let
be a –plane, then counting its
number of points via the lines on a point of not in gives , a contradiction.
Thus, –lines do exist.
Proof. Let . If is a –plane and is the –line , then counting the
number of points of via
the planes on gives .
Let be a –line, counting the number of points
of via the planes on
gives and so
It follows that either and or
and . If , any –plane contains no –line, and so if is a –plane and is a point of , then , which is
not possible. Therefore, and on a –line there passes exactly one –plane. 
Lemma 2.6. Any line intersects
in
or
points.
Proof. Let be an
–line, with , then on there is no –plane. So, but
and so and .
Hence every line of intersects in or points. 
By the above proof, it follows that all the planes through a –line are –planes.
The basic equations for –sets
of points of of
plane–type are
Being it follows
that , and .
Lemma 2.7. A –plane contains at most one –line.
Proof. Let be a
–plane, and assume on the
contrary that it contains at least two –line, say and . Let be a point of . All
lines on contained in intersect in at least points, so the usual counting on gives , that is in on there is exactly one –line and –lines. Thus, in on each point of there
are exactly –lines and one –line, namely . Hence, . Since all the planes on a
–line are –planes, it follows that , a contradiction being . 
Let be a –line, and let and be the number of –planes and of –planes on , respectively. Counting the number
of points of via the
lines on gives
that is . So, either and or and . It follows that on a –line there is at most one –plane. Let be the set of all the –lines contained into exactly one
–plane. Double countings
give .
Lemma 2.8. No
–plane contains a
–line.
Proof. Let be a
–plane, and assume on the
contrary that it contains at least one –line, say . By the previous Lemma, is the unique –line contained in . It follows that on every point of
there are only and –lines. If is a –line different from and contained in a –plane, it intersects in a point of , otherwise there is no –plane on .
Since there are at least –lines different from . Let a line of , it has to
intersect both and since there is one –plane on . If intersect in a point different from , from Lemma 2.7 it follows that the three
lines and belong to a –plane having no tangent
lines. Thus, the usual counting argument on the point in this plane gives , a contradiction.
Hence all the –lines of
are concurrent in a
point of , say . Thus, on there are at least the –lines of and the line . Counting the number of points of
via the lines on gives , a
contradiction, and the statement is proved. 
Since a –plane with no
–line intersects in an Hermitian arc, it
follows that there are no –lines.
Let be a –plane, and let be a –line contained in . Let be a point of and let
a –line of on . Let be the point . Let be the number of –lines of on . Assume that there is no tangent line
on . Counting the number of
points of via
the lines passing through
gives
that is and so , a contradiction since .
Thus in , and so in every
–plane there is at least
one tangent line. So in every –plane all the –lines are concurrent in a point
on which there are all the tangent lines to of the plane, too. If is a –line of a –plane, since on each of its
point there is a –line and
since these lines have to be concurrent we have that the number of all
the –lines of a plane is .
So, in every –plane,
the –lines are part of a
pencil containing no –line.
Let be a –line and be a –plane. Let be the point of in which intersects . Through there are exactly one –plane, say and –planes , . The plane intersects in the only tangent
line at , the planes intersects in the remaining
–lines.
Any other –line, say
intersects , otherwise there is no –plane on and so counting the number of
points of through the
planes on gives .
All the –lines different
from are concurrent in a point
of , otherwise let and be two –lines intersecting in two different points. Then and are disjoint and so skew. Hence on
each of them there pass only planes, and so counting the
number of points of via
the planes on one of the ,
, gives a number bigger than
, a contradiction. Thus,
there is a point on such that on it there are –lines and all the other lines are
tangent ones.
Hence, is the
Hermitian cone with vertex and
base , and the
proof is complete.