Related papers: A Distance Amplification Lemma for Monotonicity
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximal monotone operators provided that Rockafellar's constraint qualification holds. In this note, we provide a new maximal…
For any two point sets $A,B \subset \mathbb{R}^d$ of size up to $n$, the Chamfer distance from $A$ to $B$ is defined as $\text{CH}(A,B)=\sum_{a \in A} \min_{b \in B} d_X(a,b)$, where $d_X$ is the underlying distance measure (e.g., the…
We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (equivalently, distance estimation) of monotonicity, unateness, and juntas with a constant separation between the "yes" and "no" cases.…
In this paper, we prove the following result. Let $\alpha$ be any real number between $0$ and $2$. Assume that $u$ is a solution of $$ \left\{\begin{array}{ll} (-\Delta)^{\alpha/2} u(x) = 0 , \;\; x \in \mathbb{R}^n ,\\…
Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this…
Our input is an undirected weighted graph $G = (V,E)$ on $n$ vertices along with a source set $S\subseteq V$. The problem is to preprocess $G$ and build a compact data structure such that upon query $Qu(s,v,f)$ where $(s,v) \in S\times V$…
We consider the problem of maximizing submodular functions in single-pass streaming and secretaries-with-shortlists models, both with random arrival order. For cardinality constrained monotone functions, Agrawal, Shadravan, and Stein gave a…
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools…
We establish two results regarding the query complexity of bounded-error randomized algorithms. * Bounded-error separation theorem. There exists a total function $f : \{0,1\}^n \to \{0,1\}$ whose $\epsilon$-error randomized query complexity…
It was conjectured that if $f\in C^1(\mathbb{R}^n,\mathbb{R}^n)$ satisfies $\operatorname{rank} Df\leq m<n$ everywhere in $\mathbb{R}^n$, then $f$ can be uniformly approximated by $C^\infty$-mappings $g$ satisfying $\operatorname{rank}…
We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor; specifically, for strings of length n and every fixed epsilon>0, it can compute a (log n)^O(1/epsilon)…
Suppose that $\Omega \subset\mathbb R^{n+1}$, $n\geq1$, is a uniform domain with $n$-Ahlfors regular boundary and $L$ is a (not necessarily symmetric) divergence form elliptic, real, bounded operator in $\Omega$. We show that the…
We show that for a relation $f\subseteq \{0,1\}^n\times \mathcal{O}$ and a function $g:\{0,1\}^{m}\times \{0,1\}^{m} \rightarrow \{0,1\}$ (with $m= O(\log n)$), $$\mathrm{R}_{1/3}(f\circ g^n) = \Omega\left(\mathrm{R}_{1/3}(f) \cdot…
We present the first compact distance oracle that tolerates multiple failures and maintains exact distances. Given an undirected weighted graph $G = (V, E)$ and an arbitrarily large constant $d$, we construct an oracle that given vertices…
In this paper, we establish a general monotonicity formula of the following elliptic system $$ \Delta u_i+f_i(u_1,...,u_m)=0 \quad {\rm in} \Omega, \label{0.1} $$ where $\Omega\subset\subset \mathbb{R}^n$ is a bounded domain,…
The problem of monotonicity testing over the hypergrid and its special case, the hypercube, is a classic, well-studied, yet unsolved question in property testing. We are given query access to $f:[k]^n \mapsto \R$ (for some ordered range…
We study the problem of testing unateness of functions $f:\{0,1\}^d \to \mathbb{R}.$ We give a $O(\frac{d}{\epsilon} \cdot \log\frac{d}{\epsilon})$-query nonadaptive tester and a $O(\frac{d}{\epsilon})$-query adaptive tester and show that…
The problem of monotone submodular maximization has been studied extensively due to its wide range of applications. However, there are cases where one can only access the objective function in a distorted or noisy form because of the…
Opial's Lemma is a fundamental result in the convergence analysis of sequences generated by optimization algorithms in real Hilbert spaces. We introduce the concept of Opial sequences - sequences for which the limit of the distance to each…
We prove a monotonicity formula for minimal or almost minimal sets for the Hausdorff measure $\cal{H}^d$, subject to a sliding boundary constraint where competitors for $E$ are obtained by deforming $E$ by a one-parameter family of…