The word configuration is sometimes used to describe a finite collection of points ,
, where
is a Euclidean space.
The term "configuration" also is used to describe a finite incidence structure
with the following properties, where
,
,
, and
are positive integers
(Gropp 1997).
1. There are
points and
lines.
2. There are
points on each line and
lines through each point.
3. Two different lines intersect each other at most once and two different points are connected by a line at most once.
The conditions
|
(1)
|
|
(2)
|
|
(3)
|
are necessary for the existence of a configuration. For ,
these conditions are also sufficient (Gropp 1994).
For
,
sufficiency was conjectured by Gropp (2001). The necessary conditions hold, but there
is no
.
For
and 7, they are not sufficient. Configurations with
parameters
and
would be an affine plane and a projective
plane of order 6, respectively, neither of which exists.
Configurations are among the oldest combinatorial structures, having been defined by T. Reye in 1876. An -regular graph can be regarded
as a configuration
by associating nodes with the points, and edges with the lines.
A symmetric configuration consists of
lines and
points arranged such that
lines pass through each point and there are
points on each line. Important families are n3
configurations and n4 configurations.
Betten et al. (2000) enumerated the abstract symmetric n3
configurations through
. The numbers of
,
,
, ... configurations are 1, 1, 3, 10, 31, 229, 2036, 21399,
245342, ..., correcting an error of von Sterneck for
(OEIS A001403; Sterneck
1894, 1895; Wells 1991, p. 72; Colbourn and Dinitz 1996; Gropp 1997; Hilbert
and Cohn-Vossen 1999).
A combinatorial configuration has a geometric realization when its abstract points and lines can be represented by points and straight lines with the prescribed incidences. Some authors take the ambient space to be the real projective plane, while others require an affine or Euclidean plane realization (Bokowski and Pilaud 2014, Berman et al. 2024).
The smallest geometric symmetric 4-configurations are the nonisomorphic Bokowski-Schewe configuration and Bokowski-Pilaud
configuration; none exists for (Bokowski and Schewe 2005, Bokowski and Schewe 2013,
Bokowski and Pilaud 2014). No geometric 194
configuration exists (Bokowski and Pilaud 2015), while Grünbaum (2008) constructed
the Grünbaum 204 configuration.
At order 21, the Grünbaum-Rigby
configuration and the Berman-Gévay-Pisanski
configuration are the two geometric
polycyclic configurations
(Berman et al. 2024).
The Fano plane is the unique abstract configuration. It is realizable over the finite
field of order 2
,
but not over the real or rational numbers (Gropp 1997). Allowing a point
at infinity in the real projective plane
does not remove this obstruction.
The unique abstract
configuration is the Möbius-Kantor
configuration. It is realizable over the complex
numbers, but not over the real or rational numbers (Gropp 1997). Thus it also
has no realization by straight lines in the real
projective plane.
Kantor (1891) showed that there are three 93 configurations, of which the Pappus configuration (left figure) is one (Coxeter 1950; Wells 1986, p. 75). The other two consist of embedded equilateral triangles (Wells 1991, pp. 159-160).
Kantor (1881) proved that there are exactly ten 103 configurations, of which the Desargues
configuration, illustrated above, is one. However, while not explicitly commented
upon in paper, Kantor's
contained a line which consists of two line segments oriented in slightly different
directions. Schroeter (1889) subsequently proved that exactly one of these configurations
cannot be drawn in the real or rational planes (Gropp 1997).
There are 31 configurations (Gropp 1997), as constructed by Martinetti (1887) using
recursive construction method, which were subsequently realized in the plane by Daublebsky
von Sterneck (1895), though the proof that all are realizable came only with the
work of Sturmfels and White (1990). Page and Dorwart (1984) discuss the 31
configurations (Wells 1991, p. 63).
There are 229 configurations , 228 of which had been found by Daublebsky von Sterneck
(1895), with the missing one not found until the work of Gropp (1991). One of the
configurations is sometimes known
as the Coxeter configuration, although it
is perhaps better to refer it the Nauru configuration
based on its Levi graph (which is the Nauru
graph). Coordinates for realizations of all
and
configurations appeared in an appendix to Crapo et al.
(1988).
The Coxeter configuration is a configuration whose Levi graph
is the Foster graph
.
The Cremona-Richmond configuration, illustrated above, is one of the 245342 configurations.
There is a
configuration known as the Cox configuration.
The following table summarizes the Levi graphs of some named configurations.
Lu (2026) constructed geometric 234 configurations, settling the last unresolved existence case for geometric n4 configurations. Consequently,
geometric n4 configurations
in the real projective plane exist iff and
. This concerns geometric realizations, not merely abstract
incidence structures.