WorksMathematics
On configurations that are nearly generalised polygons
Abstract
Payne (1972) introduced nearly generalised -gons as -regular bipartite graphs of girth with small excess over the Moore bound. Biggs and Ito (1980) proved nonexistence of such graphs if and , leaving open the existence of regular antipodal planes. We revisit this problem from several equivalent viewpoints. First we show that a regular antipodal plane of order is equivalent to a balanced weighing matrix whose support is the incidence matrix of a biplane with parameters This gives short determinant and local-arithmetic obstructions to existence. We then formulate the question of signing a biplane as an affine linear system over , and use this formulation to prove that no regular antipodal plane of order exists with . Finally, we give further equivalent formulations in terms of sharply deranged families of permutations and mutually orthogonal array-bic squares. These translations provide new computational and structural approaches to Payne's conjecture that regular antipodal planes exist only for .
Introduction
The cage problem is to determine the minimum number of vertices in a -regular graph of girth ; graphs attaining this bound are called cages. Although cages exist for all integers and , the exact value of is known only for a small number of parameter pairs, together with three infinite families occurring when and is a prime power. These families arise as the incidence graphs of generalised polygons. For the even-girth case, by counting out from a vertex, it is not difficult to see that a simple undirected -regular bipartite graph of even girth has at least
vertices, and those graphs meeting this bound are known as Moore graphs. Interestingly, there are very few Moore graphs. It has been proved that a bipartite Moore graph with has and is the incidence graph of a generalised -gon of order .
Payne [17] [17] introduced the notion of a nearly generalised -gon, by relaxing the condition that the number of vertices meets the Moore bound. These graphs have parameters , and they are -regular bipartite graphs of girth with
vertices. So for example, if , it is the incidence graph of a regular antipodal plane: a partial linear space of points and lines such that (i) every point is incident with lines, (ii) every line is incident with points, and (iii) for every point , there is a unique point not collinear with , and for every line , there is a unique line not concurrent with . Antipodal planes were studied by Dembowski [7 Section 7.4] as elliptic semi-planes with parallel classes of size , and he observed that they are -covers of biplanes. Payne showed that there are examples of nearly -gons for , but
2020 Mathematics Subject Classification. Primary 05B25; Secondary 05B05, 05B15, 51E12.
Key words and phrases. nearly generalised polygon; regular antipodal plane; biplane; balanced weighing matrix; weighing signing; sharply deranged permutations; equidistant permutation array; mutually orthogonal array-bic squares; loops. no examples for . Indeed, he conjectured that there are no examples for . He also showed that there are no nearly -gons for (with ). A substantial breakthrough was made by Biggs and Ito [4] in 1980: there is no nearly -gon (with ) for . So the problem reduces to the existence of regular antipodal planes. Throughout, we will assume .
Further work has been done recently by Schleiermacher [21] and De Boeck and Van de Voorde [6]. The latter showed that no antipodal plane of order can be embedded in a Desarguesian projective plane. Both papers note that a regular antipodal plane double covers a biplane, but did not note the existence of a weighing matrix, which imposes further restrictions on the possible orders of a regular antipodal plane.
In this paper we draw attention to some objects in graph theory, incidence geometry, and design theory that can be unified. For instance, a balanced weighing matrix with parameters is equivalent to a regular antipodal plane of order (see Theorem 2.2). Figure 1 gives an example of the three combinatorial objects that we will show are equivalent. Indeed, a regular antipodal plane is equivalent to a sharply deranged set of permutations, and hence gives rise to an equidistant permutation array. Through this connection, a recent result of Tolonen [25] implies that there is no regular antipodal plane of order 8. We show that there are no regular antipodal planes of order with (see § 2).

