We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called almost simplicial polytopes. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$, and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and the Upper Bound Theorem by McMullen, which treat the case where $s=0$. We characterize the minimizers and provide examples of maximizers for any $d$. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we prove the balanced analog of the celebrated lower bound theorem (LBT) for normal pseudomanifolds and characterize the case of equality; we introduce and characterize the balanced analog of the Walkup class; and we propose the balanced analog of the generalized lower bound conjecture (GLBC) and establish some related results. We close with constructions of balanced manifolds with few vertices.

For a d-dimensional convex lattice polytope P, a formula for the boundary volume vol(∂P) is derived in terms of the number of boundary lattice points on the first ⌊d/2⌋ dilations of P. As an application we give a necessary and sufficient condition for a polytope to be reflexive, and derive formulas for the f-vector of a smooth polytope in dimensions three, four, and five. We also give applications to reflexive order polytopes, and to the Birkhoff polytope.

Monotone paths on zonotopes and the natural generalization to maximal chains in the poset of topes of an oriented matroid or arrangement of pseudo-hyperplanes are studied with respect to a kind of local move, called polygon move or flip. It is proved that any monotone path on a $d$-dimensional zonotope with $n$ generators admits at least $\left\lceil 2n/\left( n-d+2 \right) \right\rceil -1$ flips for all $n\ge d+2\ge 4$ and that for any fixed value of $n-d$, this lower bound is sharp for infinitely many values of $n$. In particular, monotone paths on zonotopes which admit only three flips are constructed in each dimension $d\ge 3$. Furthermore, the previously known 2-connectivity of the graph of monotone paths on a polytope is extended to the 2-connectivity of the graph of maximal chains of topes of an oriented matroid. An application in the context of Coxeter groups of a result known to be valid for monotone paths on simple zonotopes is included.