# Configuration

**Configurations** are a type of incidence geometry that generalize the idea of a polygon, allowing edges to connect any fixed number of colinear vertices and vertices to connect to any fixed number of edges. Unlike abstract polytopes which generalize polygons to higher ranks but follow the diamond property, configurations are all rank 2 but generalize the diamond property. Configurations are studied both as abstract combinatorial objects and with realizations in Euclidean and projective space.

## Definition[edit | edit source]

### From first principles[edit | edit source]

A configuration is a tuple where:

- V is a set whose elements are called vertices.
- E is a set whose elements are called edges.
- * is a binary relation between edges and vertices.
- The degree of all vertices are equal, where the degree of a vertex v is .
- The degree of all edges are equal, where the degree of a edge e is .
- For vertices and and edges and , if , , , and then either or . In other words, two edges can intersect at most one vertex and two vertices can be connected by at most one edge.

### As an incidence geometry[edit | edit source]

A configuration is an incidence geometry with two types: vertices and edges, such that:

- Every edge is incident on the same number of vertices.
- Every vertex is incident on the same number of edges.
- For vertices and and edges and , if , , , and then either or . In other words, two edges can intersect at most one vertex and two vertices can be connected by at most one edge.

## Symbols[edit | edit source]

A configuration can be given the symbol where

- v is the number of vertices
- e is the number of edges
- φ is the degree of each vertex
- ψ is the degree of each edge

When the symbol can be abbreviated to .

Symbols are not unique, for example both the hexagon and the hexagram have the symbol (6_{2}).

Not every symbol has a configuration. For example the following conditions must be met for a symbol to have a configuration:

## Realization[edit | edit source]

While the definition is synthetic, configurations are often realized in Euclidean or projective space. A realization of a configuration in a space S consists of

- An injective mapping from vertices to points in S
- An injective mapping from edges to lines in S

such that

## Relationship to polygons[edit | edit source]

Most polygons are 2-configurations, with an n -gon having the symbol (n_{2}). The digon and the monogon which are valid polygons under some definitions are not valid 2-configurations. The monogon is a valid 1-configuration.

Polygon compounds are also valid 2-configurations as there is no requirement of connectivity in the definition of a configuration.

Other configurations are generally exotic polygonoids, as they do not satisfy the diamond property.

### Relationship to complex polygons[edit | edit source]

Like configurations, complex polygons are a generalization of polygons not required to have dyadic edges. Regular complex polygons have all vertices of same degree and all edges of same degree, and they are a special kind of configuration where points are in and lines are complex 1-spaces (or equivalently, points are in and lines are geometrically planes). For example, the Möbius–Kantor polygon is a realization of the Möbius–Kantor configuration.

## Generalization of higher rank[edit | edit source]

This section is empty. You can help by adding to it. |

## See also[edit | edit source]

## External links[edit | edit source]

- Wikipedia contributors. "Configuration (geometry)".
- Weisstein, Eric W. "Configuration" at MathWorld.