|
Gram–Euler Theorem
In geometry, the Gram–Euler theorem, Gram-Sommerville, Brianchon-Gram or Gram relation (named after Jørgen Pedersen Gram, Leonhard Euler, Duncan Sommerville and Charles Julien Brianchon) is a generalization of the internal angle sum formula of polygons to higher-dimensional polytopes. The equation constrains the sums of the interior angles of a polytope in a manner analogous to the Euler relation on the number of d-dimensional faces. Statement Let P be an n-dimensional convex polytope. For each ''k''-face F, with k = \dim(F) its dimension (0 for vertices, 1 for edges, 2 for faces, etc., up to ''n'' for ''P'' itself), its interior (higher-dimensional) solid angle \angle(F) is defined by choosing a small enough (n - 1)-sphere centered at some point in the interior of F and finding the surface area contained inside P. Then the Gram–Euler theorem states: \sum_ (-1)^ \angle(F) = 0In non-Euclidean geometry of constant curvature (i.e. spherical, \epsilon = 1, and hyperbolic, \eps ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Geometry
In mathematics, hyperbolic geometry (also called Lobachevskian geometry or János Bolyai, Bolyai–Nikolai Lobachevsky, Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: :For any given line ''R'' and point ''P'' not on ''R'', in the plane containing both line ''R'' and point ''P'' there are at least two distinct lines through ''P'' that do not intersect ''R''. (Compare the above with Playfair's axiom, the modern version of Euclid's parallel postulate.) The hyperbolic plane is a plane (mathematics), plane where every point is a saddle point. Hyperbolic plane geometry is also the geometry of pseudosphere, pseudospherical surfaces, surfaces with a constant negative Gaussian curvature. Saddle surfaces have negative Gaussian curvature in at least some regions, where they local property, locally resemble the hyperbolic plane. The hyperboloid model of hyperbolic geometry provides a representation of event (relativity ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polytopes
In elementary geometry, a polytope is a geometric object with Flat (geometry), flat sides (''Face (geometry), faces''). Polytopes are the generalization of three-dimensional polyhedron, polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions as an -dimensional polytope or -polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a -polytope consist of -polytopes that may have -polytopes in common. Some theories further generalize the idea to include such objects as unbounded apeirotopes and tessellations, decompositions or tilings of curved manifolds including spherical polyhedra, and set-theoretic abstract polytopes. Polytopes of more than three dimensions were first discovered by Ludwig Schläfli before 1853, who called such a figure a polyschem. The German language, German term ''Polytop'' was coined by the mathematician Re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Angular Defect
In geometry, the angular defect or simply defect (also called deficit or deficiency) is the failure of some angles to add up to the expected amount of 360° or 180°, when such angles in the Euclidean plane would. The opposite notion is the ''excess''. Classically the defect arises in two contexts: in the Euclidean plane, angles about a point add up to 360°, while interior angles in a triangle add up to 180°. However, on a convex polyhedron, the angles of the faces meeting at a vertex add up to ''less'' than 360° (a defect), while the angles at some vertices of a nonconvex polyhedron may add up to ''more'' than 360° (an excess). Also the angles in a hyperbolic triangle add up to ''less'' than 180° (a defect), while those on a spherical triangle add up to ''more'' than 180° (an excess). In modern terms, the defect at a vertex is a discrete version of the curvature of the polyhedral surface concentrated at that point. Negative defect indicates that the vertex resembles a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dehn–Sommerville Equations
In mathematics, the Dehn–Sommerville equations are a complete set of linear relations between the numbers of faces of different dimension of a simplicial polytope. For polytopes of dimension 4 and 5, they were found by Max Dehn in 1905. Their general form was established by Duncan Sommerville in 1927. The Dehn–Sommerville equations can be restated as a symmetry condition for the ''h''-vector of the simplicial polytope and this has become the standard formulation in recent combinatorics literature. By duality, analogous equations hold for simple polytopes. Statement Let ''P'' be a ''d''-dimensional simplicial polytope. For ''i'' = 0, 1, ..., ''d'' − 1, let ''f''''i'' denote the number of ''i''-dimensional faces of ''P''. The sequence : f(P)=(f_0,f_1,\ldots,f_) is called the ''f''-vector of the polytope ''P''. Additionally, set : f_=1, f_d=1. Then for any ''k'' = −1, 0, ..., ''d'' − 2, the following Dehn–Sommerville equation ho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Branko Grünbaum
Branko Grünbaum (; 2 October 1929 – 14 September 2018) was a Croatian-born mathematician of Jewish descentBranko Grünbaum Hrvatska enciklopedija LZMK. and a professor at the in . He received his Ph.D. in 1957 from Hebrew University of Jerusalem. Life< ...
|
Spherical Lune
In spherical geometry, a spherical lune (or biangle) is an area on a sphere bounded by two half great circles which meet at antipodal points. It is an example of a digon, θ, with dihedral angle θ. The word "lune" derives from ''Luna (goddess), luna'', the Latin language, Latin word for Moon. Properties Great circles are the largest possible circles (circumferences) of a sphere; each one divides the surface of the sphere into two equal halves. Two great circles always intersect at two polar opposite points. Common examples of great circles are lines of longitude (''meridians'') on a sphere, which meet at the north and south poles. A spherical lune has two planes of symmetry. It can be bisected into two lunes of half the angle, or it can be bisected by an equatorial line into two right spherical triangles. Surface area The surface area of a spherical lune is 2θ ''R''2, where ''R'' is the radius of the sphere and θ is the dihedral angle in radians between the two half gr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedron
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal Face (geometry), faces, straight Edge (geometry), edges and sharp corners or Vertex (geometry), vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface (mathematics), surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure (mathematics), structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Eule ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spherical Excess
Spherical trigonometry is the branch of spherical geometry that deals with the metrical relationships between the sides and angles of spherical triangles, traditionally expressed using trigonometric functions. On the sphere, geodesics are great circles. Spherical trigonometry is of great importance for calculations in astronomy, geodesy, and navigation. The origins of spherical trigonometry in Greek mathematics and the major developments in Islamic mathematics are discussed fully in History of trigonometry and Mathematics in medieval Islam. The subject came to fruition in Early Modern times with important developments by John Napier, Delambre and others, and attained an essentially complete form by the end of the nineteenth century with the publication of Todhunter's textbook ''Spherical trigonometry for the use of colleges and Schools''. Since then, significant developments have been the application of vector methods, quaternion methods, and the use of numerical methods. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygon
In geometry, a polygon () is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' or ''corners''. An ''n''-gon is a polygon with ''n'' sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain. A simple polygon is the boundary of a region of the plane that is called a ''solid polygon''. The interior of a solid polygon is its ''body'', also known as a ''polygonal region'' or ''polygonal area''. In contexts where one is concerned only with simple and solid polygons, a ''polygon'' may refer only to a simple polygon or to a solid polygon. A polygonal chain may cross over itself, creating star polyg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