Figure 1. Three equivalent objects.
Declaration of AI use. We used AI (ChatGPT) to find references, such as the important work of Biggs and Ito [4] and the result of Schellenberg [20]. It also gave us the main idea of Proposition 2.12. We used it to write code to search for array-bic squares in Julia [3].
Nearly 3-gons, antipodal planes
Weighing matrices
A regular antipodal plane has the property that the star operation preserves incidence: if is a point incident with , then is incident with (see [6 Lemma 2.2]). We can define a biplane, a symmetric - design, in the following way: the points are the pairs , and the blocks are the pairs , and a point is incident with a block if is incident with or is incident with . Payne observes that the Bruck–Ryser–Chowla Theorem for symmetric designs, plus a linear algebraic property of the incidence matrix, give rise to infinitely many forbidden values of :
Theorem 2.1 (Payne [17 Theorems 5.1, 5.2]).
(a) If and if there is a prime congruent to 7 dividing the square-free part of , then no nearly 3-gon of order exists.
(b) If and if there is a prime congruent to 3 dividing the square-free part of , then no nearly 3-gon of order exists.
We observe that part of this result can be proved via the theory of weighing matrices, thus giving an alternative and shorter proof of [17 Theorem 5.2]. A weighing matrix of order and weight is a matrix with entries in such that . The absolute matrix of a -matrix is the matrix . A weighing matrix is a balanced weighing matrix with parameters if
Indeed, this is equivalent to being the incidence matrix of a symmetric balanced incomplete block design.
Theorem 2.2. A regular antipodal plane of order is equivalent to a balanced weighing matrix with and .
Proof. First suppose that is a regular antipodal plane of order . Let be the antipodal involution on points, and the antipodal involution on lines. Thus , and every point-pair and every line-pair has size 2. Hence there are point-pairs and the same number of line-pairs. Choose one representative from each point-pair and one representative from each line-pair. Define a matrix , with rows indexed by line-pairs and columns indexed by point-pairs, by
A line contains exactly points, no two of which are antipodal, so each row of has exactly nonzero entries.
We claim that distinct rows of are orthogonal. Let and be representatives of two distinct line-pairs. By regularity, meets both and in exactly one point. Write and . Then the corresponding two point-pairs and are distinct. In the column corresponding to , the two rows have the same sign, since both and contain the same point . Hence this column contributes to the row inner product. In the column corresponding to , the row for contains , whereas the row for contains , because contains . Hence this column contributes . All other columns contribute 0. Therefore the inner product of the two rows is . Thus
Now let . Each row of has size . Moreover, two distinct line-pairs meet in exactly two point-pairs, namely the point-pairs containing and . Hence
Equivalently, is the incidence matrix of a symmetric - design; a biplane. Therefore is a balanced weighing matrix with and .
Conversely, suppose that is a balanced weighing matrix with parameters . Thus , and is the incidence matrix of a biplane. The equation for symmetric designs gives , so . We construct an antipodal plane. For each column of , introduce two points and , and declare them antipodal. For each row , introduce two lines and , and declare them antipodal. Define incidence by
Thus if , neither nor lies on either or ; while if , each of and contains exactly one point from the antipodal pair . Since each row of has exactly nonzero entries, each line contains points. Similarly, since is square and , we also have , so each column has nonzero entries; hence each point lies on lines. The total number of points and lines is . It remains to check the partial linear space condition and the antipodal property. The two points and are not collinear, because every line contains at most one of them by construction. Now take two non-antipodal points and , with . Since is a symmetric - design, the two columns and have common support in exactly two rows, say and . Since , distinct columns of are orthogonal, so
Thus one of these two products is , and the other is . Therefore exactly one of the two rows, say , satisfies
For this row there is a unique choice of sign such that
Hence and lie on the unique line . Therefore any two non-antipodal points are joined by exactly one line, while antipodal points are joined by no line. This is precisely a regular antipodal plane of order .
Finally, the two constructions are inverse up to the choices of representatives. Changing the representative of a point-pair multiplies the corresponding column of by , and changing the representative of a line-pair multiplies the corresponding row by . Thus the equivalence is between regular antipodal planes of order and balanced weighing matrices with parameters , , up to the usual row and column sign changes and permutations.
Corollary 2.3. If a regular antipodal plane exists of order , then is a square.
Proof. Let , the order of . Now
So is a square. Hence, if is odd, then is a square. Note that is odd precisely when .
Before we show a unified approach to showing that certain families of weighing matrices do not exist, we address an observation by Mullin [16]. He lists necessary conditions for the existence of a balanced weighing matrix with parameters . The last one is attributed to Raghavarao [18], which we reproduce below. However, Raghavarao (in Section 4) does not explicitly state Mullin’s general condition (iv). He proves the ‘ case’, and his proof immediately extends to general .
Let and . Since is a square, we recover the biplane and weighing matrix conditions on and in one elegant form. Set . Since is an integral nonsingular matrix, is a square. The eigenvalues of are with multiplicity 1, and with multiplicity . Hence
Therefore is a square. It follows that
In particular, cannot be congruent to 5 or 7 modulo 8.
We now derive Raghavarao’s condition using the Hasse-Minkowski theorem. Let be an odd prime, and and rational numbers. The Hilbert symbol is defined as follows (see [22 §III.1.2, Theorem 1]). Let and be the -adic valuations of and respectively, and write and . Then
where and are Legendre symbols. From [22 §IV.3.3], one can derive the following version of the Hasse-Minkowski theorem.
Theorem 2.4 (Hasse-Minkowski). Let and be rational invertible matrices. Then and are congruent over (i.e. for some ) if and only if the following conditions hold:
(1) and have the same number of positive entries,
(2) the discriminants and belong to the same coset of ,
(3) for each odd prime ,
If a regular antipodal plane of order exists, then , so and must be congruent rational matrices. If we apply the above version of the Hasse-Minkowski theorem with and , then (1) trivially holds, (2) requires that is square, which holds because either
is square or is even, and (3) requires that for all odd primes . It is easy to see from the definition of the Hilbert symbol that with the -adic valuation of . Thus, the only new condition on that we find, happens when is odd – that is equivalent to 2 or 4 modulo 8 (since we already excluded 5 and 7) – and modulo 4. In that case, must divide an even number of times. If modulo 8, then we already know that must be square, so this trivially holds. Thus, we obtain the following theorem.
Theorem 2.5. If modulo 8, and a regular antipodal plane of order exists, then the square-free part of has no prime divisors congruent to 3 modulo 4.
If (mod 8), then (mod 4). Taking , the preceding theorem shows that no prime congruent to 3 (mod 8) divides the square-free part of . This recovers [17 Theorem 5.2].
We summarise the above results, including the Bruck-Ryser-Chowla Theorem applied to the biplane arising from a regular antipodal plane of order , in the theorem below. Together with the known examples for , it summarises the classical arithmetic restrictions on the orders of antipodal planes. We point out that was ruled out in [20], and cyclic1 regular antipodal planes do not exist for (see [17 p. 280]). Indeed, a cyclic antipodal plane is equivalent to a -modular Golomb ruler where (see [8 Section III]), and Gordon states that they do not exist for .
Theorem 2.6. Let be the order of a regular antipodal plane. Then one of the following holds:
(i) (mod 8), is a square, no prime congruent to 3 (mod 4) divides the square-free part of ;
(ii) (mod 8) and is a square, and ;
(iii) (mod 8) and is a square;
(iv) (mod 8) and is a square and no prime congruent to 7 (mod 8) divides the square-free part of .
In the next section, we will give new conditions that rule out certain orders, and give some information on the substructure of biplanes that give rise to antipodal planes.
Biplanes
Recall that a biplane is a symmetric design. There are only finitely many parameters for which we know that a biplane exists, and there are only 17 examples (up to isomorphism) known, including the complete design, and they have been classified for [10]. The known biplanes have . For the purposes of regular antipodal planes, the possible known biplanes arising can only have (see Corollary 2.3). The cases exist, and we can rule out a number of ways.
A signing of a biplane is a function , extended by for non-flags, yielding a matrix . The signing is a weighting signing if .
Moorehouse [15] studied the reconstruction of projective planes from homology semiplanes, reducing the choices in the double cover of the nonfixed part to linear equations over . The lemma below applies the same formulation to biplanes.
Lemma 2.7. Write for . Then is a weighing signing if and only if satisfies, for every unordered pair of distinct lines, meeting in two points and ,
Proof. Each row of has exactly nonzero entries, all , so each diagonal entry of is equal to . For distinct lines , meeting in points and ,
Both summands lie in , so the sum vanishes if and only if the summands are opposite signs, that is,
Substituting gives exactly (1). □
It is known via a result of [25] that there is no regular antipodal plane of order 8, but only once we establish a connection to equidistant permutation arrays in the next section. We show that we can use biplanes to establish this result.
Theorem 2.8. There is no regular antipodal plane of order 8 or 10.
Proof. If such a regular antipodal plane exists, then its antipodal quotient is a biplane of order 7 or 9 admitting a weighing signing. Let be such a biplane, and let be its bipartite incidence graph. By Lemma 2.7, a weighing signing is equivalent to a function such that, for every pair of distinct lines , meeting in the two points ,
Thus we need to decide whether this affine system over is soluble.
Take the flags of , equivalently the edges of , together with a new symbol . Let be the -vector space with basis . For each pair of distinct lines , meeting in , let denote the edge of , and form the vector
Let be the subspace of generated by all such vectors. The affine system above is soluble if and only if . Indeed, a solution defines a linear functional by
and the equations say exactly that vanishes on the generators of . Hence vanishes on , so . Conversely, if , then there is a linear functional vanishing on but with ; restricting to gives a solution of the system.
For each biplane of order 7 and each biplane of order 9, we constructed the corresponding subspace and row-reduced over . In every case the vector lies in . Therefore the system from Lemma 2.7 has no solution, and hence no such biplane admits a weighing signing. Consequently no regular antipodal plane of order 8 or 10 exists. □
If a regular antipodal plane of order exists, where , then Theorem 2.6 leaves only 2, 3, 8, 10 in that interval; Theorem 2.8 removes 8, 10. So we have:
Corollary 2.9. A regular antipodal plane of order exists if and only if .
Question 2.10. Does every finite -free bipartite graph occur as a subgraph of the incidence graph of some finite biplane?
All subgraphs of the incidence graph of a biplane are -free. As of the writing of this paper, there is no finite -free bipartite graph that has been shown to not be a subgraph of any incidence graph of a finite biplane.
However, for a biplane that is the quotient of an antipodal plane, the linear system constraint does forbid many subgraphs. Below we give all of the minimal forbidden -free graphs on at most 16 vertices, as well as a picture of the unique smallest one on 11 vertices, with 5 points and 6 lines (Figure 2). For brevity, they are given as sets of lines of an incidence structure with points. Note that from the point of view of incidence geometry, both the given configurations and their duals are forbidden.
Figure 2. A minimal forbidden -free graph on 11 vertices: 5 points and 6 lines.
The known biplanes up to duality in Table 2.2 are denoted by where , also known as the order of the biplane. When there is more than one nonisomorphic example, the letters are appended to distinguish them. The correspond in the literature as follows: correspond to in [2], correspond to in [19], respectively. The biplanes correspond to in [10], respectively. All the planes except order 11 can be downloaded from [9]. The known biplane of order 11 can be found in [1].
| Aut. group | |||||||||||||||||||
| 4 | |||||||||||||||||||
| 7 | |||||||||||||||||||
| 11 | × | × | × | ||||||||||||||||
| 16 | × | ||||||||||||||||||
| 16 | × | × | × | × | |||||||||||||||
| 16 | × | × | × | × | |||||||||||||||
| 37 | × | × | × | × | × | × | × | × | × | × | |||||||||
| 37 | × | × | × | × | × | × | × | × | × | × | × | × | × | × | |||||
| 37 | × | × | × | × | × | × | × | × | × | × | |||||||||
| 56 | × | ||||||||||||||||||
| 56 | × | × | × | × | × | × | × | × | × | × | × | × | × | × | × | ||||
| 56 | × | × | × | × | × | × | × | × | × | × | × | × | × | × | × | × | |||
| 56 | × | × | × | × | × | × | × | × | × | × | × | × | × | × | |||||
| 56 | × | × | × | × | × | × | × | × | × | × | × | × | × | × | × | × | |||
| 79 | × | × | × | × | × | × | × | × | × | × | × | × |
Table 1. Each row denotes a known biplane, up to duality. Each is a possible minimal obstruction to a signing, and a × denotes an occurrence in the relevant biplane. We have listed the automorphism groups of the biplanes here, for easier identification.
| Configuration | Forbidden configurations |
Table 2. Forbidden configurations.
This list was found in two ways, by first using Brendan McKay’s graph generation program geng [13] and independently by examining the subconfigurations of the known biplanes using GAP. Both lists were found to be equal. In each configuration, the system described in Lemma 2.7 is inconsistent, in particular the sum of all of the corresponding equations equals 1.
Proposition 2.11. Let be a biplane. If contains a subgroup of odd order acting transitively on , then admits no weighing signing.
Proof. Consider the -matrix of the linear system given by (1), that is the columns of are indexed by the flags of , and for any pair of lines with common points , has a row with ones exactly in positions , , , . A weighing signing of corresponds to a vector with . Note that naturally acts on , and for each . Define . Then . On the other hand, by the transitivity of on , must be constant, that is for some . But then , because every row of has four ones. This yields a contradiction. □
The only known biplanes satisfying the hypothesis of Proposition 2.11 are (i) the unique biplane on 11 points (, ) (admitting ), and (ii) a biplane on 37 points (, ) admitting . Another way to constrain the construction of future examples is to use information about the -rank of a putative example:
Proposition 2.12. Let be a biplane admitting a weighing signing, with block size , and let . If is even, then the incidence matrix of satisfies
Proof. Let be a weighing signing of , and let be the negative support of ; thus
Expanding and using , we obtain
Reducing modulo 2 gives . All ranks are over . Let . Then
Since is even, the relation gives . So the row-space of is self-orthogonal and hence , and equality follows. □
Proposition 2.12 gives us another method to rule out certain regular antipodal planes, when is even. For there are exactly three biplanes. Assmus and Salwach [2] denote them according to the dimensions of their binary incidence codes; we write , , , with . Proposition 2.12 requires , and so and are not signable. Using standard representatives of the classified biplanes gives the following exact ranks.
| Design | Required rank for a weighing signing | |||
| 4 | 7 | 3 | 3 | |
| 6 | 16 | 6 | 8 | |
| 6 | 16 | 7 | 8 | |
| 6 | 16 | 8 | 8 |
Table 3. Using Proposition 2.12 on some known biplanes.
Thus the exact-rank theorem eliminates two of the three – biplanes without solving any signing equations. No other known biplane is eliminated with this method.
Sharply deranged sets of permutations
For integers , denote by . Schleiermacher [21 Corollary 5.3] showed that there exists a finite regular antipodal plane of order if and only if there exists a set of permutations in satisfying: (i) every element of has no cycles of length at most 2; (ii) if and are two ordered pairs of elements of such that , , , , and , then there exists a unique element such that and . We show here that there is a simpler set of permutations that is equivalent to a regular antipodal plane. We call a family of permutations in sharply deranged if
,
no element of stabilises a point or pair setwise,
for every , it holds that , and for every , has a unique fixed point.
Proposition 2.13. A regular antipodal plane of order exists if and only if has a sharply deranged family.
Proof. Suppose that a regular antipodal plane of order exists. Take two points and . Let be the lines incident with . Then every point is on a unique line and a unique line . Moreover, since and don't intersect. Vice versa, if , then and intersect in a unique point. We denote this point by . Thus, the set of points of the plane is
Note that , hence .
Now take a line of the plane, not incident with or . Then intersects each line and in exactly one point, hence the points of are of the form for a permutation . Note that has no fixed points since is not a point of the plane, and does not stabilise a pair , since and cannot both be incident with . Furthermore, is incident with if and only if is incident with , hence, . The family of permutations on is sharply deranged.
Conversely, suppose that is the symmetric group acting on , and that is a sharply deranged family. Make an incidence structure with point set
and line set
The points incident with line are (i) if : and the points with , (ii) if : and the points with , (iii) if : the points with .
It follows that every line is incident with points, and two distinct lines intersect in at most one point. We show that every point is incident with lines. There are equally many lines as points, and every line is incident with points, so on average a point is incident with lines. Now suppose that some point is incident with more than lines. Then these lines pairwise intersect in , hence there are at least points, which is a contradiction. Therefore, every point must be incident with lines. This proves that we have constructed a regular antipodal plane.
Example 2.14. For , is sharply deranged. Likewise, the set of 4-cycles is sharply deranged for . For , you cannot extend a 5-cycle plus its inverse to anything larger.
Suppose is a sharply deranged family of permutations in . For each inverse pair in , throw out one of them, which will in total give us a set of half the elements of . Now each pair of distinct permutations agree on precisely one point, and hence is an equidistant permutation array (EPA). Table 4 compares the clique number of a graph which we will define below, and the size of the largest EPA in (see also OEIS:A005677). In particular, Tolonen [25] showed recently that , from which it follows that there is no sharply deranged family of permutations in , and hence no regular antipodal plane of order 8. The graph has vertices the derangements of that do not have 2-cycles. Two permutations are adjacent in if or fixes a unique element. We computed clique numbers by computer, using the GAP [24] package GRAPE [23].
| 3 | 6 | 6 | 3 | 3 |
| 4 | 12 | 2 | 6 | 5 |
| 5 | 20 | 11 | 10 | 10 |
| 6 | 30 | 10 | 15 | 13 |
| 7 | 42 | 14 | 21 | 16 |
| 8 | 56 | 28 | 20 |
Table 4. Clique numbers and bounds. If a sharply deranged subset of exists, then and .
The data in [11] shows that the known EPAs would easily satisfy an upper bound of . So based on the numerical evidence, we propose the following conjecture:
Conjecture 2.15. for all .
The best bound on an EPA is by van Rees [26]: . It was shown in [12] that when for some prime-power . If Conjecture 2.15 holds, then so too does Payne’s Conjecture. Choosing one element from each inverse pair in a sharply deranged set of yields an EPA of index 1 of size . If Conjecture 2.15 holds, then , from which it follows that . (We have already excluded the cases ).
Mutually orthogonal array-bic squares
Definition 2.16. An array-bic square of order and position , with is an -array with the following properties:
(i) The diagonal of is empty, the off-diagonal positions in contain entries from .
(ii) The th column of has a 0 entry on all off-diagonal positions,
(iii) The th column of , with , contains each symbol in exactly once.
(iv) The th row of contains each symbols of exactly once, and if , it also contains a 0.
Here is an example of an array-bic square of order 4 and position 1:
Definition 2.17. Suppose that and are array-bic squares of order and positions and , respectively, with . We call and orthogonal if for every tuple other than
there is a unique off-diagonal position such that
(Equivalently, the pairs which do not occur are precisely and for .) Note that this accounts for all off-diagonal positions. Note that if , then there are positions where we find , so and cannot be orthogonal.
We call a set of mutually orthogonal array-bic squares, abbreviated MOAS, if they are array-bic squares of order , and any pair of them is orthogonal.
Example 2.18. For order 2, there is a unique example of a MOAS:
By computer, it is not difficult to show that the unique MOAS (up to symmetry) is
The proof of the following is straightforward from the definitions, but it helps to know this result in efficient computation and enumeration of examples.
Lemma 2.19. Suppose that is an array-bic square of order and position . Consider the natural action of the symmetric group on , and stipulate that it fixes the symbol . Take . Define by
Then is an array-bic square of order and position . Moreover, two array-bic squares and are orthogonal if and only if and are orthogonal.
Proposition 2.20. A regular antipodal plane of order is equivalent to a MOAS.
Proof. Suppose that is a regular antipodal plane of order . Choose a line , and label the points of as . For each with , let be the line containing and . Note that , and . For each with , we denote the point by . Note that . Define the arrays with empty diagonal by if the unique line containing and is . Using the properties of regular antipodal planes, it is straightforward to verify that each is an array-bic square. Suppose by way of contradiction that and are not orthogonal. If and , then lies on both and , contradicting their disjointness. So one of the following must occur:
There exists a off-diagonal position with . This means that the line through and intersects in both and , a contradiction.
There exists two off-diagonal positions with and for some and . This would mean that the lines and share the points and , a contradiction.
We conclude that a regular antipodal plane gives rise to a MOAS.
Conversely, suppose that is a MOAS, where has position . Put
and define maps , (for ). Thus . Every fibre of every has size . Moreover, for distinct , and for , ,
For , this is precisely the orthogonality of and . When one of is , it follows from the row conditions for an array-bic square.
Now define
To streamline our notation, we declare , , and
Since every fibre of has size , every line has points. Also, lies on and the lines with , while lies on and the lines with . Finally, lies on the lines , where . Hence every point also lies on lines. It remains to check intersections. The lines and are disjoint, while meets them in and , respectively. For two distinct lines and , we have
where in the last case is the unique element satisfying and .
Thus any two lines meet in at most one point, and every line besides the disjoint line, namely for , for . Hence is a partial linear space. Since , the lines through any point contain points. Therefore every point has a unique non-collinear point. Consequently, is a regular antipodal plane of order .
Finally, and are non-collinear, so they are antipodal. Moreover, , and the line through and is . Thus the construction in the forward direction recovers , completing the equivalence.
By computational depth-first search, there is no MOAS(4, 2). Similarly, we could find a MOAS(5, 2), but a MOAS(5, 3) does not exist, and we could find a MOAS(6, 2), but there is no MOAS(6, 3). There exists a MOAS(7, 2), but a backtrack search with Julia (273 minutes on a MacBook) shows that there is no MOAS(7, 3). This also shows there are no regular antipodal planes for these small orders, and that in some sense, we do not even get close to such a configuration. The Julia code is available upon request from the first author.

