Related papers: The Hairy Ball Problem is PPAD-Complete
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
The issue concerning the existence of exact black hole solutions in presence of non vanishing cosmological constant and scalar fields is reconsidered. With regard to this, in investigating no-hair theorem violations, exact solutions of…
An important problem that commonly arises in areas such as internet traffic-flow analysis, phylogenetics and electrical circuit design, is to find a representation of any given metric $D$ on a finite set by an edge-weighted graph, such that…
We extend all known black hole no-hair theorems to space-times endowed with a positive cosmological constant $\Lambda.$ Specifically, we prove that static spherical black holes with $\Lambda>0$ cannot support scalar fields in convex…
In this paper, we define vector bundles within the framework of almost mathematics (referred to as almost vector bundles) and establish the $v$-descent theorem together with a structure theorem for these bundles over perfectoid spaces. The…
The black hole no-short hair theorem establishes a universal lower bound on the extension of hairs outside any 4-dimensional spherically symmetric black hole solutions. We generalise this theorem beyond spherical symmetry, specifically for…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
There exist well-known no-hair theorems forbidding the existence of hairy black hole solutions in general relativity coupled to a scalar conformal field theory in asymptotically flat space. Even in the presence of cosmological constant,…
There has been a long-standing question about whether being perfectoid for an algebra is local in the analytic topology. We provide affirmative answers for the algebras (e.g., over $\overline{\mathbb{Z}_p}$) whose spectra are inverse limits…
This paper consolidates noscalar hair theorem for a charged spherically symmetric black hole in four dimension in general relativity as well as in all scalar tensor theories, both minimally and nonminimally coupled, when the effective…
We prove that, given any covering of any separable infinite-dimensional uniformly rotund and uniformly smooth Banach space $X$ by closed balls each of positive radius, some point exists in $X$ which belongs to infinitely many balls.
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
We provide an exact hairy black hole solution to an $n+1$ dimensional complex scalar field model coupled with gravity. The model is characterized by a potential with one parameter. Depending on the magnitude of this parameter, the effective…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
We revisit the inverted pendulum problem with the goal of understanding and computing the true optimal value function. We start with an observation that the true optimal value function must be nonsmooth ($i.e.$, not globally $C^1$) due to…
The recently proved `no short hair' theorem asserts that, if a spherically-symmetric static black hole has hair, then this hair (the external fields) must extend beyond the null circular geodesic (the "photonsphere") of the corresponding…
We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a…
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…