Abstract:Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in three-dimensional space. In a previous paper, the author characterised the largest intersecting families in finite ovoidal circle geometries, except for Möbius planes of odd order. In this paper we show that also in these Möbius 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
“…While finalizing our manuscript, a stronger stability version of the above mentioned result for k = 2 was published by Adriaensen; see [2]. Our proof is different, based on polynomials and hence might be of independent interest.…”
Let U be a set of polynomials of degree at most k over F q , the finite field of q elements. Assume that U is an intersecting family, that is, the graphs of any two of the polynomials in U share a common point. Adriaensen proved that the size of U is at most q k with equality if and only if U is the set of all polynomials of degree at most k passing through a common point. In this manuscript, using a different, polynomial approach, we prove a stability version of this result, that is, the same conclusion holds if |U | > q k − q k−1 . We prove a stronger result when k = 2.For our purposes, we also prove the following results. If the set of directions determined by the graph of f is contained in an additive subgroup of F q , then the graph of f is a line. If the set of directions determined by at least q − √ q/2 affine points is contained in the set of squares/non-squares plus the common point of either the vertical or the horizontal lines, then up to an affinity the point set is contained in the graph of some polynomial of the form αx p k .
“…While finalizing our manuscript, a stronger stability version of the above mentioned result for k = 2 was published by Adriaensen; see [2]. Our proof is different, based on polynomials and hence might be of independent interest.…”
Let U be a set of polynomials of degree at most k over F q , the finite field of q elements. Assume that U is an intersecting family, that is, the graphs of any two of the polynomials in U share a common point. Adriaensen proved that the size of U is at most q k with equality if and only if U is the set of all polynomials of degree at most k passing through a common point. In this manuscript, using a different, polynomial approach, we prove a stability version of this result, that is, the same conclusion holds if |U | > q k − q k−1 . We prove a stronger result when k = 2.For our purposes, we also prove the following results. If the set of directions determined by the graph of f is contained in an additive subgroup of F q , then the graph of f is a line. If the set of directions determined by at least q − √ q/2 affine points is contained in the set of squares/non-squares plus the common point of either the vertical or the horizontal lines, then up to an affinity the point set is contained in the graph of some polynomial of the form αx p k .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.