Related papers: The Hairy Ball Problem is PPAD-Complete
The Barth-Van de Ven-Tyurin-Sato Theorem claims that any finite rank vector bundle on the infinite complex projective space $\mathbf{P}^\infty$ is isomorphic to a direct sum of line bundles. We establish sufficient conditions on a locally…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…
The Hardy spaces are defined on the quotient domain of a bounded complete Reinhardt domain by a finite subgroup of $U(n)$. The Szeg\H{o} projection on the quotient domain can be studied by lifting to the covering space. This setting builds…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We consider the problem of minimizing a proper, lower semicontinuous, geodesically convex function on a Hadamard manifold. Building on ball-proximal (broximal) ideas in the Euclidean setting, viewed as an abstract proximal-type algorithm,…
We show that any compact surface of genus zero in Euclidean 3-space that satisfies a quasiconformal inequality between its principal curvatures is a round sphere. This solves an old open problem by H. Hopf, and gives a spherical version of…
A general continuum theory for the distribution of hairs in a bundle is developed, treating individual fibers as elastic filaments with random intrinsic curvatures. Applying this formalism to the iconic problem of the ponytail, the combined…
The goal of the \emph{alignment problem} is to align a (given) point cloud $P = \{p_1,\cdots,p_n\}$ to another (observed) point cloud $Q = \{q_1,\cdots,q_n\}$. That is, to compute a rotation matrix $R \in \mathbb{R}^{3 \times 3}$ and a…
We give a complete characterization of all isoperimetric sets contained in a domain of the Euclidean plane, that is bounded by a Jordan curve and satisfies a no-neck property. Further, we prove that the isoperimetric profile of such domain…
We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms…
High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
We describe a new type of hair on supersymmetric black string and black ring solutions, which produces the largest known violation of black hole uniqueness, parameterized by an arbitrary function and hence an infinite number of continuous…
In this paper, we prove the following result: Let $(H,\langle\cdot,\cdot\rangle)$ be a real Hilbert space, $B$ a ball in $H$ centered at $0$ and $\Phi:B\to H$ a $C^{1,1}$ function, with $\Phi(0)\neq 0$, such that the function $x\to \langle…