A Note on Geometry of Polyhedron of Three-index Transportation Problem
A Note on Small Linear-Ordering Polytopes.
Approximating the isoperimetric number of strongly regular graphs.
Circumradius versus side lengths of triangles in linear normed spaces
Given a planar convex body B centered at the origin, we denote by ℳ ²(B) the Minkowski plane (i.e., two-dimensional linear normed space) with the unit ball B. For a triangle T in ℳ ²(B) we denote by the least possible radius of a Minkowskian ball enclosing T. We remark that in the terminology of location science is the optimum of the minimax location problem with distance induced by B and vertices of T as existing facilities (see, for instance, [HM03] and the references therein). Using methods...
Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds.
Constructive approximation of a ball by polytopes
Corner cuts and their polytopes.
Dynamics of polynomial systems at infinity.
Equivariant fiber polytopes.
Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}.
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}.
Finite convergence into a convex polytope via facet reflections
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...
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
Goffin's algorithm for zonotopes
The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor (where is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...
Hodge spaces of real toric varieties
Isocanted alcoved polytopes
Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their -vectors and checking the validity of the following five conjectures: Bárány, unimodality, , flag and cubical lower bound (CLBC). Isocanted alcoved polytopes are centrally symmetric, almost simple cubical polytopes. They are zonotopes. We show that, for each dimension, there is a unique combinatorial type. In dimension , an isocanted alcoved polytope has vertices, its face lattice is the lattice...
Minimal-Energy Clusters of Hard Spheres.
Mixture decompositions of exponential families using a decomposition of their sample spaces
We study the problem of finding the smallest such that every element of an exponential family can be written as a mixture of elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding theory. We show that is the smallest number for which any distribution of
Odd cycles and a class of facets of the axial 3-index assignment polytope
On braxtopes, a class of generalized simplices.
On Schläfli's reduction formula.