-vectors of 3-manifolds.
En dos artículos, publicados en 1989, Balas y Ng dan una metodología para construir facetas del politopo de recubrimiento con coeficientes en {0, 1, 2}. Siguiendo esta metodología, en el presente artículo decimos cómo se contruyen facetas de dicho politopo con coeficientes en {0, 1, 2, 3}.
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
The problem of utilizing facet reflections to bring a point outside of a convex polytope to inside has not been studied explicitly in the literature. Here we introduce two algorithms that complete the task in finite iterations. The first algorithm generates multiple solutions on the plane, and can be readily utilized in creating games on a plane or as a level generation method for video games. The second algorithm is a new efficient way to bring infeasible starting points of an optimization problem...
We prove that Platonic and some Archimedean polyhedra have the fixed point property in a non-classical sense.