|
Möbius–Kantor Graph
In the mathematics, mathematical field of graph theory, the Möbius–Kantor graph is a symmetric graph, symmetric bipartite graph, bipartite cubic graph with 16 vertices and 24 edges named after August Ferdinand Möbius and Seligmann Kantor. It can be defined as the generalized Petersen graph ''G''(8,3): that is, it is formed by the vertices of an octagon, connected to the vertices of an eight-point star in which each point of the star is connected to the points three steps away from it (an octagram). Möbius–Kantor configuration asked whether there exists a pair of polygons with ''p'' sides each, having the property that the vertices of one polygon lie on the lines through the edges of the other polygon, and vice versa. If so, the vertices and edges of these polygons would form a projective configuration. For ''p'' = 4 there is no solution in the Euclidean plane, but found pairs of polygons of this type, for a generalization of the problem in which the points and edges bel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octagon
In geometry, an octagon () is an eight-sided polygon or 8-gon. A '' regular octagon'' has Schläfli symbol and can also be constructed as a quasiregular truncated square, t, which alternates two types of edges. A truncated octagon, t is a hexadecagon, . A 3D analog of the octagon can be the rhombicuboctahedron with the triangular faces on it like the replaced edges, if one considers the octagon to be a truncated square. Properties The sum of all the internal angles of any octagon is 1080°. As with all polygons, the external angles total 360°. If squares are constructed all internally or all externally on the sides of an octagon, then the midpoints of the segments connecting the centers of opposite squares form a quadrilateral that is both equidiagonal and orthodiagonal (that is, whose diagonals are equal in length and at right angles to each other).Dao Thanh Oai (2015), "Equilateral triangles and Kiepert perspectors in complex numbers", ''Forum Geometricorum'' 15, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercube Graph
In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube. For instance, the cubical graph, cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has vertex (graph theory), vertices, edges, and is a regular graph with edges touching each vertex. The hypercube graph may also be constructed by creating a vertex for each subset of an -element set, with two vertices adjacent when their subsets differ in a single element, or by creating a vertex for each -digit binary number, with two vertices adjacent when their binary representations differ in a single digit. It is the -fold Cartesian product of graphs, Cartesian product of the two-vertex complete graph, and may be decomposed into two copies of connected to each other by a perfect matching. Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex. The only hyperc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Glossary Of Graph Theory
This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges. Symbols A B C D E F G H I J K L M ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hesse Configuration
In geometry, the Hesse configuration is a configuration of 9 points and 12 lines with three points per line and four lines through each point. It can be denoted as (94 123) or configuration matrix \left begin9 & 4 \\ 3 & 12 \\ \end\right /math>. It is symmetric (point and line transitive) with 432 automorphisms. It can be realized in the complex projective plane as the set of inflection points of an elliptic curve, but it has no realization in the Euclidean plane. It was introduced by Colin Maclaurin and studied by , and is also known as Young's geometry, named after the later work of John Wesley Young on finite geometry. Description The Hesse configuration has the same incidence relations as the lines and points of the affine plane over the field of 3 elements. That is, the points of the Hesse configuration may be identified with ordered pairs of numbers modulo 3, and the lines of the configuration may correspondingly be identified with the triples of points satisfying a lin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coset
In mathematics, specifically group theory, a subgroup of a group may be used to decompose the underlying set of into disjoint, equal-size subsets called cosets. There are ''left cosets'' and ''right cosets''. Cosets (both left and right) have the same number of elements (cardinality) as does . Furthermore, itself is both a left coset and a right coset. The number of left cosets of in is equal to the number of right cosets of in . This common value is called the index of in and is usually denoted by . Cosets are a basic tool in the study of groups; for example, they play a central role in Lagrange's theorem that states that for any finite group , the number of elements of every subgroup of divides the number of elements of . Cosets of a particular type of subgroup (a normal subgroup) can be used as the elements of another group called a quotient group or factor group. Cosets also appear in other areas of mathematics such as vector spaces and error-correcting code ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abelian Group
In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after the Norwegian mathematician Niels Henrik Abel. The concept of an abelian group underlies many fundamental algebraic structures, such as fields, rings, vector spaces, and algebras. The theory of abelian groups is generally simpler than that of their non-abelian counterparts, and finite abelian groups are very well understood and fully classified. Definition An abelian group is a set A, together with an operation ･ , that combines any two elements a and b of A to form another element of A, denoted a \cdot b. The sym ... [...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] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature, "imaginary" complex numbers have a mathematical existence as firm as that of the real numbers, and they are fundamental tools in the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or complex coefficie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Projective Plane
In mathematics, the complex projective plane, usually denoted or is the two-dimensional complex projective space. It is a complex manifold of complex dimension 2, described by three complex coordinates :(Z_1,Z_2,Z_3) \in \C^3, \qquad (Z_1,Z_2,Z_3)\neq (0,0,0) where, however, the triples differing by an overall rescaling are identified: :(Z_1,Z_2,Z_3) \equiv (\lambda Z_1,\lambda Z_2, \lambda Z_3); \quad \lambda \in \C, \qquad \lambda \neq 0. That is, these are homogeneous coordinates in the traditional sense of projective geometry. Topology The Betti numbers of the complex projective plane are :1, 0, 1, 0, 1, 0, 0, ..... The middle dimension 2 is accounted for by the homology class of the complex projective line, or Riemann sphere, lying in the plane. The nontrivial homotopy groups of the complex projective plane are \pi_2=\pi_5=\mathbb. The fundamental group is trivial and all other higher homotopy groups are those of the 5-sphere, i.e. torsion. Algebraic geometry In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Plane
In mathematics, a Euclidean plane is a Euclidean space of Two-dimensional space, dimension two, denoted \textbf^2 or \mathbb^2. It is a geometric space in which two real numbers are required to determine the position (geometry), position of each point (mathematics), point. It is an affine space, which includes in particular the concept of parallel lines. It has also measurement, metrical properties induced by a Euclidean distance, distance, which allows to define circles, and angle, angle measurement. A Euclidean plane with a chosen Cartesian coordinate system is called a ''Cartesian plane''. The set \mathbb^2 of the ordered pairs of real numbers (the real coordinate plane), equipped with the dot product, is often called ''the'' Euclidean plane or ''standard Euclidean plane'', since every Euclidean plane is isomorphic to it. History Books I through IV and VI of Euclid's Elements dealt with two-dimensional geometry, developing such notions as similarity of shapes, the Pythagor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Configuration
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 ge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
