Polytopes | Permutations

Permutoassociahedron

In mathematics, the permutoassociahedron is an -dimensional polytope whose vertices correspond to the bracketings of the permutations of terms and whose edges connect two bracketings that can be obtained from one another either by moving a pair of brackets using associativity or by transposing two consecutive terms that are not separated by a bracket. The permutoassociahedron was first defined as a CW complex by Mikhail Kapranov who noted that this structure appears implicitly in Mac Lane's coherence theorem for symmetric and braided categories as well as in Vladimir Drinfeld's work on the Knizhnik–Zamolodchikov equations. It was constructed as a convex polytope by Victor Reiner and Günter M. Ziegler. (Wikipedia).

Permutoassociahedron
Video thumbnail

What is a concave polygon

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the difference between convex and concave

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the difference between convex and concave polygons

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What are four types of polygons

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the difference between concave and convex polygons

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

How to Construct a Dodecahedron

How the greeks constructed the Dodecahedron. Euclids Elements Book 13, Proposition 17. In geometry, a dodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. A regular dode

From playlist Platonic Solids

Video thumbnail

Regular polyhedra

This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/q0PF.

From playlist 3D printing

Video thumbnail

What is a net

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Sketch a net from a 3D figure

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Percolation

Bond percolation on a square lattice. Each edge of the lattice is open with probability p, independently of all others. p is varied from 0 to 1. For more details on the simulations, see http://www.univ-orleans.fr/mapmo/membres/berglund/ressim.html

From playlist Percolation

Related pages

CW complex | Catalan number | Permutation | Dodecagon | N-skeleton | Polytope | Associahedron | Permutohedron | Cyclohedron | Factorial | Knizhnik–Zamolodchikov equations | Flip graph | Coherency (homotopy theory) | Transposition (mathematics) | Category (mathematics) | Simple polytope