Faster access than browser!
26 relations: Algebraic topology, Characteristic class, Complete graph, Convex hull, Convex polytope, Coxeter–Dynkin diagram, Equilateral triangle, Facet (geometry), Graph (discrete mathematics), Hyperplane, Johnson graph, Matroid polytope, Octahedron, Polyhedral combinatorics, Rectification (geometry), Rectified 5-cell, Rectified 5-simplexes, Schläfli symbol, Simplex, Tetrahedron, Turán graph, Uniform matroid, Uniform polytope, Vector (mathematics and physics), 5-cell, 5-simplex.
Algebraic topology
Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.
New!!: Hypersimplex and Algebraic topology · See more »
Characteristic class
In mathematics, a characteristic class is a way of associating to each principal bundle X a cohomology class of X. The cohomology class measures the extent the bundle is "twisted" — and whether it possesses sections.
New!!: Hypersimplex and Characteristic class · See more »
Complete graph
No description.
New!!: Hypersimplex and Complete graph · See more »
Convex hull
In mathematics, the convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X., p. 3.
New!!: Hypersimplex and Convex hull · See more »
Convex polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn.
New!!: Hypersimplex and Convex polytope · See more »
Coxeter–Dynkin diagram
In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes).
New!!: Hypersimplex and Coxeter–Dynkin diagram · See more »
Equilateral triangle
In geometry, an equilateral triangle is a triangle in which all three sides are equal.
New!!: Hypersimplex and Equilateral triangle · See more »
Facet (geometry)
In geometry, a facet is a feature of a polyhedron, polytope, or related geometric structure, generally of dimension one less than the structure itself.
New!!: Hypersimplex and Facet (geometry) · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Hypersimplex and Graph (discrete mathematics) · See more »
Hyperplane
In geometry, a hyperplane is a subspace whose dimension is one less than that of its ambient space.
New!!: Hypersimplex and Hyperplane · See more »
Johnson graph
Johnson graphs are a special class of undirected graphs defined from systems of sets.
New!!: Hypersimplex and Johnson graph · See more »
Matroid polytope
In mathematics, a matroid polytope, also called a matroid basis polytope (or basis matroid polytope) to distinguish it from other polytopes derived from a matroid, is a polytope constructed via the bases of a matroid.
New!!: Hypersimplex and Matroid polytope · See more »
Octahedron
In geometry, an octahedron (plural: octahedra) is a polyhedron with eight faces, twelve edges, and six vertices.
New!!: Hypersimplex and Octahedron · See more »
Polyhedral combinatorics
Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.
New!!: Hypersimplex and Polyhedral combinatorics · See more »
Rectification (geometry)
In Euclidean geometry, rectification or complete-truncation is the process of truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points.
New!!: Hypersimplex and Rectification (geometry) · See more »
Rectified 5-cell
In four-dimensional geometry, the rectified 5-cell is a uniform 4-polytope composed of 5 regular tetrahedral and 5 regular octahedral cells.
New!!: Hypersimplex and Rectified 5-cell · See more »
Rectified 5-simplexes
In five-dimensional geometry, a rectified 5-simplex is a convex uniform 5-polytope, being a rectification of the regular 5-simplex.
New!!: Hypersimplex and Rectified 5-simplexes · See more »
Schläfli symbol
In geometry, the Schläfli symbol is a notation of the form that defines regular polytopes and tessellations.
New!!: Hypersimplex and Schläfli symbol · See more »
Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions.
New!!: Hypersimplex and Simplex · See more »
Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners.
New!!: Hypersimplex and Tetrahedron · See more »
Turán graph
No description.
New!!: Hypersimplex and Turán graph · See more »
Uniform matroid
In mathematics, a uniform matroid is a matroid in which every permutation of the elements is a symmetry.
New!!: Hypersimplex and Uniform matroid · See more »
Uniform polytope
A uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets.
New!!: Hypersimplex and Uniform polytope · See more »
Vector (mathematics and physics)
When used without any further description, vector usually refers either to.
New!!: Hypersimplex and Vector (mathematics and physics) · See more »
5-cell
In geometry, the 5-cell is a four-dimensional object bounded by 5 tetrahedral cells.
New!!: Hypersimplex and 5-cell · See more »
5-simplex
In five-dimensional geometry, a 5-simplex is a self-dual regular 5-polytope.
New!!: Hypersimplex and 5-simplex · See more »
References
[1] https://en.wikipedia.org/wiki/Hypersimplex
