This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Eventually, geometric (nk)(n_{k}) configurations
exist for all nn

Leah Wrenn Berman Gábor Gévay  and  Tomaž Pisanski Department of Mathematics and Statistics, University of Alaska Fairbanks, Fairbanks, AK, USA Bolyai Institute, University of Szeged, Szeged, Hungary
ORCID ID: https://orcid.org/0000-0002-5469-5165
University of Primorska, Koper, Slovenia, and Institute of Mathematics, Physics and Mechanics, University of Ljubljana, Ljubljana, Slovenia
ORCID ID: https://orcid.org/0000-0002-1257-5376
Abstract.

In a series of papers and in his 2009 book on configurations Branko Grünbaum described a sequence of operations to produce new (n4)(n_{4}) configurations from various input configurations. These operations were later called the “Grünbaum Incidence Calculus”. We generalize two of these operations to produce operations on arbitrary (nk)(n_{k}) configurations. Using them, we show that for any kk there exists an integer NkN_{k} such that for any nNkn\geq N_{k} there exists a geometric (nk)(n_{k}) configuration. We use empirical results for k=2,3,4k=2,3,4, and some more detailed analysis to improve the upper bound for larger values of kk.

Keywords: axial affinity, geometric configuration, Grünbaum calculus

MSC (2020): 51A45, 51A20, 05B30, 51E30

In memory of Branko Grünbaum


1. Introduction

In a series of papers and in his 2009 book on configurations [11], Branko Grünbaum described a sequence of operations to produce new (n4)(n_{4}) configurations from various input configurations. These operations were later called the “Grünbaum Incidence Calculus” [13, Section 6.5]. Some of the operations described by Grünbaum are specific to producing 3- or 4-configurations. Other operations can be generalized in a straightforward way to produce (nk)(n_{k}) configurations from either smaller (mk)(m_{k}) configurations with certain properties, or from (mk1)(m_{k-1}) configurations. Let NkN_{k} be the smallest number such that for any n,nNkn,n\geq N_{k} there exists a geometric (nk)(n_{k}) configuration. For k=2k=2 and k=3k=3, the exact value of NkN_{k} is known, and for k=4k=4 it is known that N4=20N_{4}=20 or 2424. We generalize two of the Grünbaum Calculus operations in order to prove that for any integer kk there exists an integer NkN_{k} and we give bounds on NkN_{k} for k5k\geq 5.

The existence of geometric 2-configurations is easily established. The only (connected) combinatorial configuration (n2)(n_{2}) is an nn-lateral. For each n,n3n,n\geq 3, an nn-lateral can be realized as a geometric multilateral (for the definition of a multilateral, see [11]). As a specific example, an (n2)(n_{2}) configuration can be realized as a regular nn-gon with sides that are extended to lines. (For larger values of nn it can also be realized as an nn-gonal star-polygon, but the underlying combinatorial structure is the same.) Hence:

Proposition 1.

A geometric (n2)(n_{2}) configuration exists if and only if n3n\geq 3. In other words, N2=3N_{2}=3.

For 3-configurations, N3N_{3} is known to be 9 (see [11, Section 2.1]); for example, Branko Grünbaum provides a proof (following that of Schröter from 1888, see the discussion in [11, p. 65]) that the cyclic combinatorial configuration 𝒞3(n)\mathcal{C}_{3}(n), which has starting block [0,1,3][0,1,3], can always be realized with straight lines for any n9n\geq 9. That is:

Proposition 2.

A geometric (n3)(n_{3}) configuration exists if and only if n9n\geq 9. In other words, N3=9N_{3}=9.

Note that there exist two combinatorial 3-configurations, namely (73)(7_{3}) and (83)(8_{3}), that do not admit a geometric realization.

For k=4k=4, the problem of parameters for the existence of 4-configurations is much more complex, and the best bound N4N_{4} is still not known. For a number of years, the smallest known 4-configuration was the (214)(21_{4}) configuration which had been studied combinatorially by Klein and others, and whose geometric realization, first shown in 1990 [12], initiated the modern study of configurations. In that paper, the authors conjectured that this was the smallest (n4)(n_{4}) configuration. In a series of papers [6, 7, 8, 9] (summarized in [11, Sections 3.1-3.4]), Grünbaum showed that N4N_{4} was finite and less than 43. In 2008, Grünbaum found a geometrically realizable (204)(20_{4}) configuration [10]. In 2013, Jürgen Bokowski and Lars Schewe [3] showed that geometric (n4)(n_{4}) configurations exist for all n18n\geq 18 except possibly n=19,22,23,26,37,43n=19,22,23,26,37,43. Subsequently, Bokowski and Pilaud [1] showed that there is no geometrically realizable (194)(19_{4}) configuration, and they found examples of realizable (374)(37_{4}) and (434)(43_{4}) configurations [2]. In 2018, Michael Cuntz [5] found realizations of (224)(22_{4}) and (264)(26_{4}) configurations. However, the question of whether a geometric (234)(23_{4}) geometric configuration exists is currently still open.

In this paper, Nk¯\bar{N_{k}} will denote any known upper bound for NkN_{k} and NkRN^{R}_{k} will denote currently best upper bound for NkN_{k}.

Summarizing the above results, we conclude:

Proposition 3.

A geometric (n4)(n_{4}) configuration exists for n=18,20,21,22n=18,20,21,22 and n24n\geq 24. Moreover, either N4=20N_{4}=20 or N4=24N_{4}=24 (depending on whether or not a (234)(23_{4}) configuration exists). In other words, N4R=24.N^{R}_{4}=24.

The main result of the paper is the following result.

Theorem 4.

For each integer k2k\geq 2 the numbers NkN_{k} exist.

To simplify subsequent discussions, we introduce the notion of configuration-realizability, abbreviated as realizability, of numbers. A number nn is kk-realizable if and only if there exists a geometric (nk)(n_{k}) configuration. We may rephrase Proposition 3 by stating that the numbers n=18,20,21,22n=18,20,21,22 and n24n\geq 24 are 44-realizable. Also note that the number 99 is 22- and 33-realizable but not kk-realizable for any k4k\geq 4.

2. Generalizing two constructions from the Grünbaum Incidence Calculus

In this section, we generalize two constructions of the Grünbaum Incidence Calculus which we will use to prove the existence of NkN_{k} for any kk. As input to examples of these constructions, we often will use the standard geometric realization of the (93)(9_{3}) Pappus configuration 𝒫\mathcal{P}, shown in Figure 1.

Refer to caption
Figure 1. The standard geometric realization of the (93)(9_{3}) Pappus configuration 𝒫\mathcal{P}.

The first, which we call affine replication and denote AR(m,k)\mathrm{AR}(m,k), generalizes Grünbaum’s (𝟓𝐦)\mathbf{(5m)} construction; it takes as input an (mk1)(m_{k-1}) configuration and produces a ((k+1)mk)((k+1)m_{k}) configuration with a pencil of mm parallel lines.

The second, which we call affine switch, is analogous to Grünbaum’s (𝟑𝐦+)\mathbf{(3m+)} construction. It takes as input a single (mk)(m_{k}) configuration with a set of pp parallel lines in one direction and a set of qq parallel lines in a second direction which are disjoint (in terms of configuration points) from the pencil of pp lines, and it produces a configuration ((k1)m+r)k)((k-1)m+r)_{k}) for any rr with 1rp+q1\leq r\leq p+q. Applying a series of affine switches to a single starting (mk)(m_{k}) configuration with a pencil of qq parallel lines produces a consecutive sequence (or “band”) of configurations

