Related papers: Which DNR can be minimal

Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\mathbb{N} \to \mathbb{R}$ such that for all $k \in \mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each…

We prove that every finite partition of $\omega$ admit an infinite subset that does not compute a Schnorr random real. We use this result to answer two questions of Brendle, Brooke-Taylor, Ng and Nies and strength a result of Khan and…

Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…

A seminal result of Hajnal and Szemer\'{e}di states that if a graph $G$ with $n$ vertices has minimum degree $\delta(G) \ge (r-1)n/r$ for some integer $r \ge 2$, then $G$ contains a $K_r$-factor, assuming $r$ divides $n$. Extremal examples…

A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a…

For every $r \in \mathbb{N}$, let $\theta_r$ denote the graph with two vertices and $r$ parallel edges. The $\theta_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\theta_r$. This…

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…

A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of…

For $S\subseteq \mathbb{F}^n$, consider the linear space of restrictions of degree-$d$ polynomials to $S$. The Hilbert function of $S$, denoted $\mathrm{h}_S(d,\mathbb{F})$, is the dimension of this space. We obtain a tight lower bound on…

For a transcendental entire function $f$, the property that there exists $r>0$ such that $m^n(r)\to\infty$ as $n\to\infty$, where $m(r)=\min \{|f(z)|:|z|=r\}$, is related to conjectures of Eremenko and of Baker, for both of which order…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

A classical result by Hajnal and Szemer\'edi from 1970 determines the minimal degree conditions necessary to guarantee for a graph to contain a $K_r$-factor. Namely, any graph on $n$ vertices, with minimum degree $\delta(G) \ge…

We prove that there exists essentially one {\it minimal} differential algebra of distributions $\A$, satisfying all the properties stated in the Schwartz impossibility result [L. Schwartz, Sur l'impossibilit\'e de la multiplication des…

Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices…

Let $T:D(T)\rightarrow H_2$ be a densely defined closed operator with domain $D(T)\subset H_1$. We say $T$ to be absolutely minimum attaining if for every closed subspace $M$ of $H_1$, the restriction operator $T|_M:D(T)\cap M\rightarrow…

A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar graph $H$ as a minor has the so-called Erd\H{o}s-P\'osa property; namely, there exists a function $f$ depending only on $H$ such that, for…

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

We study two families of integral functionals indexed by a real number $p > 0$. One family is defined for 1-dimensional curves in $\R^3$ and the other one is defined for $m$-dimensional manifolds in $\R^n$. These functionals are described…

We prove that the minimizer in the N\'ed\'elec polynomial space of some degree p > 0 of a discrete minimization problem performs as well as the continuous minimizer in H(curl), up to a constant that is independent of the polynomial degree…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k < n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is called minimal if for any edge $e\in…