… Subsequently, the offsets u i are calculated by shifting the zonotope hyperplanes such that
… zonotopes with respect to a given objective. The constraint that enforces a zonotope to be a …

… The main technical tool behind our construction is a connection between these polynomials
and the geometry of zonotope tilings. We apply these results to construct an explicit factory …

… A disadvantage of zonotopes is that they are not closed under intersection, ie, the intersection
of two zonotopes does not return a zonotope in general. In order to overcome this …

This paper proposes the design of an interval observer-based approach for linear dynamic
systems affected by both time-invariant and time-varying uncertainties. First, different interval …

… zonotopes with a zonotope order of 20 and a time step size of 0.01 for µ = 1, and a zonotope
… Maximum zonotope order is set to 100, reachability analysis is carried out with an (absolute …

… zonotopes can be represented as a constrained zonotope. The multiplication r Z of an interval
matrix r with a zonotope Z … of a zonotope can be decreased with zonotope order reduction. …

… Mimicking the fact that sweep polytopes of point configurations (the monotone path polytopes
of the associated zonotopes) are projections of permutahedra, we define sweep oriented …

… is a zonotope, which is … zonotopes and 35 Minkowski sums of a zonotope with the
Dirichlet–Voronoi cell PV (D4) of the root lattice D4. There are 16 sums Z + PV (D4) and 3 zonotopes …

… The Minkowski sum of a set of segments is a special convex polytope known as a zonotope.
There is a natural zonotope Z ( V ) ⊂ R d + 1 associated to each point configuration V , …

We introduce an object called a tree growing sequence (TGS) in an effort to generalize
bijective correspondences between G -parking functions, spanning trees, and the set of …