Related papers: The Hairy Ball Problem is PPAD-Complete
The Poincar\'e-Hopf Theorem relates the Euler characteristic of a 2-dimensional compact manifold to the local behavior of smooth vector fields defined on it. However, despite the importance of Filippov vector fields, concerning both their…
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…
In this paper we prove that a capillary minimal surface outside the unit ball in $\mathbb {R}^3$ with one embedded end and finite total curvature must be either part of the plane or part of the catenoid. We also prove that a capillary…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
Modern statistical learning theory and deep learning characterize generalization primarily in terms of continuous capacity control (e.g., norm-based regularization, margin maximization, low-rank bias). While highly successful in continuous…
We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from…
We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded…
We study the static, spherically symmetric black hole solutions for a non-minimally coupled multi-scalar theory. We find numerical solutions for values of the scalar fields when a certain constraint on the maximal charge is satisfied.…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
The ball (or sphere) packing problem with equal balls, without any symmetry assumption, in a $3$-dimensional space of constant curvature was settled by B\"or\"oczky and Florian for the hyperbolic space $\HYP$ in \cite{BF64} and by proving…
Let ${H^p}\left( \mathbb{D} \right)$ be the Hardy space of all holomorphic functions on the unit disk $\mathbb{D}$ with exponent $p>0$. If $D\ne \mathbb{C}$ is a simply connected domain and $f$ is the Riemann mapping from $\mathbb{D}$ onto…
We show that every orbispace satisfying certain mild hypotheses has 'enough' vector bundles. It follows that the K-theory of finite rank vector bundles on such orbispaces is a cohomology theory. Global presentation results for smooth…
In Poisson Boolean models with deterministic ball grains, the directional visible range from an uncovered point is known to be exponentially distributed in Euclidean and real hyperbolic space. We show that the same phenomenon holds on every…
In $U(1)$ gauge-invariant scalar-vector-tensor theories with second-order equations of motion, we study the properties of black holes (BH) on a static and spherically symmetric background. In shift-symmetric theories invariant under the…
In this paper we examine different problems regarding complete intersection varieties of high degree in a complex projective space. First we show how one can deduce hyperbolicity for generic complete intersection of high multidegree and…
In this paper, we prove that a domain which verifies some integral inequality is either (strictly) contained in the solution of some free boundary problem, or it coincides with an $N$-ball. We also present new overdetermined value problems…
Let P be a locally finite disk pattern on the complex plane C whose combinatorics are described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function \Theta:E\to [0,\pi/2] on…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
An important problem that arises in many engineering applications is the boundary value problem for ordinary differential equations. There have been many computational methods proposed for dealing with this problem. The convergence of the…
In this paper, we study Wicksell's corpuscle problem in spaces of constant curvature, thus extending the classical Euclidean framework. We consider a particle process of balls with random radii in such a space, assumed to be invariant under…