Related papers: Harmonic Center of a Closed Convex Polytope: Defin…
A simplex in n dimensions is defined by the usual (n+1) linear inequality constraints in n dimensions. Here we consider simplexes which are bounded sets. The harmonic center has been defined earlier for polytopes in general. A relationship…
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…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
We consider asymmetric convex intersection testing (ACIT). Let $P \subset \mathbb{R}^d$ be a set of $n$ points and $\mathcal{H}$ a set of $n$ halfspaces in $d$ dimensions. We denote by $\text{ch}(P)$ the polytope obtained by taking the…
A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…
We study the harmonic mean of non-zero complex-valued random variables (complex harmonic mean) and establish several geometric estimates and bounds. In contrast to the classical positive-valued case, complex harmonic means may lie outside…
Let $\mathcal{P}$ be an $\mathcal{H}$-polytope in $\mathbb{R}^d$ with vertex set $V$. The vertex centroid is defined as the average of the vertices in $V$. We prove that computing the vertex centroid of an $\mathcal{H}$-polytope is #P-hard.…
There are several remarkable points, defined for polygons and multisets of points in the plane, called centers (such as the centroid). To make possible their study, there exists a formal definition for the concept of center in both cases.…
The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…
A harmonic mapping is a univalent harmonic function of one complex variable. We define a family of harmonic mappings on the unit disk whose images are rotationally symmetric rosettes with $n$ cusps or n nodes, where $n \ge 3$. These…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
It is proved that harmonic functions are characterized by harmonicity of their spherical means, for which purpose the iterated spherical means are used. The similar characterization of solutions to the modified Helmholtz equation…
The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…
Given a convex domain $C$, a $C$-polygon is an intersection of $n\geq 2$ homothets of $C$. If the homothets are translates of $C$ then we call the intersection a translative $C$-polygon. This paper proves that if $C$ is a strictly convex…
The isotropy constant of any $d$-dimensional polytope with $n$ vertices is bounded by $C \sqrt{n/d}$ where $C>0$ is a numerical constant.
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…