PG(3,2)

Last updated
Fano Space.png
PG(3, 2) depicted as a tetrahedron (see § Tetrahedral depiction )

In finite geometry, PG(3, 2) is the smallest three-dimensional projective space. It can be thought of as an extension of the Fano plane. It has 15 points, 35 lines, and 15 planes. [1] It also has the following properties: [2]

Contents

Constructions

Construction from K6

Take a complete graph K6. It has 15 edges, 15 perfect matchings and 20 triangles. Create a point for each of the 15 edges, and a line for each of the 20 triangles and 15 matchings. The incidence structure between each triangle or matching (line) and its three constituent edges (points) induces a PG(3, 2).

Construction from Fano planes

Take a Fano plane and apply all 5040 permutations of its 7 points. Discard duplicate planes to obtain a set of 30 distinct Fano planes. Pick any of the 30, and pick the 14 others that have exactly one line in common with the first, not 0 or 3. The incidence structure between the 1 + 14 = 15 Fano planes and the 35 triplets they mutually cover induces a PG(3, 2). [3]

Representations

Tetrahedral depiction

PG(3, 2) can be represented as a tetrahedron. The 15 points correspond to the 4 vertices + 6 edge-midpoints + 4 face-centers + 1 body-center. The 35 lines correspond to the 6 edges + 12 face-medians + 4 face-incircles + 4 altitudes from a face to the opposite vertex + 3 lines connecting the midpoints of opposite edges + 6 ellipses connecting each edge midpoint with its two non-neighboring face centers. The 15 planes consist of the 4 faces + the 6 "medial" planes connecting each edge to the midpoint of the opposite edge + 4 "cones" connecting each vertex to the incircle of the opposite face + one "sphere" with the 6 edge centers and the body center. This was described by Burkard Polster. [4] The tetrahedral depiction has the same structure as the visual representation of the multiplication table for the sedenions. [5]

Square representation

Square model of Fano 3-space 150614-PG-3-2-schoolgirls-arrangement.png
Square model of Fano 3-space

PG(3, 2) can be represented as a square. The 15 points are assigned 4-bit binary coordinates from 0001 to 1111, augmented with a point labeled 0000, and arranged in a 4×4 grid. Lines correspond to the equivalence classes of sets of four vertices that XOR together to 0000. With certain arrangements of the vertices in the 4×4 grid, such as the "natural" row-major ordering or the Karnaugh map ordering, the lines form symmetric sub-structures like rows, columns, transversals, or rectangles, as seen in the figure. (There are 20160 such orderings, as seen below in the section on Automorphisms.) This representation is possible because geometrically the 35 lines are represented as a bijection with the 35 ways to partition a 4×4 affine space into 4 parallel planes of 4 cells each. This was described by Steven H. Cullinane.

Doily depiction

The Doily. This is also a representation of the strongly regular graph srg(15,6,1,3) drawn with overlapping edges. GQ(2,2).svg
The Doily. This is also a representation of the strongly regular graph srg(15,6,1,3) drawn with overlapping edges.

The Doily diagram often used to represent the generalized quadrangle GQ(2, 2) is also used to represent PG(3, 2). This was described by Richard Doily. [2]

Kirkman's schoolgirl problem

PG(3, 2) arises as a background in some solutions of Kirkman's schoolgirl problem. Two of the seven non-isomorphic solutions to this problem can be embedded as structures in the Fano 3-space. In particular, a spread of PG(3, 2) is a partition of points into disjoint lines, and corresponds to the arrangement of girls (points) into disjoint rows (lines of a spread) for a single day of Kirkman's schoolgirl problem. There are 56 different spreads of 5 lines each. A packing of PG(3, 2) is a partition of the 35 lines into 7 disjoint spreads of 5 lines each, and corresponds to a solution for all seven days. There are 240 packings of PG(3, 2), that fall into two conjugacy classes of 120 under the action of PGL(4, 2) (the collineation group of the space); a correlation interchanges these two classes. [6]

Automorphisms

The automorphism group of PG(3, 2) maps lines to lines. The number of automorphisms is given by finding the number of ways of selecting 4 points that are not coplanar; this works out to 15⋅14⋅12⋅8 = 20160 = 8!/2. It turns out that the automorphism group of PG(3, 2) is isomorphic to the alternating group on 8 elements A8.

Coordinates

It is known that a PG(n, 2) can be coordinatized with (GF(2))n+1, i.e. a bit string of length n + 1. PG(3, 2) can therefore be coordinatized with 4-bit strings.

In addition, the line joining points (a1, a2, a3, a4) and (b1, b2, b3, b4) can be naturally assigned Plücker coordinates (p12, p13, p14, p23, p24, p34) where pij = aibjajbi, and the line coordinates satisfy p12p34 + p13p24 + p14p23 = 0. Each line in projective 3-space thus has six coordinates, and can be represented as a point in projective 5-space; the points lie on the surface p12p34 + p13p24 + p14p23 = 0.

Citations

Related Research Articles

<span class="mw-page-title-main">Projective plane</span> Geometric concept of a 2D space with a "point at infinity" adjoined

In mathematics, a projective plane is a geometric structure that extends the concept of a plane. In the ordinary Euclidean plane, two lines typically intersect at a single point, but there are some pairs of lines that do not intersect. A projective plane can be thought of as an ordinary plane equipped with additional "points at infinity" where parallel lines intersect. Thus any two distinct lines in a projective plane intersect at exactly one point.

<span class="mw-page-title-main">Steiner system</span> Block design in combinatorial mathematics

In combinatorial mathematics, a Steiner system is a type of block design, specifically a t-design with λ = 1 and t = 2 or (recently) t ≥ 2.

<span class="mw-page-title-main">Projective space</span> Completion of the usual space with "points at infinity"

In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet at infinity. A projective space may thus be viewed as the extension of a Euclidean space, or, more generally, an affine space with points at infinity, in such a way that there is one point at infinity of each direction of parallel lines.

<span class="mw-page-title-main">Finite geometry</span> Geometric system with a finite number of points

A finite geometry is any geometric system that has only a finite number of points. The familiar Euclidean geometry is not finite, because a Euclidean line contains infinitely many points. A geometry based on the graphics displayed on a computer screen, where the pixels are considered to be the points, would be a finite geometry. While there are many systems that could be called finite geometries, attention is mostly paid to the finite projective and affine spaces because of their regularity and simplicity. Other significant types of finite geometry are finite Möbius or inversive planes and Laguerre planes, which are examples of a general type called Benz planes, and their higher-dimensional analogs such as higher finite inversive geometries.

<span class="mw-page-title-main">24-cell</span> Regular object in four dimensional geometry

In four-dimensional geometry, the 24-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,4,3}. It is also called C24, or the icositetrachoron, octaplex (short for "octahedral complex"), icosatetrahedroid, octacube, hyper-diamond or polyoctahedron, being constructed of octahedral cells.

<span class="mw-page-title-main">Projective linear group</span> Construction in group theory

In mathematics, especially in the group theoretic area of algebra, the projective linear group (also known as the projective general linear group or PGL) is the induced action of the general linear group of a vector space V on the associated projective space P(V). Explicitly, the projective linear group is the quotient group

<span class="mw-page-title-main">Fano plane</span> Geometry with 7 points and 7 lines

In finite geometry, the Fano plane is a finite projective plane with the smallest possible number of points and lines: 7 points and 7 lines, with 3 points on every line and 3 lines through every point. These points and lines cannot exist with this pattern of incidences in Euclidean geometry, but they can be given coordinates using the finite field with two elements. The standard notation for this plane, as a member of a family of projective spaces, is PG(2, 2). Here, PG stands for "projective geometry", the first parameter is the geometric dimension and the second parameter is the order.

<span class="mw-page-title-main">Klein quartic</span> Compact Riemann surface of genus 3

In hyperbolic geometry, the Klein quartic, named after Felix Klein, is a compact Riemann surface of genus 3 with the highest possible order automorphism group for this genus, namely order 168 orientation-preserving automorphisms, and 168 × 2 = 336 automorphisms if orientation may be reversed. As such, the Klein quartic is the Hurwitz surface of lowest possible genus; see Hurwitz's automorphisms theorem. Its (orientation-preserving) automorphism group is isomorphic to PSL(2, 7), the second-smallest non-abelian simple group after the alternating group A5. The quartic was first described in (Klein 1878b).

<span class="mw-page-title-main">Incidence structure</span> Abstract mathematical system of two types of objects and a relation between them

In mathematics, an incidence structure is an abstract system consisting of two types of objects and a single relationship between these types of objects. Consider the points and lines of the Euclidean plane as the two types of objects and ignore all the properties of this geometry except for the relation of which points are on which lines for all points and lines. What is left is the incidence structure of the Euclidean plane.

<span class="mw-page-title-main">Abstract polytope</span> Poset representing certain properties of a polytope

In mathematics, an abstract polytope is an algebraic partially ordered set which captures the dyadic property of a traditional polytope without specifying purely geometric properties such as points and lines.

<span class="mw-page-title-main">Heawood graph</span> Undirected graph with 14 vertices

In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.

<span class="mw-page-title-main">Levi graph</span>

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.

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. Such fundamental results remain valid when additional concepts are added to form a richer geometry. It sometimes happens that authors blur the distinction between a study and the objects of that study, so it is not surprising to find that some authors refer to incidence structures as incidence geometries.

In projective geometry, a collineation is a one-to-one and onto map from one projective space to another, or from a projective space to itself, such that the images of collinear points are themselves collinear. A collineation is thus an isomorphism between projective spaces, or an automorphism from a projective space to itself. Some authors restrict the definition of collineation to the case where it is an automorphism. The set of all collineations of a space to itself form a group, called the collineation group.

<span class="mw-page-title-main">Hoffman–Singleton graph</span> 7-regular undirected graph with 50 nodes and 175 edges

In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1). It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist. Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage.

<span class="mw-page-title-main">Coxeter graph</span> Type of graph

In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter.

Kirkman's schoolgirl problem is a problem in combinatorics proposed by Thomas Penyngton Kirkman in 1850 as Query VI in The Lady's and Gentleman's Diary (pg.48). The problem states:

Fifteen young ladies in a school walk out three abreast for seven days in succession: it is required to arrange them daily so that no two shall walk twice abreast.

<span class="mw-page-title-main">Lie sphere geometry</span> Geometry founded on spheres

Lie sphere geometry is a geometrical theory of planar or spatial geometry in which the fundamental concept is the circle or sphere. It was introduced by Sophus Lie in the nineteenth century. The main idea which leads to Lie sphere geometry is that lines should be regarded as circles of infinite radius and that points in the plane should be regarded as circles of zero radius.

<span class="mw-page-title-main">Galois geometry</span>

Galois geometry is the branch of finite geometry that is concerned with algebraic and analytic geometry over a finite field. More narrowly, a Galois geometry may be defined as a projective space over a finite field.

A frequently studied problem in finite geometry is to identify ways in which an object can be covered by other simpler objects such as points, lines, and planes. In projective geometry, a specific instance of this problem that has numerous applications is determining whether, and how, a projective space can be covered by pairwise disjoint subspaces which have the same dimension; such a partition is called a spread. Specifically, a spread of a projective space , where is an integer and a division ring, is a set of -dimensional subspaces, for some such that every point of the space lies in exactly one of the elements of the spread.

References