Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Simplicial polytope

In geometry, a simplicial polytope is a polytope whose facets are all simplices. For example, a simplicial polyhedron in three dimensions contains only triangular faces and corresponds via Steinitz's theorem to a maximal planar graph. They are topologically dual to simple polytopes. Polytopes which are both simple and simplicial are either simplices or two-dimensional polygons.

Source officielle

https://en.wikipedia.org/wiki/Simplicial_polytope

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Cours associés (1)

MATH-323: Topology III - Homology

Homology is one of the most important tools to study topological spaces and it plays an important role in many fields of mathematics. The aim of this course is to introduce this notion, understand its properties and learn how to compute it. There will be m ...

Publications associées (4)

Reduced representations of complexes, signals, and multifiltrations

Celia Camille Hacker

The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...

EPFL2022

Remarks on Schur's conjecture

János Pach, Filip Moric

Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...

Elsevier Science Bv2015

Extendability of Continuous Maps Is Undecidable

We consider two basic problems of algebraic topology: the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given topological space ...

Springer2014

Afficher plus

Source officielle

https://en.wikipedia.org/wiki/Simplicial_polytope

À propos de ce résultat

Cours associés (1)

MATH-323: Topology III - Homology

Publications associées (4)

Reduced representations of complexes, signals, and multifiltrations

Celia Camille Hacker

EPFL2022

Remarks on Schur's conjecture

János Pach, Filip Moric

Elsevier Science Bv2015

Extendability of Continuous Maps Is Undecidable

Springer2014

Afficher plus

Concepts associés (5)

Disphénoïde adouci

En géométrie, le disphénoïde adouci est un des solides de Johnson (J84). C'est un polyèdre qui possède seulement des faces formées de triangles équilatéraux, et est, par conséquent un deltaèdre. Ce n'est pas un polyèdre régulier car certains sommets ont quatre faces et d'autres en ont cinq. C'est un des solides de Johnson élémentaires qui n'apparaît pas à partir de manipulation en « copier/coller » de solides de Platon et de solides d'Archimèdes. Il a douze faces et constitue ainsi un exemple de dodécaèdre.

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. More specifically: In three-dimensional geometry, a facet of a polyhedron is any polygon whose corners are vertices of the polyhedron, and is not a face. To facet a polyhedron is to find and join such facets to form the faces of a new polyhedron; this is the reciprocal process to stellation and may also be applied to higher-dimensional polytopes.

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. Research in polyhedral combinatorics falls into two distinct areas. Mathematicians in this area study the combinatorics of polytopes; for instance, they seek inequalities that describe the relations between the numbers of vertices, edges, and faces of higher dimensions in arbitrary polytopes or in certain important subclasses of polytopes, and study other combinatorial properties of polytopes such as their connectivity and diameter (number of steps needed to reach any vertex from any other vertex).

Afficher plus