Related papers: Minimal covers in the Weihrauch degrees

In this work we study constant-coefficient first order systems of partial differential equations and give necessary and sufficient conditions for those systems to have a well posed Cauchy Problem. In many physical applications, due to the…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…

There exist numerous results in the literature proving that within certain families of totally real number fields, the minimal rank of a universal quadratic lattice over such a field can be arbitrarily large. Kala introduced a technique of…

A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…

We prove the existence of a one parameter family of minimal embedded hypersurfaces in $R^{n+1}$, for $n \geq 3$, which generalize the well known 2 dimensional "Riemann minimal surfaces". The hypersurfaces we obtain are complete, embedded,…

Belyi's theorem asserts that a smooth projective curve $X$ defined over a number field can be realized as a cover of the projective line unramified outside three points. In this short paper we investigate the bejaviour of the minimal degree…

Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender or age. In such settings, it is often desirable to produce a…

We show that there is a strong minimal pair in the computably enumerable Turing degrees.

In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal…

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

We consider the problem of covering multiple submodular constraints. Given a finite ground set $N$, a cost function $c: N \rightarrow \mathbb{R}_+$, $r$ monotone submodular functions $f_1,f_2,\ldots,f_r$ over $N$ and requirements…

We adapt the method of Simon [JDG '93] to prove a $C^{1,\alpha}$-regularity theorem for minimal varifolds which resemble a cone $\bf{C}_0^2$ over an equiangular geodesic net. For varifold classes admitting a "no-hole" condition on the…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

Let $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned.…

We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…

A very well-covered graph is a well-covered graph without isolated vertices such that the size of its minimal vertex covers is half of the number of vertices. If $G$ is a Cohen-Macaulay very well-covered graph, we deeply investigate some…

The problem of finding all minimal surfaces presented in parametric form as polynomials of certain degree is discussed by many authors. It is known that the classical Enneper surface is (up to position in space and homothety) the only…