Characterizations of reduced polytopes in finite-dimensional normed spaces.
Classical solids.
Computation of Bett Numbers of Monomial Ideals Associated with Stacked Polytopes.
Conditional probabilities and permutahedron
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
Nous construisons des familles de facettes du polytope du sac-à-dos quadratique en 0-1 selon les deux approches suivantes. Le Boolean quadric polytope (introduit dans le cas sans contraintes par Padberg [12]) contenant le polytope du sac-à-dos quadratique, une première approche consiste à se demander sous quelles conditions une facette du premier est aussi une facette du second et quand ces conditions ne sont pas remplies quels liftings permettent d'en faire une facette. Des réponses à ces questions...
Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds.
Convex cones in finite-dimensional real vector spaces
Counting -polytopes with vertices.
Crofton measures in polytopal Hilbert geometries.
Curvature on a graph via its geometric spectrum
We approach the problem of defining curvature on a graph by attempting to attach a ‘best-fit polytope’ to each vertex, or more precisely what we refer to as a configured star. How this should be done depends upon the global structure of the graph which is reflected in its geometric spectrum. Mean curvature is the most natural curvature that arises in this context and corresponds to local liftings of the graph into a suitable Euclidean space. We discuss some examples.