Related papers: Estimating the distance from testable affine-invar…
In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…
For given $p\in\lbrack1,\infty]$ and $g\in L^{p}\mathbb{(R)}$, we establish the existence and uniqueness of solutions $f\in L^{p}(\mathbb{R)}$, to the equation \[ f(x)-af(bx)=g(x), \] where $a\in\mathbb{R}$, $b\in\mathbb{R} \setminus…
The distance ideals of graphs are algebraic invariants that generalize the Smith normal form (SNF) and the spectrum of several distance matrices associated with a graph. In general, distance ideals are not monotone under taking induced…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fr\'echet distances $\epsilon_1,\ldots,\epsilon_L$ to each of…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
Recently there has been much interest in graph-based learning, with applications in collaborative filtering for recommender networks, link prediction for social networks and fraud detection. These networks can consist of millions of…
Approximate proof labeling schemes were introduced by \\Censor-Hillel, Paz and Perry \cite{CPP}. Roughly speaking, a graph property~$\cP$ can be verified by an approximate proof labeling scheme in constant-time if the vertices of a graph…
We prove that the pushforwards of a very general class of fractal measures $\mu$ on $\mathbb{R}^d$ under a large family of non-linear maps $F \colon \mathbb{R}^d \to \mathbb{R}$ exhibit polynomial Fourier decay: there exist $C,\eta>0$ such…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
In the field of statistics, many kind of divergence functions have been studied as an amount which measures the discrepancy between two probability distributions. In the differential geometrical approach in statistics (information…
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Geometrically, we estimate the cardinality of a…
We generalize the celebrated isoperimetric inequality of Khot, Minzer, and Safra~(SICOMP 2018) for Boolean functions to the case of real-valued functions $f \colon \{0,1\}^d\to\mathbb{R}$. Our main tool in the proof of the generalized…
In this paper, we present a novel affine-invariant feature based on SIFT, leveraging the regular appearance of man-made objects. The feature achieves full affine invariance without needing to simulate over affine parameter space. Low-rank…
We show how to represent a simple polygon $P$ by a grid (pixel-based) polygon $Q$ that is simple and whose Hausdorff or Fr\'echet distance to $P$ is small. For any simple polygon $P$, a grid polygon exists with constant Hausdorff distance…
We study the general problem of testing whether an unknown distribution belongs to a specified family of distributions. More specifically, given a distribution family $\mathcal{P}$ and sample access to an unknown discrete distribution…
We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…
The goal of this note is to give, at least for a restricted range of indices, a short proof of homogeneous commutator estimates for fractional derivatives of a product, using classical tools. Both $L^{p}$ and weighted $L^{p}$ estimates can…
Let K be a closed bounded convex subset of $\Bbb R^n$; then by a result of the first author, which extends a classical theorem of Whitney there is a constant $w_m(K)$ so that for every continuous function f on K there is a polynomial $\phi$…
Motivated by the fact that input distributions are often unknown in advance, distribution-free property testing considers a setting where the algorithmic task is to accept functions $f : [n] \to \{0,1\}$ with a certain property P and reject…