Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 468

Convex polytopes are the convex hulls of a finite set of points in Euclidean spaces. They have rich combinatorial, arithmetic, and metrical theory, and are related to toric varieties and to linear programming

1 vote

Growth polynomial of the Associahedron graph ? (Is it approximately Gaussian ?)

Let's consider the associahedron whose vertices are triangulations of an $n$-gon. Sleator, Tarjan, and Thurston (Rotation distance, triangulations, and hyperbolic geometry, JAMS, 1988) give a simple a …
Hugh Thomas's user avatar
  • 6,302
0 votes

Integral hull of a polyhedron Q is polyhedron

The righthand side is clearly contained in the lefthand side. We now want to show the lefthand side (i.e., $Q_I$) is contained in the righthand side. Since $Q_I$ is the convex hull of its lattice poin …
Hugh Thomas's user avatar
  • 6,302
5 votes
Accepted

Approximation of convex bodies by polytopes corresponding to smooth toric varieties

Yes. Let $\Sigma$ be the fan corresponding to $P$. Section 2.6 of Fulton's "Introduction to Toric Varieties" explains how to perform toric resolution of singularities on $\Sigma$ so as to produce a fa …
Hugh Thomas's user avatar
  • 6,302
5 votes
1 answer
310 views

Sufficient criterion for a simplicial sphere to be polytopal

Are there any purely combinatorial criteria which allow you to deduce that a spherical simplicial complex is polytopal (i.e., there exists a simplicial polytope whose boundary is isomorphic to it)? F …
Hugh Thomas's user avatar
  • 6,302
0 votes
Accepted

number of affine pieces of linear interpolation of convex functions in high dimension

Let's think of choosing the values of $f$ at the grid points one grid point at a time, in such a way that the result is convex. If you work systematically through the grid points in an order so t …
Hugh Thomas's user avatar
  • 6,302
1 vote

Positivity of Ehrhart polynomial coefficients

Proposition 4 of Morelli's paper "Pick's Theorem and the Todd class of a toric variety" gives a sufficient condition: it describes a setting in which there is a positive formula for coefficient of $x^ …
Hugh Thomas's user avatar
  • 6,302
5 votes

Build a topological polytope with a specified CW-structure

Edited to add: I now think the answer below is completely wrong. The three-dimensional cyclohedron has 12 facets, while the three-dimensional polytope the OP is looking for should have 14. This is t …
Hugh Thomas's user avatar
  • 6,302
1 vote

Build a topological polytope with a specified CW-structure

There is a canonical thing to do if you have a lattice quotient of weak order on the symmetric group. Namely, you take the Coxeter fan (which has one maximal cone for each element of $S_n$) and you g …
Hugh Thomas's user avatar
  • 6,302
4 votes
Accepted

Hales's fan associated with a polyhedron

The fan Hales is using is called the "face fan" of the polytope. In toric varieties, one mainly considers the outer normal fan of a polytope, which has a ray for each facet (perpendicular to it). …
Hugh Thomas's user avatar
  • 6,302
2 votes
Accepted

How can pushing a vertex in a polytope lead to merging facets?

What happens as you push $v$, is that you can break a face into two. Start with a cube in $\mathbb R^3$, choose a vertex, and start to push it into the interior of the cube. Each of the three facets …
Hugh Thomas's user avatar
  • 6,302
1 vote

How to prove that a set of facets are all the facets of a convex polytope.

Let V be the set of vertices, P their convex hull, and Q the polytope defined by the hyperplanes. If P is assumed to be simple, it suffices to check that each x in V is also a vertex of Q. By your …
Hugh Thomas's user avatar
  • 6,302
8 votes
Accepted

Break polyhedron into tetrahedron

If I understand your question correctly, you're saying that the given information is the face structure of a 3-dimensional convex polytope, and you would like a subdivision of the polytope into tetrah …
Hugh Thomas's user avatar
  • 6,302