((k1)m+1)k),,((k1)m+q)k)((k-1)m+1)_{k}),\ldots,((k-1)m+q)_{k})

which we will refer to as AS+(m,k,q)\mathrm{AS+}(m,k,q).

2.1. Affine Replication

Starting from an (mk1)(m_{k-1}) configuration 𝒞\mathcal{C} we construct a new configuration 𝒟\mathcal{D} which is a ((k+1)mk)((k+1)m_{k}) configuration. A sketch of the construction is that k1k-1 affine images of 𝒞\mathcal{C} are carefully constructed so that each point PP of 𝒞\mathcal{C} is collinear with the k1k-1 images of PP, and each line of 𝒞\mathcal{C} and its images are concurrent at a single point. Then 𝒟\mathcal{D} consists of the the points and lines of 𝒞\mathcal{C} and its images, the new lines corresponding to the collinearities from each point PP, and the new points of concurrence corresponding to the lines of 𝒞\mathcal{C} and their images.

The details of the construction are as follows:

  1. (1)

    Let AA be a line that (i) does not pass through the intersection of two lines of 𝒞\mathcal{C}, whether or not that intersection point is a point of the configuration; (ii) is perpendicular to no line connecting any two points of 𝒞\mathcal{C}, whether or not that line is a line of the configuration; (iii) intersects all lines of 𝒞\mathcal{C}.

  2. (2)

    Let α1,α2,αk1\alpha_{1},\alpha_{2},\ldots\alpha_{k-1} be pairwise different orthogonal axial affinities with axis AA. Construct copies 𝒞1=α1(𝒞)\mathcal{C}_{1}=\alpha_{1}(\mathcal{C}), 𝒞2=α2(𝒞)\mathcal{C}_{2}=\alpha_{2}(\mathcal{C}),…, 𝒞k1=αk1(𝒞)\mathcal{C}_{k-1}=\alpha_{k-1}(\mathcal{C}) of 𝒞=𝒞0\mathcal{\mathcal{C}}=\mathcal{C}_{0}.

  3. (3)

    Let \ell be any line of 𝒞\mathcal{C}. Since AA is the common axis of each αi\alpha_{i}, the point AA\cap\ell is fixed by all these affinities. This means that the kk-tuple of lines ,α1(),,αk1()\ell,\alpha_{1}(\ell),\ldots,\alpha_{k-1}(\ell) has a common point of intersection lying on AA. We denote this point by FF_{\ell}. By condition (i) in (1), for different lines ,𝒞\ell,\ell^{\prime}\in\mathcal{C} the points F,FF_{\ell},F_{\ell^{\prime}} differ from each other; they also differ from each point of the configurations 𝒞i\mathcal{C}_{i} (i=1,2,,k1)(i=1,2,\dots,k-1). We denote the set {F:𝒞}\{F_{\ell}:\ell\in\mathcal{C}\} of points lying on AA by \mathcal{F}.

  4. (4)

    Let PP be any point of 𝒞\mathcal{C}. Since the affinities αi\alpha_{i} are all orthogonal affinities (with the common axis AA), the kk-tuple of points P,α1(P),,αk1(P)P,\alpha_{1}(P),\dots,\alpha_{k-1}(P) lies on a line perpendicular to AA (and avoids AA, by condition (i)). We denote this line by P\ell_{P}. Clearly, we have altogether mm such lines, one for each point of 𝒞\mathcal{C}, with no two of them coinciding, by condition (ii). We denote this set {P:P𝒞}\{\ell_{P}:P\in\mathcal{C}\} of lines by \mathcal{L}.

  5. (5)

    Put 𝒟=𝒞0𝒞1𝒞k1\mathcal{D}=\mathcal{C}_{0}\cup\mathcal{C}_{1}\cup\dots\cup\mathcal{C}_{k-1}\cup\mathcal{F}\cup\mathcal{L}.

Refer to caption
Figure 2. Affine replication AR(4,3)\mathrm{AR}(4,3) applied to a quadrilateral, i.e. a (42)(4_{2}) configuration; it results in a (163)(16_{3}) configuration. The corresponding ordinary quadrangles are shaded (the starting, hence each of the three quadrangles are parallelograms). The axis AA is shown by a dashed line.

The conditions of the construction imply that 𝒟\mathcal{D} is a ((k+1)mk)((k+1)m_{k}) configuration. Moreover, by construction, 𝒟\mathcal{D} has a pencil of mm parallel lines. Figures 2 and 3 show two examples of affine replication, first starting with a (42)(4_{2}) configuration to produce a (163)(16_{3}) configuration, and then starting with the (93)(9_{3}) Pappus configuration to produce a (454)(45_{4}) configuration.

Remark 1.

The orthogonal affinities used in the construction are just a particular case of the axial affinities called strains [4]; they can be replaced by other types of axial affinities, namely, by oblique affinities (each with the same (oblique) direction), and even, by shears (where the direction of affinity is parallel with the axis) [4], while suitably adjusting conditions (i–iii) in (1).

Refer to caption
Figure 3. Affine replication AR(9,4)\mathrm{AR}(9,4) applied to the (93)(9_{3}) Pappus configuration, which yields a (454)(45_{4}) configuration. The starting figure is indicated by thick segments, while the first image is highlighted by red segments. The axis AA is shown by a dashed line. The construction is chosen so as to exemplify that ordinary mirror reflection can also be used. Note that the resulting configuration contains a pencil of 9 parallel lines arising from the construction, shown in green.

We may summarize the above discussion as follows:

Lemma 5.

If affine replication AR(m,k)\mathrm{AR}(m,k) is applied to any (mk1)(m_{k-1}) configuration, the result is a (((k+1)m)k)(((k+1)m)_{k}) configuration with a pencil of mm parallel lines.

2.2. Affine Switch

In our description of this construction, we are inspired by Grünbaum [11, §3.3, pp. 177–180] but we have chosen a slightly different approach (in particular, we avoid using 3-space). At the same time, we generalize it from (m4)(m_{4}) to (mk)(m_{k}).

A sketch of the construction is as follows: Suppose that 𝒞\mathcal{C} is an (mk)(m_{k}) configuration that contains a pencil 𝒫\mathcal{P} of pp parallel lines in one direction, and a pencil 𝒬\mathcal{Q} of qq parallel lines in a second direction, where the two pencils share no common configuration points; we say that the pencils are independent. For each subpencil 𝒮\mathcal{S} of 𝒫\mathcal{P} and 𝒯\mathcal{T} of 𝒬\mathcal{Q} containing ss parallel lines and tt parallel lines respectively, with 1sp1\leq s\leq p and 0tq0\leq t\leq q, we form the subfiguration 𝒞^\hat{\mathcal{C}} by deleting 𝒮\mathcal{S} and 𝒯\mathcal{T} from 𝒞\mathcal{C} (here we use the term subfiguration in the sense of Grünbaum [11]). We then carefully construct k2k-2 affine images of 𝒞^\hat{\mathcal{C}} in such a way that for each (deleted) line \ell in 𝒮\mathcal{S} and for each point P1,P2,PkP_{1},P_{2},\ldots P_{k} on \ell, the collection of lines through each PiP_{i} and its images all intersect in a single point YY_{\ell}, and simultaneously, for each line \ell^{\prime} in 𝒯\mathcal{T} and for each point Q1,Q2,QkQ_{1},Q_{2},\ldots Q_{k} on \ell^{\prime}, the collection of lines through QiQ_{i} and its images all intersect in a single point XX_{\ell^{\prime}}. Let 𝒟\mathcal{D} be the collection of all the undeleted points and lines of 𝒞^\hat{\mathcal{C}} and its affine images and for each of the deleted \ell and \ell^{\prime}, the new lines through each point PiP_{i} QiQ_{i} and their images, the points YY_{\ell}, and the points XX_{\ell^{\prime}}; then 𝒟\mathcal{D} is a (((k1)m+s+t)k)(((k-1)m+s+t)_{k}) configuration.

