HOME
*





Hill Tetrahedron
In geometry, the Hill tetrahedra are a family of space-filling tetrahedra. They were discovered in 1896 by M. J. M. Hill, a professor of mathematics at the University College London, who showed that they are scissor-congruent to a cube. Construction For every \alpha \in (0,2\pi/3), let v_1,v_2,v_3 \in \mathbb R^3 be three unit vectors with angle \alpha between every two of them. Define the ''Hill tetrahedron'' Q(\alpha) as follows: : Q(\alpha) \, = \, \. A special case Q=Q(\pi/2) is the tetrahedron having all sides right triangles, two with sides (1,1,\sqrt) and two with sides (1,\sqrt,\sqrt). Ludwig Schläfli studied Q as a special case of the orthoscheme, and H. S. M. Coxeter called it the characteristic tetrahedron of the cubic spacefilling. Properties * A cube can be tiled with six copies of Q. * Every Q(\alpha) can be dissected into three polytopes which can be reassembled into a prism. Generalizations In 1951 Hugo Hadwiger found the following ''n''-dime ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geome ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Schläfli Orthoscheme
In geometry, a Schläfli orthoscheme is a type of simplex. The orthoscheme is the generalization of the right triangle to simplex figures of any number of dimensions. Orthoschemes are defined by a sequence of edges (v_0v_1), (v_1v_2), \dots, (v_v_d) \, that are mutually orthogonal. They were introduced by Ludwig Schläfli, who called them ''orthoschemes'' and studied their volume in Euclidean, hyperbolic, and spherical geometries. H. S. M. Coxeter later named them after Schläfli. As right triangles provide the basis for trigonometry, orthoschemes form the basis of a trigonometry of ''n'' dimensions, as developed by Schoute who called it polygonometry. J.-P. Sydler and Børge Jessen studied orthoschemes extensively in connection with Hilbert's third problem. Orthoschemes, also called path-simplices in the applied mathematics literature, are a special case of a more general class of simplices studied by Fiedler, and later rediscovered by Coxeter. These simplices are the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Neil Sloane
__NOTOC__ Neil James Alexander Sloane (born October 10, 1939) is a British-American mathematician. His major contributions are in the fields of combinatorics, error-correcting codes, and sphere packing. Sloane is best known for being the creator and maintainer of the On-Line Encyclopedia of Integer Sequences (OEIS). Biography Sloane was born in Beaumaris, Anglesey, Wales, in 1939, moving to Cowes, Isle of Wight, England in 1946. The family emigrated to Australia, arriving at the start of 1949. Sloane then moved from Melbourne to the United States in 1961. He studied at Cornell University under Nick DeClaris, Frank Rosenblatt, Frederick Jelinek and Wolfgang Heinrich Johannes Fuchs, receiving his Ph.D. in 1967. His doctoral dissertation was titled ''Lengths of Cycle Times in Random Artificial neural network, Neural Networks''. Sloane joined AT&T Bell Labs in 1968 and retired from AT&T Labs in 2012. He became an AT&T Fellow in 1998. He is also a Fellow of the Learned Society of Wal ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Hypercube
In geometry, a hypercube is an ''n''-dimensional analogue of a square () and a cube (). It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in ''n'' dimensions is equal to \sqrt. An ''n''-dimensional hypercube is more commonly referred to as an ''n''-cube or sometimes as an ''n''-dimensional cube. The term measure polytope (originally from Elte, 1912) is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. The hypercube is the special case of a hyperrectangle (also called an ''n-orthotope''). A ''unit hypercube'' is a hypercube whose side has length one unit. Often, the hypercube whose corners (or ''vertices'') are the 2''n'' points in R''n'' with each coordinate equal to 0 or 1 is called ''the'' unit hypercube. Construction A hype ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a ''k''-simplex is a ''k''-dimensional polytope which is the convex hull of its ''k'' + 1 vertices. More formally, suppose the ''k'' + 1 points u_0, \dots, u_k \in \mathbb^ are affinely independent, which means u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points : C = \left\ This representation in terms of weighted vertices is known as the barycentric coordinate system. A regular simplex is a simplex that is also a regular poly ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Hugo Hadwiger
Hugo Hadwiger (23 December 1908 in Karlsruhe, Germany – 29 October 1981 in Bern, Switzerland) was a Swiss mathematician, known for his work in geometry, combinatorics, and cryptography. Biography Although born in Karlsruhe, Germany, Hadwiger grew up in Bern, Switzerland.. He did his undergraduate studies at the University of Bern, where he majored in mathematics but also studied physics and actuarial science. He continued at Bern for his graduate studies, and received his Ph.D. in 1936 under the supervision of Willy Scherrer. He was for more than forty years a professor of mathematics at Bern. Mathematical concepts named after Hadwiger Hadwiger's theorem in integral geometry classifies the isometry-invariant valuations on compact convex sets in ''d''-dimensional Euclidean space. According to this theorem, any such valuation can be expressed as a linear combination of the intrinsic volumes; for instance, in two dimensions, the intrinsic volumes are the area, the perimete ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Prism (geometry)
In geometry, a prism is a polyhedron comprising an polygon base, a second base which is a translated copy (rigidly moved without rotation) of the first, and other faces, necessarily all parallelograms, joining corresponding sides of the two bases. All cross-sections parallel to the bases are translations of the bases. Prisms are named after their bases, e.g. a prism with a pentagonal base is called a pentagonal prism. Prisms are a subclass of prismatoids. Like many basic geometric terms, the word ''prism'' () was first used in Euclid's Elements. Euclid defined the term in Book XI as “a solid figure contained by two opposite, equal and parallel planes, while the rest are parallelograms”. However, this definition has been criticized for not being specific enough in relation to the nature of the bases, which caused confusion among later geometry writers. Oblique prism An oblique prism is a prism in which the joining edges and faces are ''not perpendicular'' to the base ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dissection (geometry)
In geometry, a dissection problem is the problem of partitioning a geometric figure (such as a polytope or ball) into smaller pieces that may be rearranged into a new figure of equal content. In this context, the partitioning is called simply a dissection (of one polytope into another). It is usually required that the dissection use only a finite number of pieces. Additionally, to avoid set-theoretic issues related to the Banach–Tarski paradox and Tarski's circle-squaring problem, the pieces are typically required to be well-behaved. For instance, they may be restricted to being the closures of disjoint open sets. The Bolyai–Gerwien theorem states that any polygon may be dissected into any other polygon of the same area, using interior-disjoint polygonal pieces. It is not true, however, that any polyhedron has a dissection into any other polyhedron of the same volume using polyhedral pieces (see Dehn invariant). This process ''is'' possible, however, for any two honeycomb ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ludwig Schläfli
Ludwig Schläfli (15 January 1814 – 20 March 1895) was a Swiss mathematician, specialising in geometry and complex analysis (at the time called function theory) who was one of the key figures in developing the notion of higher-dimensional spaces. The concept of multidimensionality is pervasive in mathematics, has come to play a pivotal role in physics, and is a common element in science fiction. Life and career Youth and education Ludwig spent most of his life in Switzerland. He was born in Grasswil (now part of Seeberg), his mother's hometown. The family then moved to the nearby Burgdorf, where his father worked as a tradesman. His father wanted Ludwig to follow in his footsteps, but Ludwig was not cut out for practical work. In contrast, because of his mathematical gifts, he was allowed to attend the Gymnasium in Bern in 1829. By that time he was already learning differential calculus from Abraham Gotthelf Kästner's ''Mathematische Anfangsgründe der Analysis des Unendli ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Space-filling Polyhedron
In geometry, a space-filling polyhedron is a polyhedron that can be used to fill all of three-dimensional space via translations, rotations and/or reflections, where ''filling'' means that, taken together, all the instances of the polyhedron constitute a partition of three-space. Any periodic tiling or honeycomb of three-space can in fact be generated by translating a primitive cell polyhedron. Any parallelepiped tessellates Eucledian 3-space, and more specifically any of five parallelohedra such as the rhombic dodecahedron, which is one of nine edge-transitive and face-transitive solids. Examples of other space-filling polyhedra include the set of five convex polyhedra with regular faces, which include the triangular prism, hexagonal prism, gyrobifastigium, cube In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. Viewed from a corner it is a hexagon and its net is usually depicted ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cube
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. Viewed from a corner it is a hexagon and its net is usually depicted as a cross. The cube is the only regular hexahedron and is one of the five Platonic solids. It has 6 faces, 12 edges, and 8 vertices. The cube is also a square parallelepiped, an equilateral cuboid and a right rhombohedron a 3-zonohedron. It is a regular square prism in three orientations, and a trigonal trapezohedron in four orientations. The cube is dual to the octahedron. It has cubical or octahedral symmetry. The cube is the only convex polyhedron whose faces are all squares. Orthogonal projections The ''cube'' has four special orthogonal projections, centered, on a vertex, edges, face and normal to its vertex figure. The first and third correspond to the A2 and B2 Coxeter planes. Spherical tiling The cube can also be represented as a spherical tiling, and p ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Hilbert's Third Problem
The third of Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces which can be reassembled to yield the second? Based on earlier writings by Carl Friedrich Gauss, David Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample. The answer for the analogous question about polygons in 2 dimensions is "yes" and had been known for a long time; this is the Wallace–Bolyai–Gerwien theorem. Unknown to Hilbert and Dehn, Hilbert's third problem was also proposed independently by Władysław Kretkowski for a math contest of 1882 by the Academy of Arts and Sciences of Kraków, and was solved by Ludwik Antoni Birkenmajer with a different method than Dehn. Birk ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]