Related papers: The Slack Realization Space of a Polytope
A new algorithm for deciding the satisfiability of polynomial formulas over the reals is proposed. The key point of the algorithm is a new projection operator, called sample-cell projection operator, custom-made for Conflict-Driven Clause…
Deterministic protocols are well-known tools to obtain extended formulations, with many applications to polytopes arising in combinatorial optimization. Although constructive, those tools are not output-efficient, since the time needed to…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
We study the homotopy types of certain spaces closely related to the spaces of algebraic (rational) maps from the $m$ dimensional real projective space into the $n$ dimensional complex projective space for $2\leq m\leq 2n$ (we conjecture…
We study the defining equations of projective embeddings of the blowup of P^2 at a set of {d+1 \choose 2} number of points in generic position. To do this, we first generalize the notion of a matrix, its ideal of 2x2 minors to that of a…
In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
Let $(A,\alpha)$ be a system consisting of a $C^*$-algebra $A$ and an automorphism $\alpha$ of $A$. We describe the primitive ideal space of the partial-isometric crossed product $A\times_{\alpha}^{\textrm{piso}}\mathbb{N}$ of the system by…
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…
We construct a smooth complex projective rational surface with infinitely many mutually non-isomorphic real forms. This gives the first definite answer to a long standing open question if a smooth complex projective rational surface has…
We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…
Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We introduce a systematic method to solve a type of Cartan's realization problem. Our method builds upon a new theory of Lie algebroids and Lie groupoids with structure group and connection. This approach allows to find local as well as…
We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced…
The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural networks to solve multidimensional linear optimization problems,…
In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…
A family of fractal arrangements of circles is introduced for each imaginary quadratic field $K$. Collectively, these arrangements contain (up to an affine transformation) every set of circles in the extended complex plane with integral…
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…