|
Alexandrov's Uniqueness Theorem
The Alexandrov uniqueness theorem is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s. Statement of the theorem The surface of any convex polyhedron in Euclidean space forms a metric space, in which the distance between two points is measured by the length of the shortest path from one point to the other along the surface. Within a single shortest path, distances between pairs of points equal the distances between corresponding points of a line segment of the same length; a path with this property is known as a geodesic. This property of polyhedral surfaces, that every pair ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rigidity (mathematics)
In mathematics, a rigid collection ''C'' of mathematical objects (for instance sets or functions) is one in which every ''c'' ∈ ''C'' is uniquely determined by less information about ''c'' than one would expect. The above statement does not define a mathematical property. Instead, it describes in what sense the adjective rigid is typically used in mathematics, by mathematicians. __FORCETOC__ Examples Some examples include: #Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values. #Holomorphic functions are determined by the set of all derivatives at a single point. A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane. The Schwarz lemma is an example of such a rigidity theorem. #By the fu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gauss–Bonnet Theorem
In the mathematical field of differential geometry, the Gauss–Bonnet theorem (or Gauss–Bonnet formula) is a fundamental formula which links the curvature of a surface to its underlying topology. In the simplest application, the case of a triangle on a plane, the sum of its angles is 180 degrees. The Gauss–Bonnet theorem extends this to more complicated shapes and curved surfaces, connecting the local and global geometries. The theorem is named after Carl Friedrich Gauss, who developed a version but never published it, and Pierre Ossian Bonnet, who published a special case in 1848. Statement Suppose is a compact two-dimensional Riemannian manifold with boundary . Let be the Gaussian curvature of , and let be the geodesic curvature of . Then :\int_M K\,dA+\int_k_g\,ds=2\pi\chi(M), \, where is the element of area of the surface, and is the line element along the boundary of . Here, is the Euler characteristic of . If the boundary is piecewise smooth, then ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Curvature
In differential geometry, the Gaussian curvature or Gauss curvature of a surface at a point is the product of the principal curvatures, and , at the given point: K = \kappa_1 \kappa_2. The Gaussian radius of curvature is the reciprocal of . For example, a sphere of radius has Gaussian curvature everywhere, and a flat plane and a cylinder have Gaussian curvature zero everywhere. The Gaussian curvature can also be negative, as in the case of a hyperboloid or the inside of a torus. Gaussian curvature is an ''intrinsic'' measure of curvature, depending only on distances that are measured “within” or along the surface, not on the way it is isometrically embedding, embedded in Euclidean space. This is the content of the ''Theorema egregium''. Gaussian curvature is named after Carl Friedrich Gauss, who published the ''Theorema egregium'' in 1827. Informal definition At any point on a surface, we can find a Normal (geometry), normal vector that is at right angles to the sur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemannian Manifold
In differential geometry, a Riemannian manifold or Riemannian space , so called after the German mathematician Bernhard Riemann, is a real manifold, real, smooth manifold ''M'' equipped with a positive-definite Inner product space, inner product ''g''''p'' on the tangent space ''T''''p''''M'' at each point ''p''. The family ''g''''p'' of inner products is called a metric tensor, Riemannian metric (or Riemannian metric tensor). Riemannian geometry is the study of Riemannian manifolds. A common convention is to take ''g'' to be Smoothness, smooth, which means that for any smooth coordinate chart on ''M'', the ''n''2 functions :g\left(\frac,\frac\right):U\to\mathbb are smooth functions. These functions are commonly designated as g_. With further restrictions on the g_, one could also consider Lipschitz continuity, Lipschitz Riemannian metrics or Measurable function, measurable Riemannian metrics, among many other possibilities. A Riemannian metric (tensor) makes it possible to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structural Rigidity
In discrete geometry and mechanics, structural rigidity is a combinatorial theory for predicting the flexibility of ensembles formed by rigid bodies connected by flexible linkages or hinges. Definitions Rigidity is the property of a structure that it does not bend or flex under an applied force. The opposite of rigidity is flexibility. In structural rigidity theory, structures are formed by collections of objects that are themselves rigid bodies, often assumed to take simple geometric forms such as straight rods (line segments), with pairs of objects connected by flexible hinges. A structure is rigid if it cannot flex; that is, if there is no continuous motion of the structure that preserves the shape of its rigid components and the pattern of their connections at the hinges. There are two essentially different kinds of rigidity. Finite or macroscopic rigidity means that the structure will not flex, fold, or bend by a positive amount. Infinitesimal rigidity means that the st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Max Dehn
Max Wilhelm Dehn (November 13, 1878 – June 27, 1952) was a German mathematician most famous for his work in geometry, topology and geometric group theory. Born to a Jewish family in Germany, Dehn's early life and career took place in Germany. However, he was forced to retire in 1935 and eventually fled Germany in 1939 and emigrated to the United States. Dehn was a student of David Hilbert, and in his habilitation in 1900 Dehn resolved Hilbert's third problem, making him the first to resolve one of Hilbert's well-known 23 problems. Dehn's students include Ott-Heinrich Keller, Ruth Moufang, Wilhelm Magnus, and the artists Dorothea Rockburne and Ruth Asawa. Biography Dehn was born to a family of Jewish origin in Hamburg, Imperial Germany. He studied the foundations of geometry with Hilbert at Göttingen in 1899, and obtained a proof of the Jordan curve theorem for polygons. In 1900 he wrote his dissertation on the role of the Legendre angle sum theorem in axiomatic geome ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cauchy's Theorem (geometry)
Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy. It states that convex polytopes in three dimensions with congruent corresponding faces must be congruent to each other. That is, any polyhedral net formed by unfolding the faces of the polyhedron onto a flat surface, together with gluing instructions describing which faces should be connected to each other, uniquely determines the shape of the original polyhedron. For instance, if six squares are connected in the pattern of a cube, then they must form a cube: there is no convex polyhedron with six square faces connected in the same way that does not have the same shape. This is a fundamental result in rigidity theory: one consequence of the theorem is that, if one makes a physical model of a convex polyhedron by connecting together rigid plates for each of the polyhedron faces with flexible hinges along the polyhedron edges, then this ensemble of plates and hinges will necessarily form a rigid structure. Stat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pseudo-polynomial Time
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the ''numeric value'' of the input (the largest integer present in the input)—but not necessarily in the ''length'' of the input (the number of bits required to represent it), which is the case for polynomial time algorithms. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979. In general, the numeric value of the input is exponential in the input length, which is why a pseudo-polynomial time algorithm does not necessarily run in polynomial time with respect to the input length. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete. An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless . The strong/weak kinds of NP-hardness are defined anal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Icosahedron
In geometry, a regular icosahedron ( or ) is a convex polyhedron with 20 faces, 30 edges and 12 vertices. It is one of the five Platonic solids, and the one with the most faces. It has five equilateral triangular faces meeting at each vertex. It is represented by its Schläfli symbol , or sometimes by its vertex figure as 3.3.3.3.3 or 35. It is the dual of the regular dodecahedron, which is represented by , having three pentagonal faces around each vertex. In most contexts, the unqualified use of the word "icosahedron" refers specifically to this figure. A regular icosahedron is a strictly convex deltahedron and a gyroelongated pentagonal bipyramid and a biaugmented pentagonal antiprism in any of six orientations. The name comes . The plural can be either "icosahedrons" or "icosahedra" (). Dimensions If the edge length of a regular icosahedron is a, the radius of a circumscribed sphere (one that touches the icosahedron at all vertices) is r_u = \frac \sqrt = \frac \sqrt = a\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Icosahedron
In geometry, an icosahedron ( or ) is a polyhedron with 20 faces. The name comes and . The plural can be either "icosahedra" () or "icosahedrons". There are infinitely many non- similar shapes of icosahedra, some of them being more symmetrical than others. The best known is the (convex, non- stellated) regular icosahedron—one of the Platonic solids—whose faces are 20 equilateral triangles. Regular icosahedra There are two objects, one convex and one nonconvex, that can both be called regular icosahedra. Each has 30 edges and 20 equilateral triangle faces with five meeting at each of its twelve vertices. Both have icosahedral symmetry. The term "regular icosahedron" generally refers to the convex variety, while the nonconvex form is called a ''great icosahedron''. Convex regular icosahedron The convex regular icosahedron is usually referred to simply as the ''regular icosahedron'', one of the five regular Platonic solids, and is represented by its Schläfli symbol , con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedron
A dihedron is a type of polyhedron, made of two polygon faces which share the same set of ''n'' edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(''p'',''q''). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons. As a spherical tiling, a dihedron can exist as nondegenerate form, with two ''n''-sided faces covering the sphere, each face being a hemisphere, and vertices on a great circle. It is regular if the vertices are equally spaced. The dual of an ''n''-gonal dihedron is an ''n''-gonal hosohedron, where ''n'' digon faces share two vertices. As a flat-faced polyhedron A dihedron can be considered a degenerate prism whose two (planar) ''n''-sided polygon bases are connected "back-to-back", so that the resulting object has no depth. The polygons must b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