As a preparation, we need the following two propositions.

Proposition 6.

Let α\alpha be a (non-homothetic) affine transformation that is given by a diagonal matrix with respect to the standard basis. Note that in this case α\alpha can be written as a (commuting) product of two orthogonal affinities whose axes coincide with the xx- and yy-axis, respectively:

(a00b)=(a001)(100b)=(100b)(a001).\left(\begin{array}[]{cc}a&0\\ 0&b\end{array}\right)=\left(\begin{array}[]{cc}a&0\\ 0&1\end{array}\right)\left(\begin{array}[]{cc}1&0\\ 0&b\end{array}\right)=\left(\begin{array}[]{cc}1&0\\ 0&b\end{array}\right)\left(\begin{array}[]{cc}a&0\\ 0&1\end{array}\right).

Let P0(x0,0),P1(x0,y1),,Pk(x0,yk)P_{0}(x_{0},0),P_{1}(x_{0},y_{1}),\dots,P_{k}(x_{0},y_{k}) be a range of k+1k+1 different points on a line which is perpendicular to the xx-axis and intersects it in P0P_{0}. Then the kk lines connecting the pairs of points (P1,α(P1)),,(Pk,α(Pk))(P_{1},\alpha(P_{1})),\dots,(P_{k},\alpha(P_{k})) form a pencil with center CxC_{x} such that CxC_{x} lies on the xx-axis, and its position depends only on α\alpha and x0x_{0}.

Likewise, let Q0(x0,y0),Q1(x1,y0),,Qk(xk,y0)Q_{0}(x_{0},y_{0}),Q_{1}(x_{1},y_{0}),\dots,Q_{k}(x_{k},y_{0}) be a range of k+1k+1 different points on a line which is perpendicular to the yy-axis and intersects it in Q0Q_{0}. Then the kk lines connecting the pairs of points (Q1,α(Q1)),,(Qk,α(Qk))(Q_{1},\alpha(Q_{1})),\dots,(Q_{k},\alpha(Q_{k})) form a pencil with center CyC_{y} such that CyC_{y} lies on the yy-axis, and its position depends only on α\alpha and y0y_{0}.

Proof.

An elementary calculation shows that

Cx=Cx(0,abb1x0), resp. Cy=Cy(0,baa1y0)C_{x}=C_{x}\left(0,\displaystyle\frac{a-b}{b-1}\,x_{0}\right),\text{\;resp.\;\,}C_{y}=C_{y}\left(0,\displaystyle\frac{b-a}{a-1}\,y_{0}\right)

is the common point of intersection of any two, hence of all the lines in question. ∎

Proposition 7.

Let h3h\geq 3 be a positive integer, and for each jj with j=1,,h1j=1,\dots,h-1, let the affine transformation αj\alpha_{j} be given by the matrix

Mj=(hjh00h+jh).M_{j}=\left(\begin{array}[]{cc}\displaystyle\frac{h-j}{h}&0\\ 0&\displaystyle\frac{h+j}{h}\end{array}\right). (1)

Then for any point PP, the points P,α1(P),,αh1(P)P,\alpha_{1}(P),\dots,\alpha_{h-1}(P) are collinear.

Proof.

Choose any jj^{\prime} and j′′j^{\prime\prime}, and form the difference matrices MjUM_{j^{\prime}}-U and Mj′′UM_{j^{\prime\prime}}-U with the unit matrix UU. Observe that these matrices are such that one is a scalar multiple of the other. Hence the vectors PP\overrightarrow{PP^{\prime}} and PP′′\overrightarrow{PP^{\prime\prime}} are parallel, where P=αj(P)P^{\prime}=\alpha_{j^{\prime}}(P) and P′′=αj′′(P)P^{\prime\prime}=\alpha_{j^{\prime\prime}}(P). This means that the points PP, PP^{\prime} and P′′P^{\prime\prime} lie on the same line. ∎

Refer to caption
Figure 4. Illustration for Propositions 6 and 7. Affine transformations with parameters h=8h=8 and j=1,5j=1,\dots 5 are applied on a square.

Now we apply the following construction. Let 𝒞\mathcal{C} be an (mk)(m_{k}) configuration such that it contains a pencil 𝒫\mathcal{P} of p1p\geq 1 parallel lines and a pencil 𝒬\mathcal{Q} of q1q\geq 1 parallel lines, too, such that these pencils are perpendicular to each other and are independent.Note that any configuration containing independent pencils in two different directions can be converted by a suitable affine transformation to a configuration in which these pencils will be perpendicular to each other.

Choose a position of 𝒞\mathcal{C} (applying an affine transformation if necessary) such that these pencils are parallel to the xx-axis and yy-axis, respectively.

  1. (1)

    Remove lines 1,,s\ell_{1},\dots,\ell_{s} (sp)(s\leq p) from the pencil 𝒫\mathcal{P} parallel to the xx-axis and s+1,,s+t\ell_{s+1},\dots,\ell_{s+t} (0tq)(0\leq t\leq q) from the pencil 𝒬\mathcal{Q} parallel to the yy-axis. Let 𝒞^\widehat{\mathcal{C}} denote the substructure of 𝒞\mathcal{C} obtained in this way.

  2. (2)

    Let hh be a positive integer (say, some suitable multiple of kk), and for each jj, j=1,,k2j=1,\dots,k-2, let αj\alpha_{j} be an affine transformation defined in Proposition 7. Form the images αj(𝒞^)\alpha_{j}(\widehat{\mathcal{C}}) for all jj given here.

  3. (3)

    Let PP be a point of 𝒞^\widehat{\mathcal{C}} that was incident to one of the lines i\ell_{i} removed from 𝒞\mathcal{C}. Take the images αj(P)\alpha_{j}(P) for all jj given in (2). By Proposition 7, all the k1k-1 points P,αj(P)P,\alpha_{j}(P) are collinear. Let ci(P)c_{i}(P) denote this line.

  4. (4)

    Take all the configuration points on i\ell_{i} and repeat (3) for each of them. By Proposition 6, the kk-set of lines {ci(P):Pi}\{c_{i}(P):P\in\ell_{i}\} form a pencil whose center lies on the xx-axis or the yy-axis according to which axis i\ell_{i} is perpendicular to.

  5. (5)

    Let r=(s+t){1,2,,p+q}r=(s+t)\in\{1,2,\dots,p+q\} be the number of lines removed from the pencils of 𝒞\mathcal{C} in the initial step of our construction. Repeat (4) for all these lines. Eventually, we obtain rkrk new lines and rr new points such that the set of the new lines is partitioned into rr pencils, and the new points are precisely the centers of these pencils (hence they lie on the coordinate axes). Observe that there are precisely kk lines passing through each of the new points, and likewise there are precisely kk points lying on each of the new lines.

  6. (6)

    Putting everything together, we form a (((k1)m+r)k)(((k-1)m+r)_{k}) configuration, whose

    • points come from the (k1)m(k-1)m points of the copies of 𝒞^\widehat{\mathcal{C}}, completed with the rr new points considered in (5).

    • lines come from the (k1)(mr)(k-1)(m-r) lines of the copies of 𝒞^\widehat{\mathcal{C}}, completed with the rkrk new lines considered in (5).

    We use the notation AS(m,k,r)AS(m,k,r) to represent the (((k1)m+r)k)(((k-1)m+r)_{k}) configuration described above.

