Related papers: Minimal covers in the Weihrauch degrees
Given $I,B\in\mathbb{N}\cup \{0\}$, we investigate the existence and geometry of complete finitely branched minimal surfaces $M$ in $\mathbb{R}^3$ with Morse index at most $I$ and total branching order at most $B$. Previous works of…
We define the cover number of a graph $G$ by a graph class $\mathcal P$ as the minimum number of graphs of class $\mathcal P$ required to cover the edge set of $G$. Taking inspiration from a paper by Harary, Hsu and Miller, we find an exact…
A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy necessary conditions in terms of chi(Sigma~), chi(Sigma), orientability, the total degree, and the local degrees at the branching points. A…
We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…
A degree $d$ genus $g$ cover of the complex projective line by a smooth irreducible curve $C$ yields a vector bundle on the projective line by pushforward of the structure sheaf. We classify the bundles that arise this way when $d = 5$.…
A minimal counterexample to the Erd\H{o}s-Gy\'arf\'as conjecture is a graph of minimum possible order and size with minimum degree at least 3 that contains no cycle whose length is a power of 2. Markstr\"om observed that any such graph must…
For a large class of isotrivial rational elliptic surfaces (with section), we show that the set of rational points is dense for the Zariski topology, by carefully studying variations of root numbers among the fibers of these surfaces. We…
We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…
We establish the existence and uniqueness of rational conformal maps of minimal degree $n+1$ for opening up $n$ arcs. In earlier results, the degree was exponential in $n$. We also discuss two related problems. (a) We establish existence of…
We study conformally flat hypersurfaces $f\colon M^{3} \to \Q^{4}(c)$ with three distinct principal curvatures and constant mean curvature $H$ in a space form with constant sectional curvature $c$. First we extend a theorem due to Defever…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
We prove some new results on existence of solutions to first--order ordinary differential equations with deviating arguments. Delay differential equations are included in our general framework, which even allows deviations to depend on the…
We compute the number of (weak) equivalence classes of branched covers from a surface of genus g to the sphere, with 3 branching points, degree 2k, and local degrees over the branching points of the form (2,...,2), (2h+1,1,2,...,2),…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
We discuss a weak constraint qualification for conic linear programs and its applications for a few classes of cones. This constraint qualification is used to give a solution to a problem proposed by Shapiro and Z\v{a}linescu and show that…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…