Related papers: New Direct Sum Tests

Integration at a point is a new kind of integration derived from integration over an interval in infinitesimal and infinity domains which are spaces larger than the reals. Consider a continuous monotonic divergent function that is…

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

A new differential test for series of positive terms is proved. Let f(x) be a positive continuous function corresponded to a series of positive terms f(k), and g(x) is a derivative of reciprocal of f(x). Then, the convergence and divergence…

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…

A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees…

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^{1}$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…

Let $PD(\mathbb{R})$ be the family of continuous positive definite functions on $\mathbb{R}$. For an integer $n>1$, a $f\in PD(\mathbb{R})$ is called $n$-divisible if there is $g\in PD(\mathbb{R})$ such that $g^n=f$. Some properties of…

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

We study the connection between directed isoperimetric inequalities and monotonicity testing. In recent years, this connection has unlocked breakthroughs for testing monotonicity of functions defined on discrete domains. Inspired the rich…

The primary problem in property testing is to decide whether a given function satisfies a certain property, or is far from any function satisfying it. This crucially requires a notion of distance between functions. The most prevalent notion…

For artificial deep neural networks, we prove expression rates for analytic functions $f:\mathbb{R}^d\to\mathbb{R}$ in the norm of $L^2(\mathbb{R}^d,\gamma_d)$ where $d\in {\mathbb{N}}\cup\{ \infty \}$. Here $\gamma_d$ denotes the Gaussian…

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C.…

Property testers are fast randomized algorithms whose task is to distinguish between inputs satisfying some predetermined property ${\cal P}$ and those that are far from satisfying it. Since these algorithms operate by inspecting a small…

The supremum of the standardized empirical process is a promising statistic for testing whether the distribution function $F$ of i.i.d. real random variables is either equal to a given distribution function $F_0$ (hypothesis) or $F \ge F_0$…

For a family of subsets of $[n]:={1,2,...,n}$, the Lubell function is defined as $\hb_n(\F):=\sum_{F\in\F}\binom{n}{|F|}^{-1}$. In \cite{GriLiLu}, Griggs, Lu, and the author conjectured that if a family $\F$ of subset of $[n]$ does not…

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…

The direct sampling method proposed by Walker et al. (JCGS 2011) can generate draws from weighted distributions possibly having intractable normalizing constants. The method may be of interest as a useful tool in situations which require…

We say that a function $\alpha(x)$ belongs to the set ${\bf A}^{(\gamma)}$ if it has an asymptotic expansion of the form $\alpha(x)\sim \sum^\infty_{i=0}\alpha_ix^{\gamma-i}$ as $x\to\infty$, which can be differentiated term by term…

Addressing stability in functional equations is a critical task with broad implications across mathematics and its applications. In this paper, we present a novel direct method for proving the stability of the following equation,…