18 research outputs found
Stability of Erd\H{o}s-Ko-Rado Theorems in Circle Geometries
Circle geometries are incidence structures that capture the geometry of
circles on spheres, cones and hyperboloids in 3-dimensional space. In a
previous paper, the author characterised the largest intersecting families in
finite ovoidal circle geometries, except for M\"obius planes of odd order. In
this paper we show that also in these M\"obius planes, if the order is greater
than 3, the largest intersecting families are the sets of circles through a
fixed point. We show the same result in the only known family of finite
non-ovoidal circle geometries. Using the same techniques, we show a stability
result on large intersecting families in all ovoidal circle geometries. More
specifically, we prove that an intersecting family in one of the
known finite circle geometries of order , with , must consist of circles through a common
point, or through a common nucleus in case of a Laguerre plane of even order.Comment: 18 page
Small weight codewords of projective geometric codes II
The -ary linear code is defined as the row space of
the incidence matrix of -spaces and points of . It is
known that if is square, a codeword of weight exists that cannot be written as a linear combination
of at most rows of . Over the past few decades, researchers have
put a lot of effort towards proving that any codeword of smaller weight does
meet this property. We show that if is a composite prime
power, every codeword of up to weight is a linear combination of at most rows of
. We also generalise this result to the codes ,
which are defined as the -ary row span of the incidence matrix of -spaces
and -spaces, .Comment: 22 page
On additive MDS codes with linear projections
We support some evidence that a long additive MDS code over a finite field
must be equivalent to a linear code. More precisely, let be an -linear MDS code over . If ,
, , and has three
coordinates from which its projections are equivalent to linear codes, we prove
that itself is equivalent to a linear code. If , , and there
are two disjoint subsets of coordinates whose combined size is at most
from which the projections of are equivalent to linear codes, we prove that
is equivalent to a code which is linear over a larger field than .Comment: 15 page
On the minimum size of linear sets
Recently, a lower bound was established on the size of linear sets in
projective spaces, that intersect a hyperplane in a canonical subgeometry.
There are several constructions showing that this bound is tight. In this
paper, we generalize this bound to linear sets meeting some subspace in a
canonical subgeometry. We obtain a tight lower bound on the size of any
-linear set spanning in case that
and is prime. We also give constructions of linear sets attaining equality
in the former bound, both in the case that is a hyperplane, and in the
case that is a lower dimensional subspace.Comment: 24 pages; the updated version contains a consequences of the recent
paper by Csajb\'ok, Marino and Pepe (arXiv:2306.07488), providing a tight
lower bound in some case
Association schemes and orthogonality graphs on anisotropic points of polar spaces
In this paper, we study association schemes on the anisotropic points of
classical polar spaces. Our main result concerns non-degenerate elliptic and
hyperbolic quadrics in PG with odd. We define relations on the
anisotropic points of such a quadric that depend on the type of line spanned by
the points and whether or not they are of the same "quadratic type". This
yields an imprimitive -class association scheme. We calculate the matrices
of eigenvalues and dual eigenvalues of this scheme.
We also use this result, together with similar results from the literature
concerning other classical polar spaces, to exactly calculate the spectrum of
orthogonality graphs on the anisotropic points of non-degenerate quadrics in
odd characteristic and of non-degenerate Hermitian varieties. As a byproduct,
we obtain a -class association scheme on the anisotropic points of
non-degenerate Hermitian varieties, where the relation containing two points
depends on the type of line spanned by these points, and whether or not they
are orthogonal.Comment: 29 pages. Update: an extra reference was adde
Additive MDS codes
We prove that an additive code over a finite field which has a few projections
which are equivalent to a linear code is itself equivalent to a linear code, providing the code is not too short.Postprint (published version
The minimum weight of the code of intersecting lines in
We characterise the minimum weight codewords of the -ary linear code of
intersecting lines in , , , prime, . If is even, the minimum weight equals . If is odd, the
minimum weight equals . For even, we also characterise the
codewords of second smallest weight.Comment: 12 page
Blocking subspaces with points and hyperplanes
In this paper, we characterise the smallest sets consisting of points and
hyperplanes in , such that each -space is incident with at
least one element of . If , then the smallest
construction consists only of points. Dually, if , the
smallest example consists only of hyperplanes. However, if ,
then there exist sets containing both points and hyperplanes, which are smaller
than any blocking set containing only points or only hyperplanes.Comment: 7 pages. UPDATE: After publication of this paper, we found out that
in case , the correct lower bound and a classification of
the smallest examples was already established by Blokhuis, Brouwer, and
Sz\H{o}nyi [A. Blokhuis, A. E. Brouwer, T. Sz\H{o}nyi. On the chromatic
number of -Kneser graphs. Des. Codes Crytpogr. 65:187-197, 2012
On -ovoids of with odd
In this paper, we provide a construction of -ovoids of the hyperbolic
quadric , an odd prime power, by glueing -ovoids of the
elliptic quadric . This is possible by controlling some intersection
properties of (putative) -ovoids of elliptic quadrics. It yields eventually
-ovoids of not coming from a -system. Secondly, we also
construct -ovoids for in . Therefore we
first investigate how to construct spreads of \pg(3,q) that have as many
secants to an elliptic quadric as possible
Small weight code words arising from the incidence of points and hyperplanes in PG()
Let be the code arising from the incidence of points and
hyperplanes in the Desarguesian projective space PG(). Recently, Polverino
and Zullo proved that within this code, all non-zero code words of weight at
most are scalar multiples of either the incidence vector of one
hyperplane, or the difference of the incidence vectors of two distinct
hyperplanes. We improve this result, proving that when and
, all code words of weight at most
are linear combinations of incidence
vectors of hyperplanes through a fixed -space. Depending on the omitted
value for , we can lower the bound on the weight of to obtain the same
results