Search arXivSearch

arXiv · 2309.10866

Determination of hyperovals by lines through a few points

Abstract

If S is a set of q+2 points in P^2(F_q) such that some point of S is not on any line containing two other points of S, then in suitable coordinates S has the form S_f:={(c:f(c):1) : c in F_q} U {(1:0:0),(0:1:0)} for some f(X) in F_q[X]. Let T be a subset of S_f which contains the two infinite points and at least 3+log_3(q)/4 finite points. We show that if there is no line passing through a point of T and two other points of S_f, and deg(f)<=q^{1/4}, then no three points of S_f are collinear, so that S_f is a hyperoval. We also determine all f(X) with deg(f)<=q^{1/4} for which S_f is a hyperoval, which strengthens a result that was proved by Caullery and Schmidt using entirely different methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiguo Ding, Michael E. Zieve. 2023-09-19. Determination of hyperovals by lines through a few points. https://arxiv.org/abs/2309.10866

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO