English
Related papers

Related papers: New Direct Sum Tests

200 papers

The direct product problem is a fundamental question in complexity theory which seeks to understand how the difficulty of computing a function on each of k independent inputs scales with k. We prove the following direct product theorem…

Computational Complexity · Computer Science 2014-05-12 Andrew Drucker

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

Computational Complexity · Computer Science 2013-01-18 Arnab Bhattacharyya , Eldar Fischer , Hamed Hatami , Pooya Hatami , Shachar Lovett

A shift-invariant system is a collection of functions $\{g_{m,n}\}$ of the form $g_{m,n}(k) = g_m(k-an)$. Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual…

Numerical Analysis · Mathematics 2025-10-20 Thomas Strohmer

We propose two families of tests for the classical goodness-of-fit problem to univariate normality. The new procedures are based on $L^2$-distances of the empirical zero-bias transformation to the normal distribution or the empirical…

Methodology · Statistics 2020-02-25 Steffen Betsch , Bruno Ebner

We introduce a novel arithmetic function $w(n)$, a generalization of the Liouville function $\lambda(n)$, as the coefficients of a Dirichlet series. By spatially encoding information in a natural way about the distribution of prime factors…

Number Theory · Mathematics 2025-04-04 Sky Pelletier Waterpeace

For $f$ analytic and close to convex in $D=\{z: |z|< 1\}$, we give sharp estimates for the logarithmic coefficients $\gamma_{n}$ of $f$ defined by $\log \dfrac{f(z)}{z}=2\sum_{n=1}^{\infty} \gamma_{n}z^{n}$ when $n=1, 2,3$.

Complex Variables · Mathematics 2015-10-01 D. K. Thomas

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over…

Number Theory · Mathematics 2019-04-23 Maxie D. Schmidt

In this paper we develop methodology for testing relevant hypotheses about functional time series in a tuning-free way. Instead of testing for exact equality, for example for the equality of two mean functions from two independent time…

Methodology · Statistics 2020-02-21 Holger Dette , Kevin Kokot , Stanislav Volgushev

We study the problem of designing consistent sequential two-sample tests in a nonparametric setting. Guided by the principle of testing by betting, we reframe this task into that of selecting a sequence of payoff functions that maximize the…

Statistics Theory · Mathematics 2025-08-26 Shubhanshu Shekhar , Aaditya Ramdas

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

Functional Analysis · Mathematics 2018-06-29 Krzysztof C. Ciesielski , Juan B. Seoane Sepúlveda

The present paper introduces a theoretical framework through which the degree of risk aversion with respect to uncertain prices can be measured through the context of the indirect utility function (IUF) using a lab experiment. First, the…

General Economics · Economics 2022-09-07 Ali Zeytoon-Nejad

Ingham studied two types of convolution sums of the divisor function, namely the shifted convolution sum $\sum_{n \le N} d(n) d(n+h)$ and the additive convolution sum $\sum_{n < N} d(n) d(N-n)$ for integers $N, h$ and derived their…

Number Theory · Mathematics 2025-02-13 Bikram Misra , Biswajyoti Saha , Anubhav Sharma

A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…

Computational Complexity · Computer Science 2010-04-12 Hartmut Klauck

Computable Stein discrepancies have been deployed for a variety of applications, ranging from sampler selection in posterior inference to approximate Bayesian inference to goodness-of-fit testing. Existing convergence-determining Stein…

Machine Learning · Statistics 2021-10-12 Jonathan H. Huggins , Lester Mackey

Suppose we are given access to $n$ independent samples from distribution $\mu$ and we wish to output one of them with the goal of making the output distributed as close as possible to a target distribution $\nu$. In this work we show that…

Machine Learning · Statistics 2024-02-27 Adam Block , Yury Polyanskiy

Survey respondents may give untruthful answers to sensitive questions when asked directly. In recent years, researchers have turned to the list experiment (also known as the item count technique) to overcome this difficulty. While list…

Applications · Statistics 2014-06-03 Peter M. Aronow , Alexander Coppock , Forrest W. Crawford , Donald P. Green

The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures.…

Computational Complexity · Computer Science 2016-12-08 Karthik C. S. , Sébastien Tavenas

The main purpose of this paper is to introduce first a new family of empirical test statistics for testing a simple null hypothesis when the vector of parameters of interest are defined through a specific set of unbiased estimating…

Statistics Theory · Mathematics 2014-08-19 Narayanaswamy Balakrishnan , Nirian Martín , Leandro Pardo

We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also derived. Four different approaches are used: a classical…

Probability · Mathematics 2014-10-14 Louis H. Y. Chen , Hsien-Kuei Hwang , Vytas Zacharovas

Given a finite poset P, we consider the largest size La(n,P) of a family of subsets of $[n]:=\{1,...,n\}$ that contains no subposet P. This problem has been studied intensively in recent years, and it is conjectured that $\pi(P):=…

Combinatorics · Mathematics 2011-09-07 Jerrold R. Griggs , Wei-Tian Li , Linyuan Lu
‹ Prev 1 3 4 5 6 7 10 Next ›