|
Pappus Hexagon Theorem
In mathematics, Pappus's hexagon theorem (attributed to Pappus of Alexandria) states that *given one set of collinear points A, B, C, and another set of collinear points a,b,c, then the intersection points X,Y,Z of line pairs Ab and aB, Ac and aC, Bc and bC are collinear, lying on the ''Pappus line''. These three points are the points of intersection of the "opposite" sides of the hexagon AbCaBc. It holds in a projective plane over any field, but fails for projective planes over any noncommutative division ring. Projective planes in which the "theorem" is valid are called pappian planes. If one considers a pappian plane containing a hexagon as just described but with sides Ab and aB parallel and also sides Bc and bC parallel (so that the Pappus line u is the line at infinity), one gets the ''affine version'' of Pappus's theorem shown in the second diagram. If the Pappus line u and the lines g,h have a point in common, one gets the so-called little version of Pappus's theore ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degenerate Conic
In geometry, a degenerate conic is a conic (a second-degree plane curve, defined by a polynomial equation of degree two) that fails to be an irreducible curve. This means that the defining equation is factorable over the complex numbers (or more generally over an algebraically closed field) as the product of two linear polynomials. Using the alternative definition of the conic as the intersection in three-dimensional space of a plane and a double cone, a conic is degenerate if the plane goes through the vertex of the cones. In the real plane, a degenerate conic can be two lines that may or may not be parallel, a single line (either two coinciding lines or the union of a line and the line at infinity), a single point (in fact, two complex conjugate lines), or the null set (twice the line at infinity or two parallel complex conjugate lines). All these degenerate conics may occur in pencils of conics. That is, if two real non-degenerated conics are defined by quadratic polynomi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Desarguesian
In projective geometry, Desargues's theorem, named after Girard Desargues, states: :Two triangles are in perspective ''axially'' if and only if they are in perspective ''centrally''. Denote the three vertices of one triangle by and , and those of the other by and . ''Axial perspectivity'' means that lines and meet in a point, lines and meet in a second point, and lines and meet in a third point, and that these three points all lie on a common line called the ''axis of perspectivity''. ''Central perspectivity'' means that the three lines and are concurrent, at a point called the ''center of perspectivity''. This intersection theorem is true in the usual Euclidean plane but special care needs to be taken in exceptional cases, as when a pair of sides are parallel, so that their "point of intersection" recedes to infinity. Commonly, to remove these exceptions, mathematicians "complete" the Euclidean plane by adding points at infinity, following Jean-Victor Poncelet. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gerhard Hessenberg
Gerhard Hessenberg (; 16 August 1874 – 16 November 1925) was a German mathematician who worked in projective geometry, differential geometry, and set theory. Career Hessenberg received his Ph.D. from the University of Berlin in 1899 under the guidance of Hermann Schwarz and Lazarus Fuchs. His name is usually associated with projective geometry, where he is known for proving that Desargues' theorem is a consequence of Pappus's hexagon theorem, and differential geometry where he is known for introducing the concept of a connection. He was also a set theorist: the Hessenberg sum and product of ordinals are named after him. However, Hessenberg matrices are named for Karl Hessenberg, a near relative. In 1908 Gerhard Hessenberg was an Invited Speaker of the International Congress of Mathematicians The International Congress of Mathematicians (ICM) is the largest conference for the topic of mathematics. It meets once every four years, hosted by the International Mathemati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance-regular Graph
In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and . Some authors exclude the complete graphs and disconnected graphs from this definition. Every distance-transitive graph is distance regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group. Intersection arrays The intersection array of a distance-regular graph is the array ( b_0, b_1, \ldots, b_; c_1, \ldots, c_d ) in which d is the diameter of the graph and for each 1 \leq j \leq d , b_j gives the number of neighbours of u at distance j+1 from v and c_j gives the number of neighbours of u at distance j - 1 from v for any pair of vertices u and v at dis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bipartite Graph
In the mathematics, mathematical field of graph theory, a bipartite graph (or bigraph) is a Graph (discrete mathematics), graph whose vertex (graph theory), vertices can be divided into two disjoint sets, disjoint and Independent set (graph theory), independent sets U and V, that is, every edge (graph theory), edge connects a Vertex (graph theory), vertex in U to one in V. Vertex sets U and V are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycle (graph theory), cycles. The two sets U and V may be thought of as a graph coloring, coloring of the graph with two colors: if one colors all nodes in U blue, and all nodes in V red, each edge has endpoints of differing colors, as is required in the graph coloring problem.. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a Gallery of named graphs, triangle: after one node is colored blue and another red, the third vertex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pappus Graph
In the mathematical field of graph theory, the Pappus graph is a bipartite, 3- regular, undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration. It is named after Pappus of Alexandria, an ancient Greek mathematician who is believed to have discovered the "hexagon theorem" describing the Pappus configuration. All the cubic, distance-regular graphs are known; the Pappus graph is one of the 13 such graphs. The Pappus graph has rectilinear crossing number 5, and is the smallest cubic graph with that crossing number . It has girth 6, diameter 4, radius 4, chromatic number 2, chromatic index 3 and is both 3- vertex-connected and 3- edge-connected. It has book thickness 3 and queue number 2. The Pappus graph has a chromatic polynomial equal to: (x-1)x(x^ - 26x^ + 325x^ - 2600x^ + 14950x^ - 65762x^ + 229852x^ - 653966x^9 + 1537363x^8 - 3008720x^7 + 4904386x^6 - 6609926x^5 + 7238770x^4 - 6236975x^3 + 3989074x^2 - 1690406x + 356509) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Levi Graph
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure.. See in particulap. 181 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. Conversely any bipartite graph with girth at least six can be viewed as the Levi graph of an abstract incidence structure. Levi graphs of configurations are biregular, and every biregular graph with girth at least six can be viewed as the Levi graph of an abstract configuration.. Levi graphs may also be defined for other types of incidence structure, such as the incidences between points and planes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duality (projective Geometry)
In projective geometry, duality or plane duality is a formalization of the striking symmetry of the roles played by Point (geometry), points and Line (geometry), lines in the definitions and theorems of projective planes. There are two approaches to the subject of duality, one through language () and the other a more functional approach through special Map (mathematics), mappings. These are completely equivalent and either treatment has as its starting point the axiomatic version of the geometries under consideration. In the functional approach there is a map between related geometries that is called a ''duality''. Such a map can be constructed in many ways. The concept of plane duality readily extends to ''space duality'' and beyond that to duality in any finite-dimensional projective geometry. Principle of duality A projective plane may be defined axiomatically as an incidence structure, in terms of a set of ''points'', a set of ''lines'', and an incidence relation that de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perspective (geometry)
Two figures in a plane are perspective from a point ''O'', called the center of perspectivity, if the lines joining corresponding points of the figures all meet at ''O''. Dually, the figures are said to be perspective from a line if the points of intersection of corresponding lines all lie on one line. The proper setting for this concept is in projective geometry where there will be no special cases due to parallel lines since all lines meet. Although stated here for figures in a plane, the concept is easily extended to higher dimensions. Terminology The line which goes through the points where the figure's corresponding sides intersect is known as the axis of perspectivity, perspective axis, homology axis, or archaically, perspectrix. The figures are said to be perspective from this axis. The point at which the lines joining the corresponding vertices of the perspective figures intersect is called the center of perspectivity, perspective center, homology center, pole, or arch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