Figure 3. A MOAS(5, 2).

Figure 4. A MOAS(6, 2).

Figure 5. A MOAS(7, 2).
Conclusion
We have shown that there are interesting combinatorial objects associated to regular antipodal planes. The first and most well-known object is a biplane, and the existence of an example with more than 79 points is a long-standing open problem in design theory. We have shown that a regular antipodal plane gives rise to an equidistant permutation array of index 1, and we do not yet have good bounds on the size of such an object. Such a bound would resolve Payne’s Conjecture. We also introduced sharply deranged sets and mutually orthogonal array-bic squares, that in some sense capture how improbable it is for a regular antipodal plane to exist, of order greater than 14. This leads us to the following questions arising from this work:
(Q1) Does there exist a regular antipodal plane of order greater than 14? In particular does there exist one of order 15?
(Q2) Is it true that the maximum size of an equidistant permutation array on points, and of index 1, is at most for all ?
(Q3) Does there exist a for ?
Acknowledgements
Sam Adriaensen is supported by grant number 12A3Y25N of Research Foundation - Flanders (FWO). He is grateful to the University of Western Australia and John Bamberg in particular for their hospitality during his stay in Perth. Jason Williford was supported in part by the Simons Foundation Collaboration Grant 711898. He thanks the Department of Mathematics at the University of Western Australia, and John Bamberg in particular, for their warm hospitality and for providing a stimulating research environment during his sabbatical visit.
The authors would like to thank Gordon Royle for sharing his adjacency matrices for the known biplanes.
The computer algebra systems Magma [5], GAP [24] and the programming language Julia [3] were used for computations in this paper. (Adriaensen) Department of Mathematics and Data Science, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Elsene, Belgium. Email address: [email protected]
(Bamberg) Department of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Perth, W.A. 6009, Australia. Email address: [email protected]
(Williford) Department of Mathematics and Statistics, University of Wyoming, 1000 E. University Ave., Laramie, WY 82071 USA Email address: [email protected]
References
- [1]M. Aschbacher. On collineation groups of symmetric block designs. Journal of Combinatorial Theory, Series A, 11(3):272–281, Nov. 1971.DOI
- [2]E. F. Assmus Jr. and C. J. Salwach. The (16, 6, 2) designs. Int. J. Math. Math. Sci., 2:261–281, 1979.
- [3]J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah. Julia: A fresh approach to numerical computing. SIAM Review, 59(1):65–98, 2017.arxiv.org/abs/1411.1607
- [4]N. L. Biggs and T. Ito. Graphs with even girth and small excess. Math. Proc. Cambridge Philos. Soc., 88(1):1–10, 1980.DOI
- [5]W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system i: The user language. Journal of Symbolic Computation, 24(3–4):235–265, Sept. 1997.DOI
- [6]M. De Boeck and G. Van de Voorde. Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order p². Des. Codes Cryptogr., 91(3):895–920, 2023.arxiv.org/abs/2203.16129
- [7]P. Dembowski. Finite geometries. Classics in Mathematics. Springer-Verlag, Berlin, 1997. Reprint of the 1968 original.
- [8]D. M. Gordon. Modular Golomb Rulers and Almost Difference Sets. IEEE Trans. Inform. Theory, 71(7):5737–5743, 2025.arxiv.org/abs/2408.16721
- [9]D. Heinlein, A. Ivanov, B. McKay, and P. R. J. Östergård. A library of combinatorial 2-designs. Zenodo, Aug. 2023. Dataset, version 1.DOI
- [10]P. Kaski and P. R. J. Östergård. There are exactly five biplanes with k = 11. J. Comb. Des., 16(2):117–127, 2008.
- [11]A. Mahmoodi and P. J. Schellenberg. Equidistant permutation arrays. In The CRC handbook of combinatorial designs, pages 326–329. Boca Raton, FL: CRC Press, 1996.
- [12]R. Mathon and S. A. Vanstone. On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. Discrete Math., 30:157–172, 1980.DOI
- [13]B. D. McKay and A. Piperno. Practical graph isomorphism, II. J. Symbolic Comput., 60:94–112, 2014.
- [14]W. Mielants. On nearly generalized 3-gons. Simon Stevin, 50:87–94, 1976.
- [15]G. E. Moorhouse. Reconstructing projective planes from semibiplanes. In Coding theory and design theory, Part II, volume 21 of IMA Vol. Math. Appl., pages 280–285. Springer, New York, 1990.DOI
- [16]R. C. Mullin and E. Nemeth. An improved bound for equidistant permutation arrays of index one. Utilitas Math., 13:77–85, 1978.
- [17]S. E. Payne. On the non-existence of a class of configurations which are nearly generalized n-gons. Journal of Combinatorial Theory, Series A, 12(2):268–282, Mar. 1972.DOI
- [18]D. Raghavarao. Some aspects of weighing designs. Ann. Math. Stat., 31:878–884, 1960.DOI
- [19]C. J. Salwach and J. A. Mezzaroba. The four biplanes with k = 9. Journal of Combinatorial Theory, Series A, 24(2):141–145, Mar. 1978.DOI
- [20]P. J. Schellenberg. A computer construction for balanced orthogonal matrices. In Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, Florida, 1975), volume 14 of Congressus Numerantium, pages 513–522, Winnipeg, 1975. Utilitas Mathematica.
- [21]A. Schleiermacher. On a class of partial planes related to biplanes. J. Geom., 107(2):445–466, 2016.DOI
- [22]J.-P. Serre. A course in arithmetic, volume No. 7 of Graduate Texts in Mathematics. Springer-Verlag, New York-Heidelberg, 1973. Translated from the French.DOI
- [23]L. H. Soicher. The GRAPE package for GAP, version 4.9.3. https://gap-packages.github.io/grape, 2025.
- [24]The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.14.0. https://www.gap-system.org, 2024.
- [25]L. Tolonen. Tasaētaisten permutaatiokoodien luokittelu. Bachelor’s thesis, Aalto University, 2026.
- [26]G. H. J. Van Rees. Slightly improved upper bounds for equidistant permutation arrays of index one. J. Combin. Math. Combin. Comput., 8:159–160, 1990.
