We provide a polynomial time algorithm for computing the universal Gröbner basis of any
polynomial ideal having a finite set of common zeros in fixed number of variables. One …

Voronoĭ conjectured that every parallelotope is affinely equivalent to a Voronoĭ polytope.
For some m, a parallelotope is defined by a set of m facet vectors pi, and defines a set of m …

… for a zonotope to be a space tiling zonotope, ie a zonotope which admits a face-to-face tiling
of space by translations. Implicitly, he related space tiling zonotopes to … for zonotopes using …

… In this work the theory of quasivector spaces has been briefly outlined and applied for
computation with zonotopes. An approximation problem for … In the present work this has …

… Since the volume of each cube Qi1,...,id is simply given by vol(Qi1,...,id ) = |det(xi1 ,...,xid )|,
this leads to the following volume formula for zonotopes, which will play a crucial role in this …

… We present two classes of linear inequalities that the flag fvectors of zonotopes satisfy.
These inequalities strengthen inequalities for polytopes obtained by the lifting technique of …

… In this work, the uncertain evolution sets are approximated by zonotopes [7] that provide
better … To obtain better approaches in this paper it is proposed to use zonotopes [7]. …

… The present work is devoted to computation with zonotopes in the plane. Using ideas from
the theory of quasivector spaces we formulate an approximation problem for zonotopes and …

… zonotope based fault detection algorithm described in this paper is applied, being iniatilised
to the initial zonotope: … zonotope inclusion method described in Section 4.2. In this case, the …

This paper presents a computational procedure to evaluate the fault tolerance of a linear-constrained
model predictive control (LCMPC) scheme for a given actuator fault configuration (…