Related papers: On the Multiary Algebraic Formulation of an Idempo…
$\mathbb B$-convexity was defined in [7] as a suitable Kuratowski-Painlev\'e upper limit of linear convexities over a finite dimensional Euclidean vector space. Excepted in the special case where convex sets are subsets of $\mathbb R^n_ +$,…
This article analyzes the geometric properties of an idempotent, non-associative algebraic structure that extends the Max-Times semiring. This algebraic structure is useful for studying systems of Max-Times and Max-Plus equations, employing…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
In \cite{botero}, a top intersection product of toric b-divisors on a smooth complete toric variety is defined. It is shown that a nef toric b-divisor corresponds to a convex set and that its top intersection number equals the volume of…
A recent analysis of real general relativity based on multisymplectic techniques has shown that boundary terms may occur in the constraint equations, unless some boundary conditions are imposed. This paper studies the corresponding form of…
The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…