English
Related papers

Related papers: New Direct Sum Tests

200 papers

We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a…

Classical Analysis and ODEs · Mathematics 2019-06-24 Dušan Pokorný , Luděk Zajíček

Let $\mathcal{A}$ denote the class of analytic functions in the unit disk $\mathbb{D}$ of the form $f(z)= z+\sum_{n=2}^{\infty}a_n z^n$ and $\mathcal{S}$ denote the class of functions $f\in\mathcal{A}$ which are univalent ({\it i.e.},…

Complex Variables · Mathematics 2020-06-16 Vasudevarao Allu , Abhishek Pandey

In this paper, we study the problems in the discrete Fourier transform (DFT) test included in NIST SP 800-22 released by the National Institute of Standards and Technology (NIST), which is a collection of tests for evaluating both physical…

Cryptography and Security · Computer Science 2018-03-08 Hiroki Okada , Ken Umeno

A {\it pure significance test} (PST) tests a simple null hypothesis $H_f:Y\sim f$ {\it without specifying an alternative hypothesis} by rejecting $H_f$ for {\it small} values of $f(Y)$. When the sample space supports a proper uniform pmf…

Statistics Theory · Mathematics 2024-04-23 Michael D. Perlman

Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approximating the number of relevant variables in the parity…

Machine Learning · Computer Science 2024-07-17 Nader H. Bshouty , George Haddad

In Direct Sum problems [KRW], one tries to show that for a given computational model, the complexity of computing a collection of finite functions on independent inputs is approximately the sum of their individual complexities. In this…

Computational Complexity · Computer Science 2016-11-17 Andrew Drucker

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Computational Complexity · Computer Science 2017-05-11 Shuichi Hirahara

We verify the Goldstone theorem in the Gaussian functional approximation to the $\phi^{4}$ theory with internal O(2) symmetry. We do so by reformulating the Gaussian approximation in terms of Schwinger-Dyson equations from which an explicit…

High Energy Physics - Theory · Physics 2009-09-25 V. Dmitrašinović , J. R. Shepard , J. A. McNeil

Sum-based global tests are highly popular in multiple hypothesis testing. In this paper we propose a general closed testing procedure for sum tests, which provides lower confidence bounds for the proportion of true discoveries (TDP),…

Methodology · Statistics 2023-04-21 Anna Vesely , Livio Finos , Jelle J. Goeman

We find exact identities for sums of the form \begin{equation*}\label{eq:convsumabs} \sum_{\stackrel{n_1+n_2 = n}{n_1 \in \mathbb{Z} \setminus \{ 0, n \} }} Q(n_1,n_2) \sigma_{-r_1}(n_1) \sigma_{-r_2}(n_2), \end{equation*} where…

Number Theory · Mathematics 2025-12-29 Ksenia Fedosova , Kim Klinger-Logan

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

General Mathematics · Mathematics 2019-01-01 Debayan Gupta , Mayuri Sridhar

Direct correlation functions (DCFs), linked to the second functional derivative of the free energy with respect to the one-particle density, play a fundamental role in a statistical mechanics description of matter. This holds in particular…

Soft Condensed Matter · Physics 2021-08-25 S. -C. Lin , M. Oettel , J. M. Hring , R. Haussmann , M. Fuchs , G. Kahl

The classical D'Alembert's Ratio Test is a powerful test that we learn from calculus to determine convergence for a series of positive terms. Its range of applicability and ease of computation makes this test extremely appealing. However,…

Classical Analysis and ODEs · Mathematics 2021-09-16 Edward Huynh

This article deals with two different problems in commutative algebra. In the first part, we give a proof of generalized forms of the Direct Summand Theorem (DST (or DCS)) for module-finite extension rings of mixed characteristic $R\subset…

Commutative Algebra · Mathematics 2017-08-14 Danny A. J. Gomez-Ramirez , Edisson Gallego , Juan D. Velez

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…

Computational Complexity · Computer Science 2024-02-19 Hugo Aaronson , Tom Gur , Ninad Rajgopal , Ron D. Rothblum

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

Classical Analysis and ODEs · Mathematics 2022-09-30 Zhi-Hong Sun

Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible mis-specification of the likelihood. Here we consider generalised Bayesian…

Methodology · Statistics 2022-01-12 Takuo Matsubara , Jeremias Knoblauch , François-Xavier Briol , Chris. J. Oates

The false discovery proportion (FDP) is a convenient way to account for false positives when a large number $m$ of tests are performed simultaneously. Romano and Wolf [Ann. Statist. 35 (2007) 1378-1408] have proposed a general principle…

Statistics Theory · Mathematics 2015-06-08 Sylvain Delattre , Etienne Roquain

This paper studies the problem of testing if an input (Gamma,*), where Gamma is a finite set of unknown size and * is a binary operation over Gamma given as an oracle, is close to a specified class of groups. Friedl et al. [Efficient…

Data Structures and Algorithms · Computer Science 2021-10-05 Francois Le Gall , Yuichi Yoshida