Related papers: Which DNR can be minimal

Inspired by the idea of blurring the exponential function, we define blurred variants of the $j$-function and its derivatives, where blurring is given by the action of a subgroup of $\rm{GL}_2(\mathbb{C})$. For a dense subgroup (in the…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We study the problem of constructing $k$-spectral minimal partitions of domains in $d$ dimensions, where the energy functional to be minimized is a $p$-norm ($1 \le p \le \infty$) of the infimum of the spectrum of a suitable Schr\"odinger…

We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G. Given a graph H, we determine, asymptotically, the Ore-type degree…

A family of regularization functionals is said to admit a linear representer theorem if every member of the family admits minimizers that lie in a fixed finite dimensional subspace. A recent characterization states that a general class of…

We prove a conjecture of Kim and Oum that every proper pivot-minor-closed class of graphs has the strong Erd\H{o}s-Hajnal property. More precisely, for every graph $H$, there exists $\epsilon > 0$ such that every $n$-vertex graph with no…

Given a cardinal $\kappa$ and filters $\mathcal{F}_\alpha$ on $\omega$ for $\alpha\in\kappa$, we will show that if $\prod_{\alpha\in\kappa}\mathcal{F}_\alpha$ is countable dense homogeneous then $\kappa<\mathfrak{p}$ and each…

It is known that the famous Heins Theorem (also known as the de Branges Lemma) about the minimum of two entire functions of minimal type does not extend to functions of finite exponential type. We study in detail pairs of entire functions…

The Grid Minor Theorem states that for every planar graph $H$, there exists a smallest integer $f(H)$ such that every graph with tree-width at least $f(H)$ contains $H$ as a minor. The only known lower bounds on $f(H)$ beyond the trivial…

Let $\varphi$ be a function in the Hardy space $H^2(\mathbb{T}^d)$. The associated (small) Hankel operator $\mathbf{H}_\varphi$ is said to have minimal norm if the general lower norm bound $\|\mathbf{H}_\varphi\| \geq…

We prove that every function that is meromorphic on the closure of an analytic Jordan domain and sufficiently well-behaved on the boundary is conformally equivalent to a rational map whose degree is smallest possible. We also show that the…

We show that if $h\in\mathbb{Z}[x]$ is a polynomial of degree $k$ such that the congruence $h(x)\equiv0\pmod{q}$ has a solution for every positive integer $q$, then any subset of $\{1,2,\ldots,N\}$ with no two distinct elements with…

Deep Neural Networks (DNNs) training can be difficult due to vanishing and exploding gradients during weight optimization through backpropagation. To address this problem, we propose a general class of Hamiltonian DNNs (H-DNNs) that stem…

A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…

Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit $d^{O(1)}$-variate and degree $d$ polynomial $P_{d}\in VNP$ such that if any depth four circuit $C$ of bounded formal degree $d$ which computes a…

In this paper we solve a problem posed by M.E. Rossi: {\it Is the Hilbert function of a Gorenstein local ring of dimension one not decreasing? } More precisely, for any integer $h>1$, $h \notin\{14+22k, \, 35+46k \ | \ k\in\mathbb{N} \}$,…

Deep neural networks (DNNs) achieve impressive results for complicated tasks like object detection on images and speech recognition. Motivated by this practical success, there is now a strong interest in showing good theoretical properties…

The \emph{domination subdivision number} sd$(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of $G$. It has been shown…

We extend \cite[Theorem 4.5]{DGNO} and \cite[Theorem 4.22]{LKW} to positive characteristic (i.e., to the finite, not necessarily fusion, case). Namely, we prove that if $\D$ is a finite non-degenerate braided tensor category over an…

A $K_r$-factor of a graph $G$ is a collection of vertex-disjoint $r$-cliques covering $V(G)$. We prove the following algorithmic version of the classical Hajnal--Szemer\'edi Theorem in graph theory, when $r$ is considered as a constant.…