Related papers: The Hairy Ball Problem is PPAD-Complete
In this paper we study the class of so called `ball-bodies' in ${\mathbb R}^n$, given by intersections of translates of Euclidean unit balls (or, equivalently, summand of the Euclidean ball). We study the class along with the natural…
The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new…
If a black hole has hair, how short can this hair be? A partial answer to this intriguing question was recently provided by the 'no-short hair' theorem which asserts that the external fields of a spherically-symmetric electrically neutral…
We restate the semistable reduction theorem from geometric invariant theory in the context of spaces of morphisms on $\mathbb{P}^{n}$. For every complete curve $C$ downstairs, we get a $\mathbb{P}^{n}$-bundle on an abstract curve $D$…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
A well-studied continuous model of graphs considers each edge as a continuous unit-length interval of points. In the problem $\delta$-Tour defined within this model, the objective to find a shortest tour that comes within a distance of…
In a very interesting paper, Hod has proven that the equatorial null circular geodesic provides the extreme orbital period to circle a kerr black hole, which is closely related to the Fermat's principle. In the present paper, we extend the…
The Theorem on Invariance of Domain due to L.E.J. Brouwer states that one connected, compact (Hausdorff) m-dimensional manifold embedded into another actually realizes a homeomorphism. This fundamental result is relevant to Functional…
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
We prove the hyperplane absolute winning property of weighted inhomogeneous badly approximable vectors in $\mathbb{R}^d$. This answers a question by Beresnevich--Nesharim--Yang and extends the main result of [Geometric and Functional…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
We present a necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex. In particular, convexity is guaranteed…
We call a sheaf on an algebraic variety immaculate if it lacks any cohomology including the zero-th one, that is, if the derived version of the global section functor vanishes. Such sheaves are the basic tools when building exceptional…
The conformal barycenter of a point cloud on the sphere at infinity of the Poincar\'e ball model of hyperbolic space is a hyperbolic analogue of the geometric median of a point cloud in Euclidean space. It was defined by Douady and Earle as…
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We show that the integral method used to prove the no-hair theorem for Black Holes (BH's) in spherically symmetric and static spacetimes within the framework of general relativity with matter composed by a complex-valued scalar-field does…
The binary perfect phylogeny model is too restrictive to model biological events such as back mutations. In this paper we consider a natural generalization of the model that allows a special type of back mutation. We investigate the problem…