In this article we present the largest set of unitals (totally 553) in projective planes of order 16. An open question is what is the number of the known unitals that are non-isomorphic to the reported ones. The results are obtained with a program that implements author's algorithm.
In this study we performed a computer search for unitals in planes of order 16. Some new unitals were found and we show that some unitals can be embedded in two or more different planes.
We show that the Ree unital $\mathcal{R}(q)$ has an embedding in a projective plane over a field $F$ if and only if $q=3$ and $\mathbb{F}_8$ is a subfield of $F$. In this case, the embedding is unique up to projective linear transformations. Besides elementary calculations, our proof uses the classification of the maximal subgroups of the simple Ree groups.
In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one unitals have been found for most of the planes. The found unitals for a given plane are nonisomorphic each other. There are a few unitals isomorphic to a unital of another plane. A t - (v; k; λ) design D is a set X of points together with a family B of k-subsets of X called blocks with the property that every t points are contained in exactly λ blocks. The design …
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…
An Erdős-Ko-Rado set in a block design is a set of pairwise intersecting blocks. In this article we study Erdős-Ko-Rado sets in 2-(v,k,1) designs, Steiner systems. The Steiner triple systems and other special classes are treated separately. For unitals we also determine an upper bound on the size of the second-largest maximal Erdos-Ko-Rado sets.
Bishnoi conjectured that if a minimal t-fold blocking set in a projective plane of prime power order has maximal size then it is either a projective plane minus one point, the complement of a Baer subplane or a unital. In this note we prove this conjecture.
Let $\cU$ be a unital embedded in the Desarguesian projective plane $\PG(2,q^2)$. Write $M$ for the subgroup of $\PGL(3,q^2)$ which preserves $\cU$. We show that $\cU$ is classical if and only if $\cU$ has two distinct points $P,Q$ for which the stabiliser $G=M_{P,Q}$ has order $q^2-1$.
In the Boolean lattice, Sperner's, Erdős's, Kleitman's and Samotij's theorems state that families that do not contain many chains must have a very specific layered structure. We show that if instead of $\mathbb{Z}_2^n$ we work in $\mathbb{Z}_{2^n}$, several analogous statements hold if one replaces the word $k$-chain by projective cube of dimension $2^{k-1}$. We say that $B_d$ is a projective cube of dimension $d$ if there are numbers $a_1, a_2, \ldots, a_d$ such that $$B_d = \left\{\sum_{i\in I} a_i \bigg\rvert \emptyset \neq I\subseteq [d]\right\}.$$ As an analog of Sperner's and Erdős's the…
In this article, we analyse maximal sets of $k$-spaces, in PG(n,q) and AG(n,q), $n>2k+t+2$, that pairwise meet in at least a $t$-space. It is known that for both PG(n,q) and AG(n,q), the largest example is a $t$-pencil, i.e. the set of all $k$-spaces containing a fixed $t$-space. In this paper, we analyse the structure of the second largest maximal example in both PG(n,q) and AG(n,q).
Let $Γ$ be the graph whose vertices are the chambers of the finite projective space $PG(3,q)$ with two vertices being adjacent when the corresponding chambers are in general position. It is known that the independence number of this graph is $(q^2+q+1)(q+1)^2$. For $q\ge 43$ we determine the largest independent set of $Γ$ and show that every maximal independent set that is not a largest one has at most constant times $q^3$ elements. For $q\ge 47$, this information is then used to show that $Γ$ has chromatic number $q^2+q$. Furthermore, for many families of generalized quadrangles we prove simi…
In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also show that equality can be attained in this bound whenever q is an even power of two.
We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are largest. For $k\ne 2,3,7,57$, we show an upper bound $n\leq k^2-k+1$, with equality if and only if there exists a finite projective plane of order $k-1$ that admits a polarity.
Let $Π$ be a projective plane of order $n$ and $Γ_Π$ be its Levi graph (the point-line incidence graph). For fixed $k \geq 3$, let $c_{2k}(Γ_Π)$ denote the number of $2k$-cycles in $Γ_Π$. In this paper we show that $$ c_{2k}(Γ_Π) = \frac{1}{2k}n^{2k} + O(n^{2k-2}), \hspace{0.5cm} n \rightarrow \infty. $$ We also state a conjecture regarding the third and fourth largest terms in the asymptotic of the number of $2k$-cycles in $Γ_Π$. This result was also obtained independently by Voropaev in 2012. Let $\text{ex}(v, C_{2k}, \mathcal{C}_{\text{odd}}\cup \{C_4\})$ denote the greatest number of $2k$-…
Linear set in projective spaces over finite fields plays central roles in the study of blocking sets, semifields, rank-metric codes and etc. A linear set with the largest possible cardinality and the maximum rank is called maximum scattered. Despite two decades of study, there are only a few number of known maximum scattered linear sets in projective lines, including the family constructed by Csajbók, Marino, Polverino and Zanella 2018, and the family constructed by Csajbók, Marino, Zullo 2018 (also Marino, Montanucci, and Zullo 2020). This paper aims to solve the equivalence problem of the li…