\documentclass[11pt]{amsart} \pdfsuppressptexinfo=-1 \usepackage[margin=1.1in]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{booktabs,enumitem,array,tabularx,longtable} \usepackage{xurl} \usepackage[hidelinks]{hyperref} \hypersetup{pdftitle={Subplanes of order 3 and maximal arcs in projective planes of order 12}, pdfauthor={Tejasvi Singh Tomar}} \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{conjecture}[theorem]{Conjecture} \newtheorem{problem}[theorem]{Problem} \newtheorem{introthm}{Theorem} \renewcommand{\theintrothm}{\Alph{introthm}} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{remark}[theorem]{Remark} \newtheorem{example}[theorem]{Example} \newcommand{\PG}{\mathrm{PG}} \newcommand{\AG}{\mathrm{AG}} \newcommand{\PGL}{\mathrm{PGL}} \newcommand{\AGL}{\mathrm{AGL}} \newcommand{\GL}{\mathrm{GL}} \newcommand{\Aut}{\mathrm{Aut}} \newcommand{\F}{\mathbb{F}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\cK}{\mathcal{K}} \newcommand{\cD}{\mathcal{D}} \newcommand{\cS}{\mathcal{S}} \newcommand{\cC}{\mathcal{C}} \newcommand{\comp}{$\dagger$} \DeclareUrlCommand\file{\urlstyle{tt}} \DeclareUrlCommand\lean{\urlstyle{tt}} \makeatletter\g@addto@macro\UrlBreaks{\do\_}\makeatother \newcommand{\todo}[1]{\textbf{[TODO: #1]}} \begin{document} \title{Subplanes of order 3 and maximal arcs in projective planes of order 12} \author{Tejasvi Singh Tomar} \renewcommand{\urladdrname}{{\itshape ORCID}} \urladdr{\href{https://orcid.org/0000-0003-4668-3639}{https://orcid.org/0000-0003-4668-3639}} \subjclass[2020]{51E15; 05B07, 05B15, 51E21} \keywords{Projective plane of order 12, subplane, maximal arc, Kirkman triple system, covering set of spreads, mutually orthogonal Latin squares, SAT solving, formal verification} \begin{abstract} Whether a projective plane of order 12 exists is open. A subplane of order 3 of such a plane is a case of equality in Bruck's bound $n\ge m^2+m$; the 27 points on no line of the subplane then form a maximal arc of degree 3, and together with the subplane a maximal arc $K$ of degree 4. We show that every line of a subplane of order 3 contained in $K$ lies in at most two such subplanes, whereas in $\PG(3,3)$, which like $K$ has 40 points, a line lies in four planes; the proof uses Egan and Wanless's classification of triples of mutually orthogonal Latin squares of order 9. We also show that $\AG(3,3)$ is not the design of any maximal arc of degree 3 in a plane of order 12, and that a permutation of the points that maps a subplane of order 3 onto itself and each line meeting it onto a line cannot have prime order other than 3. The proofs are computer-assisted, and their SAT refutations are certified. \end{abstract} \maketitle \section{Introduction}\label{sec:intro} Projective planes of order $n$ exist for all prime powers $n$, and no plane of any other order is known. The Bruck--Ryser theorem \cite{BR49} excludes infinitely many orders, and a large computer search excluded order 10 \cite{Lam91}. The smallest open order is 12. Most of the work on order 12 concerns collineations. A series of papers by Janko and van Trung, by Horvati\'c-Baldasar, Kramer and Matuli\'c-Bedeni\'c, by Suetake, and by Akiyama, Suetake and Tanaka shows that a collineation group of a plane of order 12 has order 1, 2 or 3 \cite{AST23}. The introduction of \cite{AST19} surveys the earlier steps. Hall and Wilkinson \cite{HW84} studied the ternary code of such a plane. This paper concerns subplanes. Bruck \cite{Bru55} proved that a proper subplane of order $m$ of a projective plane of order $n$ satisfies $n=m^2$ or $n\ge m^2+m$. For $n=12$ this leaves $m\in\{2,3\}$, and $m=3$ is a case of equality: $12=3^2+3$. Janko and van Trung \cite{JvT80} showed that a plane of order 12 has no collineation of order 13 that leaves a subplane of order 3 invariant. Their proof uses their classification of the Kirkman triple systems of order 27 with an automorphism of order 13 \cite{JvT81}, and they later excluded collineations of order 13 altogether \cite{JvT82a}. We do not assume any collineations. Throughout, $\pi$ is a projective plane of order 12 and $\pi_0$ is a subplane of order 3. A point outside $\pi_0$ is \emph{free} if it lies on no line of $\pi_0$, and \emph{non-free} otherwise. A line that meets $\pi_0$ in exactly one point is a \emph{tangent}. We write $F$ for the set of free points and $K=\pi_0\cup F$. A \emph{maximal arc of degree $d$} in a projective plane of order $n$ is a set of points that meets each line in $0$ or $d$ points. Such an arc has $(d-1)(n+1)+1$ points, and $d$ divides $n$ unless $d=n+1$. Denniston \cite{Den69} constructed maximal arcs of all degrees $d$ dividing $q$ in $\PG(2,q)$ for $q$ even, and Ball, Blokhuis and Mazzocca \cite{BBM97} proved that $\PG(2,q)$ has none with $1{\raggedright}p{2.3cm}>{\raggedright}p{5.3cm}>{\raggedright}p{1.9cm}>{\raggedright\arraybackslash}p{5.9cm}@{}} \caption{How the results are established. Lean theorems about formulas, and searches proved complete, are evaluated by \texttt{native\_decide}; the theorems about formulas have the hypotheses described in Section~\ref{sec:verification}.}\label{tab:verify}\\ \toprule Result & Method & Certificate & Lean \\ \midrule \endfirsthead \toprule Result & Method & Certificate & Lean \\ \midrule \endhead \bottomrule \endfoot Thms.~\ref{thm:spreads}, \ref{thm:affine} & dancing links and SAT, three cases & LRAT & theorems \\ Prop.~\ref{prop:threelines} & enumeration; SAT, two formulas & LRAT & theorems for the SAT part \\ Thm.~\ref{thm:agcover} & SAT, $23$ leaves & LRAT & theorems \\ Thm.~\ref{thm:z13sub} & SAT, one formula & LRAT & theorem \\ Rem.~\ref{rem:jvt} & exact cover and orbit count & --- & the $14{,}520$ classes recounted \\ Prop.~\ref{prop:z13kts} & search over $657\cdot4$ labelled systems & --- & search proved complete \\ Thm.~\ref{thm:z13arc} & dancing links over $3{,}291{,}704$ designs and $38{,}288$ systems & --- & searches proved complete \\ Thm.~\ref{thm:z13design} & dancing links over $38{,}284$ systems & --- & search proved complete \\ Lem.~\ref{lem:elation} & SAT form of the lemma, one formula & LRAT & theorem \\ Prop.~\ref{prop:involution} & hand proof and SAT; every case also by SAT & LRAT & theorems \\ Cor.~\ref{cor:primes} & hand proof from Thm.~\ref{thm:z13sub} and Prop.~\ref{prop:involution} & --- & kernel, with these two results as hypotheses \\ Lem.~\ref{lem:fixedtriples} & SAT for the $30$ cases excluded by hand & LRAT, \texttt{lrat-check} only & --- \\ Thm.~\ref{thm:oneline} & SAT, $1855$ formulas & LRAT & compiled checker (Section~\ref{sec:verification}) \\ Cor.~\ref{cor:twoplanes} & hand proof from Thm.~\ref{thm:oneline} and Lems.~\ref{lem:k9sub}--\ref{lem:sizes} & --- & --- \\ Prop.~\ref{prop:single} & explicit example & --- & kernel \\ Ex.~\ref{ex:heis} & explicit example; search & --- & kernel: the isomorphism, the resolutions and the lines with $\Gamma_L\cong3K_9$ \\ \addlinespace Thms.~\ref{thm:incidence}, \ref{thm:reduction}; Cors.~\ref{cor:kts}, \ref{cor:natural}; Props.~\ref{prop:stab}, \ref{prop:arcs}; Lems.~\ref{lem:forced}, \ref{lem:spreadfamily}, \ref{lem:arccover}, \ref{lem:basic}, \ref{lem:elation}, \ref{lem:fixedtriples}, \ref{lem:k9sub}--\ref{lem:td} & hand proofs & --- & kernel; hypotheses: the theorem of Hall and Bruck for Thm.~\ref{thm:reduction}, \cite{AST23} and the classification of involutions \cite{HP73} for Prop.~\ref{prop:stab} \\ \end{longtable} } \section*{Acknowledgements} Generative AI tools were used to write code, run analyses and draft text; the author directed the work and takes full responsibility for its content. \bibliographystyle{amsalpha} \bibliography{refs} \end{document}