Summarizing the discussion above, we conclude:

Lemma 8.

Beginning with any (mk)(m_{k}) configuration with independent pencils of p0p\geq 0 and q1q\geq 1 parallel lines, for each integer rr with 1rp+q1\leq r\leq p+q, the affine switch construction produces an (nk)(n_{k}) configuration, where n=(k1)m+rn=(k-1)m+r.

Note that p+qp+q independent lines in an (mk)(m_{k}) configuration covers k(p+q)mk(p+q)\leq m points. This gives an upper bound p+qm/kp+q\leq m/k, where the equality is attained only if mm divides kk.

In this paper we use the above Lemma 8 in connection with Lemma 5 only for the case of a single pencil of parallel lines, such that p=0p=0.

Corollary 9.

From any starting (mk)(m_{k}) configuration that has a pencil of qq parallel lines, we apply a sequence of affine switches by removing 1,2,,q1,2,\ldots,q lines in sequence, to construct a sequence of consecutive configurations

[(((k1)m+r)k)]r=1q=[AS(m,k,r)]r=1q.[(((k-1)m+r)_{k})]_{r=1}^{q}=[AS(m,k,r)]_{r=1}^{q}.

This collection of consecutive configurations is represented by the notation AS+(m,k,q)\mathrm{AS+}(m,k,q). That is, AS+(m,k,q)=[AS(m,k,r)]r=1q.\mathrm{AS+}(m,k,q)=[AS(m,k,r)]_{r=1}^{q}.

Example 1.

Figure 5 illustrates an application of this construction to the Pappus configuration 𝒫\mathcal{P} (cf. Figure 1). Removing only one line from the horizontal pencil results in a (193)(19_{3}) configuration, shown in Figure 5(a). Removing two or three lines results in a (203)(20_{3}) or (213)(21_{3}) configuration, respectively, shown in Figures 5(b) and 5(c). (Observe that since the Pappus configuration has 9 points, the maximal total number of lines in independent pencils is 3, since any three disjoint lines in the configuration contain all the points of the configuration.) Taken together the three configurations, we have: [(193),(203),(213)]=AS+(9,3,3)[(19_{3}),(20_{3}),(21_{3})]=\mathrm{AS+}(9,3,3).

Refer to caption
(a) A (193)(19_{3}) configuration
Refer to caption
(b) A (203)(20_{3}) configuration
Refer to caption
(c) A (213)(21_{3}) configuration
Figure 5. Configurations (193)(19_{3}), (203)(20_{3}), and (213)(21_{3}), constructed from applying the affine switch construction to the realization of the Pappus configuration with a pencil of 3 parallel lines, shown in Figure 1, by deleting one, two, or three lines respectively. (The vertical axis of affinity, denoted by dashed line, does not belong to the configuration.)

Since axial affinities play a crucial role in the constructions described above, we recall a basic property. The proof of the following proposition is constructive, hence it provides a simple tool for a basically synthetic approach to these constructions, which is especially useful when using dynamic geometry software to construct these configurations.

Proposition 10.

An axial affinity α\alpha is determined by its axis and the pair of points (P,P)(P,P^{\prime}), where PP is any point not lying on the axis, and PP^{\prime} denotes the image of PP, i.e. P=α(P)P^{\prime}=\alpha(P).

Proof.

In what follows, for any point XX, we denote its image α(X)\alpha(X) by XX^{\prime}. Let QQ be an arbitrary point not lying on the axis and different from PP. Take the line PQPQ, and assume that it intersects the axis in a point FF (see Figure 6a). Thus PQ=FPPQ=FP. Take now the line FPF^{\prime}P^{\prime}, i.e., the image of FPFP. Since FF is a fixed point, i.e. F=FF^{\prime}=F, we have FP=FPF^{\prime}P^{\prime}=FP^{\prime}. This means that QQ^{\prime} lies on FPFP^{\prime}, i.e. PQ=FPP^{\prime}Q^{\prime}=FP^{\prime}. To find QQ^{\prime} on FPFP^{\prime}, we use the basic property of axial affinities that for all points XX not lying on the axis, the lines XXXX^{\prime} are parallel with each other (we recall that the direction of these lines is called the direction of the affinity). Accordingly, a line passing through QQ which is parallel with PPPP^{\prime} will intersect FPFP^{\prime} precisely in the desired point QQ^{\prime}.

Refer to caption
Refer to caption
Figure 6. Construction of the image of a pont QQ under axial affinity; the axis is the vertical red line, the direction of affinity is given by the blue line. Here we use oblique affinity, but the construction given in the proof is the same in any other types of axial affinities.

On the other hand, if PQPQ is parallel with the axis, then clearly so is PQP^{\prime}Q^{\prime}. In this case QQ^{\prime} is obtaned as the fourth vertex of the parallelogram determined by PP^{\prime}, PP and QQ (see Figure 6b). ∎

Remark 2.

In using integer parameters hh and jj above, we followed Grünbaum’s original concept [11] (as mentioned explicitly at the beginning of this subsection). However, the theory underlying Propositions 6 and 7 makes possible using continuous parameters as well, so that the procedure becomes in this way much more flexible. In what follows we outline such a more general version, restricted to using only one pencil of lines to be deleted.

Start again with a configuration 𝒞\mathcal{C}, and assume that the pencil 𝒫\mathcal{P} is in horizontal position; accordingly, the axis that we use is in vertical position (see e.g. Figure 5). Choose a line \ell in 𝒫\mathcal{P}, and a configuration point P0P_{0} on \ell; then, remove \ell. P0P_{0} will be the initial point of our construction (e.g., in Figure 5 the “north-west” (black) point of the starting configuration). Choose a point CC_{\ell} on the axis such that the line CP0C_{\ell}P_{0} is not perpendicular to the axis (in our example, this is the red point in Figure 5a).

Now let tt\in\mathbb{R} be our continuous parameter. Take the point

P=tC+(1t)P0;P=tC_{\ell}+(1-t)P_{0}; (2)

thus PP is a point on the line CP0C_{\ell}P_{0}, and as tt changes, PP slides along this line. Moreover, by Proposition 10 we see that the pair of points (P0,P)(P_{0},P) determines two orthogonal affinities whose axes are perpendicular to each other. In particular, the axes are precisely the coordinate axes. These affinities act simultaneously, i.e. P0P_{0} is sent to PP by their (commuting) product. Using coordinates, such as P0(x0,y0)P_{0}(x_{0},y_{0}) and P(x,y)P(x,y), we also see that the ratio of these affinities is y/y0y/y_{0} (for that with horizontal axis), respectively x/x0x/x_{0} (for that with vertical axis). (Note that these ratios, using the relation (2), can also be expressed by the parameter tt and by the prescribed coordinates of P0P_{0} and CC_{\ell}. Furthermore, similarly, the matrix (1) above can also be parametrized by tt; we omit the details.)

