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. 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 as . 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. A configuration in the plane is denoted by (pγ lpi), where p is the number of points, l the number of lines, γ the number of lines per point, and pi 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γ lpi), need not be isomorphic as incidence structures. For instance, there exist three different (93 93) configurations: the Pappus configuration and two less notable configurations. In some configurations, p = l and consequently, γ = pi. These are called symmetric or balanced configurations and the notation is often condensed to avoid repetition.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (24)

Related people (1)

Related units (1)

Related concepts (17)

Related courses (3)

Related lectures (11)

Levi graph

In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942. The Levi graph of a system of points and lines usually has girth at least six: Any 4-cycles would correspond to two lines through the same two points.

Incidence geometry

In mathematics, incidence geometry is the study of incidence structures. A geometric structure such as the Euclidean plane is a complicated object that involves concepts such as length, angles, continuity, betweenness, and incidence. An incidence structure is what is obtained when all other concepts are removed and all that remains is the data about which points lie on which lines. Even with this severe limitation, theorems can be proved and interesting facts emerge concerning this structure.

Pappus configuration

In geometry, the Pappus configuration is a configuration of nine points and nine lines in the Euclidean plane, with three points per line and three lines through each point. This configuration is named after Pappus of Alexandria. Pappus's hexagon theorem states that every two triples of collinear points ABC and abc (none of which lie on the intersection of the two lines) can be completed to form a Pappus configuration, by adding the six lines Ab, aB, Ac, aC, Bc, and bC, and their three intersection points X = Ab·aB, Y = Ac·aC, and Z = Bc·bC.

AR-327: Introduction to computational architecture

This course introduces the students to text programming practice in 3D modeling (Rhinoceros3D). The main objective of the course is to develop a computational mindset to maximize the use of efficient

MATH-126: Geometry for architects II

Ce cours traite des 3 sujets suivants : la perspective, la géométrie descriptive, et une initiation à la géométrie projective.

MATH-124: Geometry for architects I

Ce cours entend exposer les fondements de la géométrie à un triple titre : 1/ de technique mathématique essentielle au processus de conception du projet, 2/ d'objet privilégié des logiciels de concept

Isometries & Orientation in Modern Geometry

Explores true angle magnitude, reflections, isometries, and symmetries in modern geometry, with practical CAD applications.

Projective Geometry: Fundamentals and Applications MATH-126: Geometry for architects II

Explores the fundamentals of projective geometry and its practical applications in solving geometric problems.

Symmetry in Space: Rotororeflections MATH-124: Geometry for architects I

Explores rotororeflections, normalization of reflections, creation of mirrored pieces, and practical applications in design.

Stabilized isogeometric discretizations on trimmed and union geometries, and weak imposition of the boundary conditions for the Darcy flow

Riccardo Puppi

Modern manufacturing engineering is based on a ``design-through-analysis'' workflow. According to this paradigm, a prototype is first designed with Computer-aided-design (CAD) software and then finalized by simulating its physical behavior, which usually i ...

EPFL2022

A Künneth theorem for configuration spaces

Kathryn Hess Bellwald

We construct a spectral sequence converging to the homology of the ordered configuration spaces of a product of parallelizable manifolds. To identify the second page of this spectral sequence, we introduce a version of the Boardman-Vogt tensor product for ...

2022

Model order reduction based on functional rational approximants for parametric PDEs with meromorphic structure

Davide Pradovera

Many engineering fields rely on frequency-domain dynamical systems for the mathematical modeling of physical (electrical/mechanical/etc.) structures. With the growing need for more accurate and reliable results, the computational burden incurred by frequen ...

EPFL2021