English
Related papers

Related papers: On a problem of Dobrowolski--Williams

200 papers

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

Number Theory · Mathematics 2020-07-31 I. E. Shparlinski , C. L. Stewart

We prove a new bound to the exponential sum of the form $$ \sum_{h \sim H}\delta_h \mathop{\sum_{m\sim M}\sum_{n\sim N}}_{mn\sim x}a_{m}b_{n}\e\big(\alpha mn + h(mn + u)^{\gamma}\big), $$ by a new approach to the Type I sum. The sum can be…

Number Theory · Mathematics 2025-12-10 Li Lu , Lingyu Guo , Victor Z. Guo

We improve recent results of D. Gomez and A. Winterhof (2010) and of A. Ostafe and I. E. Shparlinski (2011) on the Waring problem with Dickson polynomials in the case of prime finite fields. Our approach is based on recent bounds of…

Number Theory · Mathematics 2024-10-14 Igor E. Shparlinski , José Felipe Voloch

The well-known Bennett-Hoeffding bound for sums of independent random variables is refined, by taking into account truncated third moments, and at that also improved by using, instead of the class of all increasing exponential functions,…

Probability · Mathematics 2017-01-17 Iosif Pinelis

We present new infinite arctangent sums and infinite sums of products of arctangents. Many previously known evaluations appear as special cases of the general results derived in this paper.

Number Theory · Mathematics 2017-11-17 Kunle Adegoke

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

Classical Analysis and ODEs · Mathematics 2020-01-06 Patrick Kidger

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

Number Theory · Mathematics 2015-06-08 Marc Munsch , Igor E. Shparlinski

Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.

Classical Analysis and ODEs · Mathematics 2013-07-16 Eugene Bravyi

Theta sums are finite exponential sums with a quadratic form in the oscillatory phase. This paper establishes new upper bounds for theta sums in the case of smooth and box truncations. This generalises a classic 1977 result of Fiedler,…

Number Theory · Mathematics 2022-03-23 Jens Marklof , Matthew Welsh

This note addresses the continuum problem, taking advantage of the breakthrough mentioned in the subtitle, and relating it to many recent advances occurring in set theory.

Logic · Mathematics 2023-05-18 Matteo Viale

In this paper, new upper and lower bounds for the Trapezoid inequality of absolutely continuous functions are obtained. Applications to some special means are provided as well.

Classical Analysis and ODEs · Mathematics 2014-11-06 Mohammad W. Alomari

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

Data Structures and Algorithms · Computer Science 2012-03-01 Bin Fu , Wenfeng Li , Zhiyong Peng

Motivated by recent results, we study sums of the form $S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor \right)$, where $f$ is an arithmetic function and $\left\lfloor\cdot\right\rfloor$ denotes the greatest integer…

Number Theory · Mathematics 2021-06-29 Joshua Stucky

By use of a modified Nunokawa's lemma, we obtain some new conditions for univalence. Also, some sharp inequalities concerning univalent functions are presented.

Complex Variables · Mathematics 2018-12-20 M. M. Motamedinezhad , R. Kargar

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings $\mathcal{R}$ of order $q^r$ which generalize recent results given by Hegyv\'ari and Hennecart (2013).…

Number Theory · Mathematics 2016-11-22 Le Quang Ham , Thang Pham , Le Anh Vinh

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Number Theory · Mathematics 2024-08-21 Chenhao Du , Qingfeng Sun

We establish upper bounds for moments of zeta sums using results on shifted moments of the Riemann zeta function under the Riemann hypothesis.

Number Theory · Mathematics 2024-05-22 Peng Gao

New lower bounds involving sum, difference, product, and ratio sets for $A\subset \C$ are given.

Combinatorics · Mathematics 2011-11-22 Misha Rudnev

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

Combinatorics · Mathematics 2021-10-13 Jie Ma , Tianchi Yang