It is easily checked that both Proposition 6 and Proposition 7 remains valid with this continuous parameter tt. Hence, for any PP, we can construct the corresponding affine image of 𝒞\mathcal{C} (or its substructures 𝒞^\hat{\mathcal{C}} with lines of any number rr removed), together with the new lines (which are denoted by red in our example of Figure 5). In particular, in case of kk-configurations, we need to choose altogether k2k-2 points on the line CP0C_{\ell}P_{0} (note the for t=0t=0, the starting copy 𝒞\mathcal{C} returns, for t=1t=1 the image of 𝒞\mathcal{C} collapses to a segment within the yy-axis, and for a third value depending on the slope of CP0C_{\ell}P_{0}, it collapses to a segment within the xx-axis; these cases thus are to be avoided).

3. Proof of the Main Theorem

In this section we prove the main theorem of our paper. For notational convenienence, given integers a<ba<b, let [a:b][a:b] denote the range {a,a+1,,b}\{a,a+1,\ldots,b\}. Similarly, for integer function f(s)f(s) the range {f(a),f(a+1),,f(b)}\{f(a),f(a+1),\ldots,f(b)\} will be denoted by [f(s)]s=ab[f(s)]^{b}_{s=a}. The crucial step in the proof will be provided by the following Lemma.

Lemma 11.

Assume that for some k3k\geq 3, Nk1N_{k-1} exists and that N¯k1\bar{N}_{k-1} is any known upper bound for it. Then NkN_{k} exists and: N¯k=(k21)max(N¯k1,k22)\bar{N}_{k}=(k^{2}-1)\max(\bar{N}_{k-1},k^{2}-2) is an upper bound for it. Moreover, if we have two upper bounds, say N¯k1<N~k1\bar{N}_{k-1}<\tilde{N}_{k-1} for Nk1N_{k-1}, the better one will produce a better upper bound for NkN_{k}.

This Lemma will be proven with the tools from previous section by applying affine replication and affine switch. More precisely, Lemma 5 and Corollary 9 will be used.

Proof of Lemma 11.

Let N¯k1\bar{N}_{k-1} denote any known upper bound for Nk1N_{k-1}. By definition, the sequence of consecutive numbers

a=N¯k1,a+1,,a+s,a=\bar{N}_{k-1},a+1,\ldots,a+s,\ldots (3)

are all (k1)(k-1)-realizable; in other words, for each ss, s=0,1,,s=0,1,\dots, there exists a geometric ((a+s)k1)((a+s)_{k-1}) configuration (recall the definition of realizability, given in the Introduction). Apply affine replication to these configurations; by Lemma 5, the sequence of numbers:

(k+1)a,(k+1)(a+1),,(k+1)(a+s),(k+1)a,(k+1)(a+1),\ldots,(k+1)(a+s),\dots (4)

are all kk-realizable. Note that this is an arithmetic sequence with difference (k+1)(k+1). Furthermore, observe that for each XaX\geq a, the geometric kk-configuration realizing the number (k+1)X(k+1)X that was produced by affine replication has XX new parallel lines. Hence, we can apply a sequence of affine switch constructions to each of these configurations ((k+1)Xk)((k+1)X_{k}). By Corollary 9, the sequences AS+((k+1)X,k,X)\mathrm{AS+}((k+1)X,k,X) of configurations is produced. It follows that the sequences of numbers

[(k1)(k+1)a+1:(k1)(k+1)a+a],[(k1)(k+1)(a+1)+1:(k1)(k+1)(a+1)+(a+1))],[(k1)(k+1)(a+2)+1:(k1)(k+1)(a+2)+(a+2))],[(k-1)(k+1)a+1:(k-1)(k+1)a+a],\\ [(k-1)(k+1)(a+1)+1:(k-1)(k+1)(a+1)+(a+1))],\\ [(k-1)(k+1)(a+2)+1:(k-1)(k+1)(a+2)+(a+2))],\ldots (5)

are all kk-realizable.

Observe that from the initial outputs of affine replication, n=X(k+1)n=X(k+1) is realizable as long as XN¯k1X\geq\bar{N}_{k-1}. Thus, every “band” of consecutive configurations produced by affine switches can be extended back one step, so there exists a band of consecutive kk-configurations

[(k1)(k+1)X:(k1)(k+1)X+X)][(k-1)(k+1)X:(k-1)(k+1)X+X)]

for each initial configuration (Xk1)(X_{k-1}). Another way to say this is that we can fill a hole of size 1 between the bands of configurations listed in equation (5) using the output of the initial affine replications, listed in equation (4).

To determine when we have either adjacent or overlapping bands, then, it suffices to determine when the last element of one band is adjacent to the first element of the next band; that is, when

(k1)(k+1)X+X+1(k1)(k+1)(X+1).(k-1)(k+1)X+X+1\geq(k-1)(k+1)(X+1).

It follows easily that Xk22X\geq k^{2}-2.

Hence, as long as we are guaranteed that a sequence of consecutive configurations (qk1)(q_{k-1}), ((q+1)k1),((q+1)_{k-1}),\ldots exists, it follows that we are guaranteed the existence of consecutive kk-configurations Qk,(Q+1)k,,Q_{k},(Q+1)_{k},\ldots, where Q=(k21)(k22)Q=(k^{2}-1)(k^{2}-2). However, since we do not know whether that consecutive sequence exists, in the (extremely common) case where N¯k1>(k21)(k22)\bar{N}_{k-1}>(k^{2}-1)(k^{2}-2), the best that we can do is to conclude that

Nk(k21)max{N¯k1,k22}.N_{k}\leq(k^{2}-1)\max\{\bar{N}_{k-1},k^{2}-2\}.

This result gives rise to an elementary proof by induction for the main theorem.

Proof of Theorem 4.

Let s=2s=2. The number Ns=N2=3N_{s}=N_{2}=3 exists. This is the basis of induction. Now, let s=k1s=k-1. By assumption, Nk1N_{k-1} exists and some upper bound N¯k1\bar{N}_{k-1} is known. By Lemma 11, N¯k=(k21)max(N^k1,k22)\bar{N}_{k}=(k^{2}-1)\max(\hat{N}_{k-1},k^{2}-2) is an upper bound for NkN_{k} . Therefore NkN_{k} exists and the induction step is proven. ∎

Recall that we let NkRN^{R}_{k} denote the best known upper bound for NkN_{k}. The same type of result follows if we start with the best known upper bound NsRN^{R}_{s} for some s2s\geq 2. However, the specific numbers for upper bounds depend on our starting condition. Table 1 shows the difference if we start with s=2,3,4s=2,3,4. The reason we are using only these three values for ss follows from the fact that only NsR,2s4N^{R}_{s},2\leq s\leq 4 have been known so far.

Table 1. Bounds on NkN_{k} from iterative applications of Lemma 11. Different bounds are produced if the iteration is started with N2R=N2=3,N3R=N3=9N^{R}_{2}=N_{2}=3,N^{R}_{3}=N_{3}=9 or with N4R=24N^{R}_{4}=24. Boldface numbers give best bounds using this method and current knowledge.
kk N¯k\bar{N}_{k} with N2R=3N^{R}_{2}=3 N¯k\bar{N}_{k} with N3R=9N^{R}_{3}=9 N¯k\bar{N}_{k} with N4R=24N^{R}_{4}=24 NkRN^{R}_{k}
22 3 - - 3
33 56 9 - 9
44 840 210 24 24
55 20 160 5 040 576 576
66 705 600 176 400 20 160 20 160
77 33 868 800 8 467 200 967 680 967 680
88 2 133 734 400 533 433 600 60 963 840 60 963 840
99 170 698 752 000 42 674 688 000 4 877 107 200 4 877 107 200
1010 16 899 176 448 000 4 224 794 112 000 482 833 612 800 482 833 612 800

