I have a question on triangulations.
Let T be a triangulation of a d-dimensional cross-polytope. Let s be a (d-1)simplex that does not lie on the boundary of the cross-polytope. How can we show that s is a face of exactly two (d)simplices ? Am I wrong with the hypothesis ?
Thanks in advance.

That is correct. This is one of those statements that is easy to "see" but tricky to write down a proof. But I tried anyway (maybe someone can give a better explanation):
Let $p$ be a point in the interior of a (d-1)-simplex (Say $S$). Then since $p$ does not lie on the boundary of the cross polytope (say $P$) there is a neighbourhood of $p$ in $P$ homeomorphic to $\mathbb{R}^{d}$, and $S \subset P$ is (locally) homoemorphic to $\mathbb{R}^{d-1} \subset \mathbb{R}^{d}$. Note that $ \mathbb{R}^{d} \setminus \mathbb{R}^{d-1}$ has two connected components, i.e. $S$ has two "sides " in P. So any $d$-simplex containing $S$ will locally look be equal to one of these two connected components, hence there at most two of them.