Search Results
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 |
Homotopy theory, homological algebra, algebraic treatments of manifolds.
4
votes
Labeling a triangulated sphere
Let me point out that this also admits a purely combinatorial proof. Consider your triangulated $S^n$ as the boundary of a triangulated ball $B^{n+1}$ (for example, but not necessarily, cone your tria …
3
votes
Symmetries and faces of the associahedron
I have just seen this question, while looking for something else. The answer to 1 is indeed "no", and an explicit proof appears in Lemma 2.2 of Ceballos, Santos, and Ziegler - Many non-equivalent real …
3
votes
Accepted
Dehn-Sommerville relations for $\Delta$-complexes
I think the answer is yes and the following is a sketch of proof:
The second barycentric subdivision of a $\Delta$-complex is a triangulation.
The f-vector of a $\Delta$-complex and of its barycentr …
4
votes
Accepted
Cyclic polytopes whose boundary is a flag complex
The answer is "never" (except in the obvious case $d=2$, $n\ge 4$).
$C(n,d)$ is neighborly, meaning that every $d/2$ or less vertices define a simplex. In particular, for $d\ge 4$ its graph is comple …