The rightmost column of Table 1 summarises the information given in other columns by computing the minimum in each row and thereby gives the best bounds that are available using previous knowledge and direct applications of Lemma 11.

If new knowledge about best current values of NkRN^{R}_{k} for small values of kk becomes available, we may use similar applications of Lemma 11 to improve the bounds of the last column. Since, the values for k=2k=2 and k=3k=3 are optimal, the first candidate for improvement is k=4k=4. A natural question is what happens if someone finds a geometric (234)(23_{4}) configuration. In this case Lemma 11 would give us for k=5k=5 the bound (k21)max(Nk1R,k22)=(521)max(20,522)=24×23=552(k^{2}-1)\max(N^{R}_{k-1},k^{2}-2)=(5^{2}-1)\max(20,5^{2}-2)=24\times 23=552, an improvement over 576. An alternative feasible attempt to improve the bounds would be to use other methods in the spirit of Grünbaum calculus to improve the current bound 576 for k=5k=5. However, there is another approach that can improve the numbers even without introducing new methods. It is presented in the next section.

4. Improving the bounds

Recall that N3R=N3=9N^{R}_{3}=N_{3}=9, and N4R=N4=21N^{R}_{4}=N_{4}=21 or 2424, according to whether or not a (234)(23_{4}) configuration exists. If we apply the procedure in Lemma 11 using as input information N3=N3R=9N_{3}=N^{R}_{3}=9 (that is, beginning with a sequence of 33-configurations (93),(103),(113)(9_{3}),(10_{3}),(11_{3})\ldots), Lemma 11 says that

Nk(k21)max{Nk1R,k22}N4(15)max{9,14}=210.N_{k}\leq(k^{2}-1)\max\{N^{R}_{k-1},k^{2}-2\}\implies N_{4}\leq(15)\max\{9,14\}=210.

However, we know observationally that N4=21N_{4}=21 or 2424. Thus, we expect that Theorem 4 is likely to give us significant overestimates on a bound for NkN_{k} for larger kk.

For k=5k=5, the best we can do at this step with these constructions is the bound given by Lemma 11, beginning with the consecutive sequence of 44-configurations ((244),(254),(264),)((24_{4}),(25_{4}),(26_{4}),\ldots). In this case, Lemma 11 predicts that N5(24)max(24,23)=576.N_{5}\leq(24)\max(24,23)=576. In a subsequent paper, we will show that this bound can be significantly decreased by incorporating other Grünbaum-calculus-type constructions and several ad hoc geometric constructions for 5-configurations.

However, we significantly decrease the bound on NkN_{k} for k6k\geq 6 by refining the construction sequence given in Lemma 11: instead of beginning with Nk1RN^{R}_{k-1} determined by iterative applications of the sequence in Lemma 11, we consider all possible sequences determined by applying a series of affine replications, followed by a final affine switch.

First we introduce a function N(k,t,a,d)N(k,t,a,d) with positive integer parameters k,t,a,dk,t,a,d and t<kt<k. Define for t<k1t<k-1:

N(k,t,a,d):=(k21)(k!(t+1)!)max{a,(k21)d},N(k,t,a,d):=(k^{2}-1)\left(\frac{k!}{(t+1)!}\right)\max\left\{a,(k^{2}-1)d\right\},

and for t=k1t=k-1:

N(k,k1,a,d):=(k21)max{a,(k21)d1}.N(k,k-1,a,d):=(k^{2}-1)\max\left\{a,(k^{2}-1)d-1\right\}.

This value N(k,t,a,d)N(k,t,a,d) is precisely the smallest nn after which we are guaranteed there exists a sequence of consecutive kk-configurations produced by starting with an initial sequence of tt-configurations a,a+d,,a,a+d,..., and sequentially applying affine replications followed by a final affine switch as described above.

The following Lemma gives us a quite general and powerful tool for bound improvements without making any changes in constructions.

Lemma 12.

Let t2t\geq 2 be an integer and let a,a+d,a+2d,a,a+d,a+2d,\ldots be an arithmetic sequence with integer initial term aa and integer difference dd such that for each s=0,1,s=0,1,\ldots geometric configurations ((a+sd)t)((a+sd)_{t}) exist. Then for any k>tk>t the value N(k,t,a,d)N(k,t,a,d) defined above is an upper bound for NkN_{k}; i.e., N(k,t,a,d)NkN(k,t,a,d)\geq N_{k}.

Proof of Lemma 12.

Beginning with an arithmetic sequence of tt-configurations, we construct a consecutive sequence of kk-configurations by iteratively applying a sequence of affine replications to go from tt-configurations to (k1)(k-1)-configurations; a final affine replication to go from (k1)(k-1)-configurations to kk-configurations with a known number of lines in a parallel pencil; and finish by applying affine switch on that final sequence of kk-configurations to produce bands of consecutive configurations. We then analyze at what point we are guaranteed that the bands either are adjacent or overlap.

Specifically, starting with a sequence of tt-realizable numbers a,a+d,a+2d,a,a+d,a+2d,\ldots we successively apply ktk-t affine replications to the corresponding sequence of configurations to form sequences of ss-realizable numbers for tskt\leq s\leq k:

a,a+d,a+2d,\displaystyle a,a+d,a+2d,\ldots (t+1)-cfgsAR(,t+1)(t+2)a,(t+2)(a+d),(t+2)(a+2d),\displaystyle\xrightarrow[(t+1)\text{-cfgs}]{\mathrm{AR}(\cdot,t+1)}(t+2)a,(t+2)(a+d),(t+2)(a+2d),\ldots
(t+2)-cfgsAR(,t+2)(t+3)(t+2)a,(t+3)(t+2)(a+d),(t+3)(t+2)(a+2d),\displaystyle\xrightarrow[(t+2)\text{-cfgs}]{\mathrm{AR}(\cdot,t+2)}(t+3)(t+2)a,(t+3)(t+2)(a+d),(t+3)(t+2)(a+2d),\ldots
\displaystyle\vdots
k-cfgsAR(,k)(k+1)!(t+1)!a,(k+1)!(t+1)!(a+d),(k+1)!(t+1)!(a+2d),\displaystyle\xrightarrow[k\text{-cfgs}]{\mathrm{AR}(\cdot,k)}\frac{(k+1)!}{(t+1)!}a,\frac{(k+1)!}{(t+1)!}(a+d),\frac{(k+1)!}{(t+1)!}(a+2d),\ldots (6)

By Lemma 5, each of the kk-configurations corresponding to the realizable numbers in equation (6) produced from a starting configuration XX has a pencil of k!(t+1)!X\frac{k!}{(t+1)!}X parallel lines. To those configurations we apply the affine switch operation:

