Search arXivSearch

arXiv · 2310.18470

On the classification of low degree ovoids of $Q^+(5,q)$

Abstract

Ovoids of the Klein quadric $Q^+(5,q)$ of $\mathrm{PG}(5,q)$ have been studied in the last 40 year, also because of their connection with spreads of $\mathrm{PG}(3,q)$ and hence translation planes. Beside the classical example given by a three dimensional elliptic quadric (corresponding to the regular spread of $\mathrm{PG}(3,q)$) many other classes of examples are known. First of all the other examples (beside the elliptic quadric) of ovoids of $Q(4,q)$ give also examples of ovoids of $Q^+(5,q)$. Another important class of ovoids of $Q^+(5,q)$ is given by the ones associated to a flock of a three dimensional quadratic cone. To every ovoid of $Q^+(5,q)$ two bivariate polynomials $f_1(x,y)$ and $f_2(x,y)$ can be associated. In this paper, we classify ovoids of $Q^+(5,q)$ such that $f_1(x,y)=y+g(x)$ and $\max\{deg(f_1),deg(f_2)\}<(\frac{1}{6.3}q)^{\frac{3}{13}}-1$, that is $f_1(x,y)$ and $f_2(x,y)$ have "low degree" compared with $q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniele Bartoli, Nicola Durante, Giovanni Giuseppe Grimaldi. 2023-10-27. On the classification of low degree ovoids of $Q^+(5,q)$. https://arxiv.org/abs/2310.18470

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO