English
Related papers

Related papers: Sums of arithmetic functions over values of binary…

200 papers

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson , Kevin O'Bryant , Brooke Orosz , Imre Ruzsa , Manuel Silva

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.

Number Theory · Mathematics 2009-09-25 Andrew Granville , K. Soundararajan

We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.

Number Theory · Mathematics 2019-05-09 John Friedlander , Henryk Iwaniec

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

Using probability theory we derive an expression for the sum of a series of definite integrals involving upper incomplete Gamma functions. In the proof, a normal variance mixture distribution with Beta mixing distributions plays a crucial…

Classical Analysis and ODEs · Mathematics 2025-09-16 Matyas Barczy , István Mező

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

Number Theory · Mathematics 2011-11-15 Karin Halupczok , Benjamin Suger

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Mathematical Physics · Physics 2007-05-23 Mark W. Coffey

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

Data Structures and Algorithms · Computer Science 2012-08-21 Igor S. Sergeev

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

Number Theory · Mathematics 2021-12-01 Taekyun Kim , Dae San Kim , Hyunseok Kwon , Jongkyum Kwon

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

Number Theory · Mathematics 2015-04-01 Francesco Monopoli

We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…

Logic · Mathematics 2021-08-27 Emanuele Bottazzi , Monroe Eskew

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

Number Theory · Mathematics 2018-04-18 Daniele Mastrostefano

Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…

Number Theory · Mathematics 2012-02-10 Maarten Kronenburg

The lower and upper bounds are found for the leading term of summatory totient function $\sum_{k\leq N}k^u\phi^v(k)$ in various ranges of $u\in{\mathbb R}$ and $v\in{\mathbb Z}$.

Number Theory · Mathematics 2008-02-11 Leonid G. Fel

We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.

Number Theory · Mathematics 2024-12-17 Eugen J. Ionascu , Florian Luca , Thomas Merino

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

History and Overview · Mathematics 2021-04-27 Lorenzo David

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

Motivated by the study of systems of higher order boundary value problems with functional boundary conditions, we discuss, by topological methods, the solvability of a fairly general class of systems of perturbed Hammerstein integral…

Classical Analysis and ODEs · Mathematics 2021-02-09 Gennaro Infante