Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.03059

Eggs in finite projective spaces and unitals in translation planes

Giusy Monzillo·Tim Penttila·Alessandro Siciliano
View original source ↗Read source document ↗Export metadata ↓

Abstract

Inspired by the connection between ovoids and unitals arising from the Buekenhout construction in the André/Bruck-Bose representation of translation planes of dimension at most two over their kernel, and since eggs of PG(4m-1,q), m>=1, are a generalization of ovoids, we explore the relation between eggs and unitals in translation planes of higher dimension over their kernel. By investigating such a relationship, we construct a unital in the Dickson semifield plane of order 3^{10}, which is represented in PG(20,3) by a cone whose base is a set of points constructed from the dual of the Penttila-Williams egg in PG(19,3). This unital is not polar; so, up to the knowledge of the authors, it seems to be a new unital in such a plane.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giusy Monzillo, Tim Penttila, Alessandro Siciliano. 2023-01-08. Eggs in finite projective spaces and unitals in translation planes. https://arxiv.org/abs/2301.03059

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