(k+1)!(t+1)!a,(k+1)!(t+1)!(a+d),(k+1)!(t+1)!(a+2d),k-cfgsAS+(,k,)[(k1)(k+1)!(t+1)!a+1:(k1)(k+1)!(t+1)!a+k!(t+1)!q],[(k1)(k+1)!(t+1)!(a+d)+1:(k1)(k+1)!(t+1)!(a+d)+k!(t+1)!(a+d)],\frac{(k+1)!}{(t+1)!}a,\frac{(k+1)!}{(t+1)!}(a+d),\frac{(k+1)!}{(t+1)!}(a+2d),\ldots\\ \xrightarrow[k\text{-cfgs}]{\mathrm{AS+}(\cdot,k,\cdot)}\left[(k-1)\frac{(k+1)!}{(t+1)!}a+1:(k-1)\frac{(k+1)!}{(t+1)!}a+\frac{k!}{(t+1)!}q\right],\\ \left[(k-1)\frac{(k+1)!}{(t+1)!}(a+d)+1:(k-1)\frac{(k+1)!}{(t+1)!}(a+d)+\frac{k!}{(t+1)!}(a+d)\right],\ldots (7)

As in the proof of Theorem 4, observe that the (nk)(n_{k}) configurations described in (6) all have nn a multiple of (k+1)!(t+1)!\frac{(k+1)!}{(t+1)!}. That is, any nn divisible by (k+1)!(t+1)!\frac{(k+1)!}{(t+1)!} is kk-realizable as long as when n=(k+1)!(t+1)!Xn=\frac{(k+1)!}{(t+1)!}X, XX is larger than NtRN^{R}_{t}. We thus can extend our band of consecutive realizable configurations back one step, to be of the form

[(k1)(k+1)!(t+1)!X:(k1)(k+1)!(t+1)!X+k!(t+1)!X]\left[(k-1)\frac{(k+1)!}{(t+1)!}X:(k-1)\frac{(k+1)!}{(t+1)!}X+\frac{k!}{(t+1)!}X\right]

for a starting tt-realizable number XX.

Successive bands of this form are guaranteed to either exactly meet or to overlap when the end of one band, plus one, equals or is greater to the beginning of the next, that is, when

(k1)(k+1)!(t+1)!X+k!(t+1)!X+1\displaystyle(k-1)\frac{(k+1)!}{(t+1)!}X+\frac{k!}{(t+1)!}X+1 (k1)(k+1)!(t+1)!(X+d)\displaystyle\geq(k-1)\frac{(k+1)!}{(t+1)!}(X+d)\implies
X\displaystyle X (k21)d(t+1)!k!.\displaystyle\geq(k^{2}-1)d-\frac{(t+1)!}{k!}. (8)

When t=k1t=k-1, (t+1)!k!=1\frac{(t+1)!}{k!}=1, while when t<k1t<k-1, (t+1)!k!<1\frac{(t+1)!}{k!}<1, and moreover, inequality (8) holds as long as XX is greater than the bound on tt-realizable configurations. ∎

We refine and improve the upper bounds of Table 1 with Theorem 13. This proof proceeds by showing, given a starting arithmetic sequence of consecutive tt-configurations, a construction method for producing a sequence of consecutive kk-configurations.

Theorem 13.

Recursively define

N^k=(k21)min3t<k{N(k,t,N^t,1)}\hat{N}_{k}=(k^{2}-1)\min_{3\leq t<k}\{N(k,t,\hat{N}_{t},1)\}

with N^3=N3=9\hat{N}_{3}=N_{3}=9 and N^4=N4R=24\hat{N}_{4}=N^{R}_{4}=24. Then N^k\hat{N}_{k} is an upper bound for NkN_{k}.

Proof.

Observe that by unwinding definitions,

N^k=(k21)min3tk1{k!(t+1)!max{N^t,k21}}.\hat{N}_{k}=(k^{2}-1)\min_{3\leq t\leq k-1}\left\{\frac{k!}{(t+1)!}\max\left\{\hat{N}_{t},k^{2}-1\right\}\right\}.

By construction, since for each N^k\hat{N}_{k} we have shown there exists consecutive kk-configurations for each nN^kn\geq\hat{N}_{k}, it follows that NkN^kN_{k}\leq\hat{N}_{k}, and the result follows. ∎

Applying Theorem 13 results in the bounds for NkN_{k} are shown in Table 2.

Table 2. Bounds on NkN_{k} produced from Theorem 13. The values for NkRN^{R}_{k} given in this table agree with the record values listed in Table 1 for all k5k\leq 5 (boldface), and are strictly better for k6k\geq 6.
kk N^k=NkR\hat{N}_{k}=N^{R}_{k} formula initial sequence
4 24 - -
5 𝟓𝟕𝟔{\bf 576} (521)2(5^{2}-1)^{2} t=4t=4
6 7 350\numprint{7350} 6(621)26(6^{2}-1)^{2} t=4t=4
7 96 768\numprint{96768} 76(721)27\cdot 6\cdot(7^{2}-1)^{2} t=4t=4
8 1 333 584\numprint{1333584} 8!5!(821)2\frac{8!}{5!}(8^{2}-1)^{2} t=4t=4
9 19 353 600\numprint{19353600} 9!5!(921)2\frac{9!}{5!}(9^{2}-1)^{2} t=4t=4
10 287 400 960\numprint{287400960} 10!6!𝟓𝟕𝟔(1021)\frac{10!}{6!}\cdot\mathbf{576}\cdot(10^{2}-1) 𝐭=𝟓\mathbf{t=5}
11 3 832 012 800\numprint{3832012800} 11!6!576(1121)\frac{11!}{6!}\cdot 576\cdot(11^{2}-1) t=5t=5
\vdots
24 2.85×1026\approx 2.85\times 10^{26} 24!6!576(2421)\frac{24!}{6!}\cdot 576\cdot(24^{2}-1) t=5t=5
25 8.39×1027\approx 8.39\times 10^{27} 25!6!(𝟐𝟓𝟐𝟏)𝟐\frac{25!}{6!}\cdot\mathbf{(25^{2}-1)^{2}} t=5t=5
26 8.02×1030\approx 8.02\times 10^{30} 26!6!(2621)2\frac{26!}{6!}\cdot(26^{2}-1)^{2} t=5t=5
\vdots
32 3.82×1038\approx 3.82\times 10^{38} 32!6!(3221)2\frac{32!}{6!}\cdot(32^{2}-1)^{2} t=5t=5
33 1.38×1040\approx 1.38\times 10^{40} 33!7!𝟕𝟑𝟓𝟎(3321)\frac{33!}{7!}\cdot\mathbf{7350}\cdot(33^{2}-1) 𝐭=𝟔\mathbf{t=6}
\vdots
85 2.97×10132\approx 2.97\times 10^{132} 85!7!𝟕𝟑𝟓𝟎(8521)\frac{85!}{7!}\cdot\mathbf{7350}\cdot(85^{2}-1) t=6t=6
86 2.63×10134\approx 2.63\times 10^{134} 86!7!(𝟖𝟔𝟐𝟏)𝟐\frac{86!}{7!}\cdot\mathbf{(86^{2}-1)^{2}} t=6t=6
\vdots
109 4.04×10180\approx 4.04\times 10^{180} 109!7!(10921)2\frac{109!}{7!}(109^{2}-1)^{2} t=6t=6
110 4.61×10182\approx 4.61\times 10^{182} 110!8!7!5!(721)2(11021)\frac{110!}{8!}\cdot\frac{7!}{5!}\cdot(7^{2}-1)^{2}\cdot(110^{2}-1) 𝐭=𝟕\mathbf{t=7}

There are some interesting things to notice about the bounds from Theorem 13 shown in Table 2. First, note that t=3t=3 is never used in determining N^k\hat{N}_{k}. Second, for example, the bound N^10\hat{N}_{10} uses an initial sequence of 55-configurations, rather than starting with 44-configurations. To understand why, observe that

