# Configuration (geometry)

In mathematics, specifically projective geometry, a **configuration** in the plane consists of a finite set of points, and a finite arrangement of lines, such that each point is incident to the same number of lines and each line is incident to the same number of points.^{[1]}

Although certain specific configurations had been studied earlier (for instance by Thomas Kirkman in 1849), the formal study of configurations was first introduced by Theodor Reye in 1876, in the second edition of his book *Geometrie der Lage*, in the context of a discussion of Desargues' theorem. Ernst Steinitz wrote his dissertation on the subject in 1894, and they were popularized by Hilbert and Cohn-Vossen's 1932 book *Anschauliche Geometrie*, reprinted in English (Hilbert & Cohn-Vossen 1952).

Configurations may be studied either as concrete sets of points and lines in a specific geometry, such as the Euclidean or projective planes (these are said to be *realizable* in that geometry), or as a type of abstract incidence geometry. In the latter case they are closely related to regular hypergraphs and biregular bipartite graphs, but with some additional restrictions: every two points of the incidence structure can be associated with at most one line, and every two lines can be associated with at most one point. That is, the girth of the corresponding bipartite graph (the Levi graph of the configuration) must be at least six.

## Contents

## Notation

A configuration in the plane is denoted by (*p*_{γ} *ℓ*_{π}), where *p* is the number of points, *ℓ* the number of lines, γ the number of lines per point, and π the number of points per line. These numbers necessarily satisfy the equation

as this product is the number of point-line incidences (*flags*).

Configurations having the same symbol, say (*p*_{γ} *ℓ*_{π}), need not be isomorphic as incidence structures. For instance, there exist three different (9_{3} 9_{3}) configurations: the Pappus configuration and two less notable configurations.

In some configurations, *p* = *ℓ* and consequently, γ = π. These are called *symmetric* or *balanced* (Grünbaum 2009) configurations and the notation is often condensed to avoid repetition. For example (9_{3} 9_{3}) abbreviates to (9_{3}).

## Examples

Notable projective configurations include the following:

- (1
_{1}), the simplest possible configuration, consisting of a point incident to a line. Often excluded as being trivial. - (3
_{2}), the triangle. Each of its three sides meets two of its three vertices, and vice versa. More generally any polygon of*n*sides forms a configuration of type (*n*_{2}) - (4
_{3}6_{2}) and (6_{2}4_{3}), the complete quadrangle and complete quadrilateral respectively. - (7
_{3}), the Fano plane. This configuration exists as an abstract incidence geometry, but cannot be constructed in the Euclidean plane. - (8
_{3}), the Möbius–Kantor configuration. This configuration describes two quadrilaterals that are simultaneously inscribed and circumscribed in each other. It cannot be constructed in Euclidean plane geometry but the equations defining it have nontrivial solutions in complex numbers. - (9
_{3}), the Pappus configuration. - (9
_{4}12_{3}), the Hesse configuration of nine inflection points of a cubic curve in the complex projective plane and the twelve lines determined by pairs of these points. This configuration shares with the Fano plane the property that it contains every line through its points; configurations with this property are known as*Sylvester–Gallai configurations*due to the Sylvester–Gallai theorem that shows that they cannot be given real-number coordinates (Kelly 1986). - (10
_{3}), the Desargues configuration. - (12
_{5}30_{2}), the Schläfli double six, formed by 12 of the 27 lines on a cubic surface - (15
_{3}), the Cremona–Richmond configuration, formed by the 15 lines complementary to a double six and their 15 tangent planes - (12
_{4}16_{3}), the Reye configuration. - (16
_{6}), the Kummer configuration. - (27
_{3}), the Gray configuration - (60
_{15}), the Klein configuration.

## Duality of configurations

The projective dual of a configuration (*p*_{γ} *l*_{π}) is a (*l*_{π} *p*_{γ}) configuration in which the roles of "point" and "line" are exchanged. Types of configurations therefore come in dual pairs, except when taking the dual results in an isomorphic configuration. These exceptions are called *self-dual* configurations and in such cases *p* = *l*.^{[2]}

## The number of (*n*_{3}) configurations

The number of nonisomorphic configurations of type (*n*_{3}), starting at *n* = 7, is given by the sequence

These numbers count configurations as abstract incidence structures, regardless of realizability (Betten, Brinkmann & Pisanski 2000). As Gropp (1997) discusses, nine of the ten (10_{3}) configurations, and all of the (11_{3}) and (12_{3}) configurations, are realizable in the Euclidean plane, but for each *n* ≥ 16 there is at least one nonrealizable (*n*_{3}) configuration. Gropp also points out a long-lasting error in this sequence: an 1895 paper attempted to list all (12_{3}) configurations, and found 228 of them, but the 229th configuration was not discovered until 1988.

## Constructions of symmetric configurations

