Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.03189

On Projective Planes of Order 16 Associated with 1-rotational 2-(52, 4, 1) Designs

Zazil Santizo Huerta·Melissa Keranen·Vladimir Tonchev
View original source ↗Read source document ↗Export metadata ↓

Abstract

A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a resolvable Steiner 2-((q-s+1)k, k, 1) design. Necessary and sufficient conditions for a resolvable Steiner 2- design to be embeddable as a maximal arc in a projective plane were proved recently in [8]. Steiner designs associated with maximal arcs in the known projective planes of order 16 were analyzed in [6], where it was shown that some of the associated designs are embeddable in two non-isomorphic planes. Using MAGMA, we conducted an analysis to ascertain whether any of the 22 non-isomorphic 1-rotational 2-(52,4,1) designs, previously classified in [3], could be embedded in maximal arcs of degree 4 within projective planes of order 16. This paper presents a summary of our findings, revealing that precisely only one out of the the twenty-two 1-rotational designs from [3] is embeddable in a plane of order 16, being the Desarguesian plane P G(2, 16).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zazil Santizo Huerta, Melissa Keranen, Vladimir Tonchev. 2024-03-05. On Projective Planes of Order 16 Associated with 1-rotational 2-(52, 4, 1) Designs. https://arxiv.org/abs/2403.03189

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