N^10\displaystyle\hat{N}_{10} =(k21)min3t9{N(k,t,N^t,1)}\displaystyle=(k^{2}-1)\min_{3\leq t\leq 9}\{N(k,t,\hat{N}_{t},1)\}
=99min{10!4!max{N^3=9,99},10!5!max{N^4=24,99},10!6!max{N^5=576,99},\displaystyle=99\min\biggl{\{}\frac{10!}{4!}\max\{\hat{N}_{3}=9,99\},\frac{10!}{5!}\max\{\hat{N}_{4}=24,99\},\frac{10!}{6!}\max\{\hat{N}_{5}=576,99\},
10!7!max{N^6=7350,99},,10!10!max{N^9,99}}\displaystyle\phantom{===}\;\,\,\qquad\frac{10!}{7!}\max\{\hat{N}_{6}=7350,99\},\ldots,\frac{10!}{10!}\max\{\hat{N}_{9},99\}\biggr{\}}
=99min{10!4!99,10!5!99,10!6!576,10!7!N^6,,N^9}\displaystyle=99\min\left\{\frac{10!}{4!}99,\frac{10!}{5!}99,\frac{10!}{6!}576,\frac{10!}{7!}\hat{N}_{6},\ldots,\hat{N}_{9}\right\}

Since 699>5766\cdot 99>576 (and the values N^t\hat{N}_{t} for 6t96\leq t\leq 9 much larger than either), the minimum of that list is actually 10!6!576\frac{10!}{6!}576, and the computation for N^10\hat{N}_{10} starts with the sequence of consecutive 55-configurations (5765),(5775),(576_{5}),(577_{5}),\ldots rather than with (244),(254),(24_{4}),(25_{4}),\ldots. Sequences with t=5t=5 begin to dominate when 6(k21)>576=(521)26(k^{2}-1)>576=(5^{2}-1)^{2}; that is, when k97=10k\geq\lceil\sqrt{97}\rceil=10. Sequences with t=6t=6 begin to dominate when 7(k21)>6(621)2=73507(k^{2}-1)>6(6^{2}-1)^{2}=7350, or k1051=33k\geq\left\lceil\sqrt{1051}\right\rceil=33. Sequences with t=7t=7 will dominate when 8(k21)>76(721)28(k^{2}-1)>7\cdot 6\cdot(7^{2}-1)^{2}, that is k12097=110k\geq\lceil\sqrt{12097}\rceil=110. However, note that these bounds are absurdly large; N^1104.6×10182\hat{N}_{110}\approx 4.6\times 10^{182}.

In addition, observe that since k=25k=25 is the smallest positive integer satisfying k21>576k^{2}-1>576, the bounds for N^25\hat{N}_{25} use the 252125^{2}-1 choice rather than N^5\hat{N}_{5} in taking the maximum, even though both N^24\hat{N}_{24} and N^25\hat{N}_{25} are starting with the same initial sequence of 55-configurations, and there is a similar transition again at k=86k=86, when the function is using 66-configurations to produce the maximum. At this position, since 8521=722485^{2}-1=7224 and 8621=739586^{2}-1=7395, N^85\hat{N}_{85} uses N^6=7350\hat{N}_{6}=7350, but N^86\hat{N}_{86} transitions to using 862186^{2}-1 to compute the maximum.

5. Future work

With better bounds NtRN^{R}_{t} developed experimentally for small values of tt, in the same way that N4R=24N^{R}_{4}=24 has been determined experimentally, we anticipate significantly better bounds NkRN^{R}_{k}, for k>tk>t, without changing the methods for obtaining the bounds.

One obvious approach is to improve the bookkeeping even further. For instance, in Theorem 13 we only used arithmetic sequences with d=1d=1 in N(k,t,a,d)N(k,t,a,d) and ignoring any existing configuration (mt)(m_{t}) for m<Ntm<N_{t}. In particular, for t=4t=4, we could have used N(k,4,18,2)N(k,4,18,2) since 18,20,22,24,18,20,22,24,\ldots form an arithmetic sequence of 44-realizable numbers. Our experiments indicate that this particular sequence has no impact in improving the bounds. However, by carefully keeping track of the existing tt-configurations below NtRN^{R}_{t}, other more productive arithmetic sequences may appear.

Another approach is to sharpen the bounds for NkN_{k}, for general kk. This can be achieved, for instance, by generalizing some other “Grünbaum Calculus” operations, which we plan for a subsequent paper. We also plan to apply several ad hoc constructions for 55- and 66-configurations to further sharpen the bound for N5N_{5} and N6N_{6}, which will, in turn, lead to significantly better bounds for NkN_{k} for higher values of kk. However, based on the work involved in bounding N4N_{4} and the fact that N4N_{4} is not currently known (and on how hard it was to show the nonexistence of an (194)(19_{4}) configuration), we anticipate that even determining N5N_{5} exactly is an extremely challenging problem.

Finally, very little is known about existence results on unbalanced configurations, that is, configurations (pq,nk)(p_{q},n_{k}) where qkq\neq k. While some examples and families are known, it would be interesting to know any bounds or general results on the existence of such configurations.

Acknowledgements

Gábor Gévay’s research is supported by the Hungarian National Research, Development and Innovation Office, OTKA grant No. SNN 132625. Tomaž Pisanski’s research is supported in part by the Slovenian Research Agency (research program P1-0294 and research projects N1-0032, J1-9187, J1-1690, N1-0140, J1-2481), and in part by H2020 Teaming InnoRenew CoE.

References

  • [1] Jürgen Bokowski and Vincent Pilaud. On topological and geometric (194)(19_{4}) configurations. European J. Combin., 50:4–17, 2015.
  • [2] Jürgen Bokowski and Vincent Pilaud. Quasi-configurations: building blocks for point-line configurations. Ars Math. Contemp., 10(1):99–112, 2016.
  • [3] Jürgen Bokowski and Lars Schewe. On the finite set of missing geometric configurations (n4)(n_{4}). Comput. Geom., 46(5):532–540, 2013.
  • [4] Harold Scott MacDonald Coxeter. Introduction to Geometry. Wiley, New York, 2nd ed. edition, 1969.
  • [5] Michael Cuntz. (224)(22_{4}) and (264)(26_{4}) configurations of lines. Ars Math. Contemp., 14:157–163, 2018.
  • [6] Branko Grünbaum. Connected (n4)(n_{4}) configurations exist for almost all nn. Geombinatorics, 10(1):24–29, 2000.
  • [7] Branko Grünbaum. Which (n4)(n_{4}) configurations exist? Geombinatorics, 9(4):164–169, 2000.
  • [8] Branko Grünbaum. Connected (n4)(n_{4}) configurations exist for almost all nn—an update. Geombinatorics, 12(1):15–23, 2002.
  • [9] Branko Grünbaum. Connected (n4)(n_{4}) configurations exist for almost all nn—second update. Geombinatorics, 16(2):254–261, 2006.
  • [10] Branko Grünbaum. Musings on an example of Danzer’s. European J. Combin., 29(8):1910–1918, 2008.
  • [11] Branko Grünbaum. Configurations of Points and Lines, volume 103 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2009.
  • [12] Branko Grünbaum and John F. Rigby. The real configuration (214)(21_{4}). J. London Math. Soc., 41:336–346, 1990.
  • [13] Tomaž Pisanski and Brigitte Servatius. Configurations from a Graphical Viewpoint. Birkhäuser Advanced Texts. Birkhäuser, New York, 2013.