English
Related papers

Related papers: A Note on an Upper-Bound for the Sum of a Class K …

200 papers

In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…

Information Theory · Computer Science 2017-02-07 Farhad Shirani , S. Sandeep Pradhan

Double $L$-functions are the generalization of Dirichlet $L$-functions to two variable functions. We investigate the order estimation of double $L$-functions, and give upper bounds which are explicit in conductor aspect.

Number Theory · Mathematics 2023-12-05 Yuichiro Toma

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

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

Number Theory · Mathematics 2022-03-01 Joseph Burnett , Alex Taylor

In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…

Number Theory · Mathematics 2023-05-12 Jens Marklof , Matthew Welsh

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

Number Theory · Mathematics 2013-08-23 Omran Ahmadi , Igor E. Shparlinski

We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.

Number Theory · Mathematics 2012-01-13 Anne-Maria Ernvall-Hytönen

An approach to constructing an upper bound for the Riemann-Farey sum is described.

General Mathematics · Mathematics 2007-05-23 Scott B. Guthery

Upper and lower bounds are derived for the mode(s) of the negative binomial distribution of order k, type I, with parameters r and p, which are employed to establish an explicit formula for the mode(s) in terms of r and k when p equals 0.5.…

Probability · Mathematics 2017-02-09 Costas Georghiou , Andreas N. Philippou , Zaharias M. Psillakis

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

Number Theory · Mathematics 2007-05-23 Nils Hebbinghaus

We consider the class of all non-negative on $\mathbb{R_+}$ functions such that each of them satisfies the Reverse H\"older Inequality uniformly over all intervals with some constant the minimum value of which can be regarded as the…

Classical Analysis and ODEs · Mathematics 2018-10-16 Alina Shalukhina

Another approach to constructing an upper bound for the Riemann-Farey sum is described.

General Mathematics · Mathematics 2007-05-23 Scott B. Guthery

In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…

Classical Analysis and ODEs · Mathematics 2018-03-16 Tamás Forgács , Jack Luong , Joshua Williamson

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

Quantum Physics · Physics 2012-08-13 Aleksandrs Belovs , Robert Spalek

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

Combinatorics · Mathematics 2013-08-29 Robert Coulter , Steven Senger

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool…

Combinatorics · Mathematics 2014-10-07 Oliver Roche-Newton , Dmitry Zhelezov

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

Number Theory · Mathematics 2016-07-05 Robert J Betts

An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge…

Geometric Topology · Mathematics 2007-05-23 Gyo Taek Jin

We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…

Probability · Mathematics 2014-12-22 Matthias Löwe , Franck Vermet