There are several techniques for constructing configurations, generally starting from known configurations. Some of the simplest of these techniques construct symmetric (*p*_{γ}) configurations.

Any finite projective plane of order *n* is an ((*n*^{2} + *n* + 1)_{n + 1}) configuration. Let Π be a projective plane of order *n*. Remove from Π a point *P* and all the lines of Π which pass through *P* (but not the points which lie on those lines except for *P*) and remove a line *l* not passing through *P* and all the points that are on line *l*. The result is a configuration of type ((*n*^{2} - 1)_{n}). If, in this construction, the line *l* is chosen to be a line which does pass through *P*, then the construction results in a configuration of type ((*n*^{2})_{n}). Since projective planes are known to exist for all orders *n* which are powers of primes, these constructions provide infinite families of symmetric configurations.

Not all configurations are realizable, for instance, a (43_{7}) configuration does not exist.^{[3]} However, Gropp (1990) has provided a construction which shows that for *k* ≥ 3, a (*p*_{k}) configuration exists for all *p* ≥ 2 *l*_{k} + 1, where *l*_{k} is the length of an optimal Golomb ruler of order *k*.

## Higher dimensions

The concept of a configuration may be generalized to higher dimensions, for instance to points and lines or planes in space. In such cases, the restrictions that no two points belong to more than one line may be relaxed, because it is possible for two points to belong to more than one plane.

Notable three-dimensional configurations are the Möbius configuration, consisting of two mutually inscribed tetrahedra, Reye's configuration, consisting of twelve points and twelve planes, with six points per plane and six planes per point, the Gray configuration consisting of a 3×3×3 grid of 27 points and the 27 orthogonal lines through them, and the Schläfli double six, a configuration with 30 points, 12 lines, two lines per point, and five points per line.

A further generalization is obtained in three dimensions by considering incidences of points, lines *and* planes, or *j*-spaces (0 ≤ *j* < 3), where each *j*-space is incident with *N _{jk}*

*k*-spaces (

*j*≠

*k*). Writing

*N*for the number of

_{jj}*j*-spaces present, a given configuration may be represented by the matrix:

The principle extends generally to *n* dimensions, where 0 ≤ *j* < *n*. Such configurations are related mathematically to regular polytopes.^{[4]}

## See also

- Complex polytope (which could be better called
*complex configurations*)

## Notes

- ↑ In the literature, the terms
*projective configuration*(Hilbert & Cohn-Vossen 1952) and*tactical configuration of type (1,1)*(Dembowski 1968) are also used to describe configurations as defined here. - ↑ Coxeter 1999, pp. 106-149
- ↑ This configuration would be a projective plane of order 6 which does not exist by the Bruck-Ryser theorem.
- ↑ (Coxeter 1948)

## References

- Berman, Leah W., "Movable (
*n*_{4}) configurations",*The Electronic Journal of Combinatorics*,**13**(1): R104<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Betten, A; Brinkmann, G.; Pisanski, T. (2000), "Counting symmetric configurations",
*Discrete Applied Mathematics*,**99**(1–3): 331–338, doi:10.1016/S0166-218X(99)00143-2<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Coxeter, H.S.M. (1948),
*Regular Polytopes*, Methuen and Co<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Coxeter, H.S.M. (1999), "Self-dual configurations and regular graphs",
*The Beauty of Geometry*, Dover, ISBN 0-486-40919-8<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> - Dembowski, Peter (1968),
*Finite geometries*, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 44, Berlin, New York: Springer-Verlag, ISBN 3-540-61786-8, MR 0233275<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> - Gropp, Harald (1990), "On the existence and non-existence of configurations
*n*_{k}",*Journal of Combinatorics and Information System Science*,**15**: 34–48<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> - Gropp, Harald (1997), "Configurations and their realization",
*Discrete Mathematics*,**174**(1–3): 137–151, doi:10.1016/S0012-365X(96)00327-5<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Grünbaum, Branko (2006), "Configurations of points and lines", in Davis, Chandler; Ellers, Erich W. (eds.),
*The Coxeter Legacy: Reflections and Projections*, American Mathematical Society, pp. 179–225<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Grünbaum, Branko (2009),
*Configurations of Points and Lines*, Graduate Studies in Mathematics,**103**, American Mathematical Society, ISBN 978-0-8218-4308-6<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Hilbert, David; Cohn-Vossen, Stephan (1952),
*Geometry and the Imagination*(2nd ed.), Chelsea, pp. 94–170, ISBN 0-8284-1087-9<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Kelly, L. M. (1986), "A resolution of the Sylvester–Gallai problem of J. P. Serre",
*Discrete and Computational Geometry*,**1**(1): 101–104, doi:10.1007/BF02187687<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. - Pisanski, Tomaž; Servatius, Brigitte (2013),
*Configurations from a Graphical Viewpoint*, Springer, ISBN 9780817683641<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>.