English
Related papers

Related papers: Direct Sum Testing: The General Case

200 papers

For functions defined via Dirichlet/generalized Dirichlet series in some half planes of the complex plane, we give a new simple elementary approach to obtain an Approximate Functional Equation(AFE for short) for the product of functions…

Number Theory · Mathematics 2009-02-02 V. V. Rane

If $f\in L^2(R^d)$ and if the function $f(x)f(y)$ is close in $L^2(R^{2d})$ norm to a radially symmetric function of $(x,y)$ then $f$ is close in $L^2$ norm to a centered Gaussian function. This is proved in a quantitative form with the…

Classical Analysis and ODEs · Mathematics 2015-06-02 Michael Christ

Given a Boolean function f on n variables, a Disjoint Sum-of-Products (DSOP) of f is a set of products (ANDs) of subsets of literals whose sum (OR) equals f, such that no two products cover the same minterm of f. DSOP forms are a special…

Discrete Mathematics · Computer Science 2012-04-25 Anna Bernasconi , Valentina Ciriani , Fabrizio Luccio , Linda Pagli

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

We present a family of sharpness examples for Falconer-type single dot product results. In particular, for $d\geq 2,$ for any $s<\frac{d+1}{2},$ we construct a Borel probability measure $\mu$ satisfying the energy estimate…

Classical Analysis and ODEs · Mathematics 2020-06-30 Alex Iosevich , Steven Senger

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

Number Theory · Mathematics 2025-10-24 Mayank Pandey , Maksym Radziwiłł

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor…

Machine Learning · Statistics 2018-06-21 Canyi Lu

Given a positive definite binary quadratic form f, let r(n) = |{(x,y): f(x,y)=n}| denote its representation function. In this paper we study linear correlations of these functions. For example, if r_1, ..., r_k are representation functions,…

Number Theory · Mathematics 2012-06-20 Lilian Matthiesen

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…

Numerical Analysis · Mathematics 2015-10-20 Avram Sidi

One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…

Information Theory · Computer Science 2012-08-27 G. David Forney, , Pascal O. Vontobel

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

Number Theory · Mathematics 2020-11-26 Olivier Bordellès

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

Number Theory · Mathematics 2019-09-23 Hamed Mousavi , Maxie D. Schmidt

This paper shows that certain $\,_{3}F_{4}$ hypergeometric functions may be expanded in sums of pair products of $\,_{2}F_{3}$ functions. This expands the class of hypergeometric functions having summation theorems beyond those expressible…

General Mathematics · Mathematics 2024-04-01 Jack C. Straton

This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…

General Mathematics · Mathematics 2014-07-29 N. A. Carella

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

Classical Analysis and ODEs · Mathematics 2010-03-29 Markus Mueller , Dierk Schleicher

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

Algebraic Geometry · Mathematics 2015-02-25 Weronika Buczyńska , Jarosław Buczyński , Johannes Kleppe , Zach Teitler

We give a strong direct sum theorem for computing $xor \circ g$. Specifically, we show that for every function g and every $k\geq 2$, the randomized query complexity of computing the xor of k instances of g satisfies…

Computational Complexity · Computer Science 2020-07-21 Joshua Brody , Jae Tak Kim , Peem Lerdputtipongporn , Hariharan Srinivasulu

In this paper we derive a new class of sum rules for products of the Bessel functions of first kind. Using standard algebraic manipulations we extend some of the well known properties of $J_n$. Some physical applications of the results are…

Mathematical Physics · Physics 2013-09-02 G. Bevilacqua , V. Biancalana , Y. Dancheva , T. Mansour , L. Moi

In this paper we establish a new formula for the arithmetic functions that verify $ f(n) = \sum_{d|n} g(d)$ where $g$ is also an arithmetic function. We prove the following identity, $$\forall n \in \mathbb{N}^*, \ \ \ f(n) = \sum_{k=1}^n…

General Mathematics · Mathematics 2020-09-15 Jason Akoun

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee