Related papers: Tolerance Analysis by Polytopes
We develop a new functional-analytic technique for investigating the degree of noncompactness of an operator defined on a quasinormed space and taking values in a Marcinkiewicz space. The main result is a general principle from which it can…
Given two non-empty subsets $A$ and $B$ of the hyperbolic plane $\mathbb{H}^2$, we define their horocyclic Minkowski sum with parameter $\lambda=1/2$ as the set $[A:B]_{1/2} \subseteq \mathbb{H}^2$ of all midpoints of horocycle curves…
We consider nonconforming methods for symmetric elliptic problems and characterize their quasi-optimality in terms of suitable notions of stability and consistency. The quasi-optimality constant is determined and the possible impact of…
In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…
We present selected examples demonstrating an alternative approach to contour deformation for numerically computing loop integrals in the Minkowski regime. This method focuses on identifying singular hypersurfaces (varieties of the…
The $L_p$-Minkowski problem deals with the existence of closed convex hypersurfaces in $\mathbb{R}^{n+1}$ with prescribed $p$-area measures. It extends the classical Minkowski problem and embraces several important geometric and physical…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…
We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent non-convex sets and are generalizations of zonotopes, polytopes, and Taylor models.…
We develop the Lorentzian geometry of a crooked halfspace in 2+1-dimensional Minkowski space. We calculate the affine, conformal and isometric automorphism groups of a crooked halfspace, and discuss its stratification into orbit types,…
Given a topologically transitive system on the unit interval, one can investigate the cover time, i.e. time for an orbit to reach certain level of resolution in the repeller. We introduce a new notion of dimension, namely the stretched…
The main constraint on relative position of geometric objects, used in spatial planning for computing the C-space maps (for example, in robotics, CAD, and packaging), is the relative non-overlapping of objects. This is the simplest…
In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…
The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…
We study a class of convex bodies called operatopes that are obtained by taking Minkowski sums of affine images of an operator norm ball. This notion generalizes that of zonotopes which are Minkowksi sums of line segments. Taking the limit…
The intersection of two orthogonal cylinders represents a classical problem in computational geometry with direct applications to engineering design, manufacturing, and numerical simulation. While analytical solutions exist for the fully…
We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…
We study certain generic systems of real polynomial equations associated with triangulations of convex polytopes and investigate their number of real solutions. Our main focus is set on pairs of plane algebraic curves which form a so-called…