English
Related papers

Related papers: Higher convexity and iterated sum sets

200 papers

For $\lambda \in \mathbb{Z}$, let $\lambda \cdot A = \{ \lambda a : a \in A\}$. Suppose $r, h\in \mathbb{Z}$ are sufficiently large and comparable to each other. We prove that if $|A+A| \le K |A|$ and $\lambda_1, \ldots, \lambda_h \le 2^r$,…

Combinatorics · Mathematics 2017-08-29 Albert Bush , Yi Zhao

The slowly converging series sum_{k=3}^infinity 1/[k * log k * (log log k)^a] is evaluated to 38.4067680928 at a=2. After some initial terms, the infinite tail of the sum is replaced by the integral of the associated interpolating function,…

Numerical Analysis · Mathematics 2021-06-25 Richard J. Mathar

Often topological classes of one-dimensional dynamical systems are finite codimension smooth manifolds. We describe a method to prove this sort of statement that we believe can be applied in many settings. In this work we will implement it…

Dynamical Systems · Mathematics 2021-04-13 Clodoaldo Grotta-Ragazzo , Daniel Smania

The \emph{sum-product phenomenon} predicts that a finite set $A$ in a ring $R$ should have either a large sumset $A+A$ or large product set $A \cdot A$ unless it is in some sense "close" to a finite subring of $R$. This phenomenon has been…

Combinatorics · Mathematics 2009-02-23 Terence Tao

We provide an asymptotic estimate for certain sums over k-free integers with small prime factors. These sums depend upon a complex parameter \alpha and involve a smooth cut-off f. They are a variation of several classical number-theoretical…

Number Theory · Mathematics 2013-10-07 Francesco Cellarosi

We represent the sums $\sum_{k=0}^{n-1}{n \choose k}^{-2}$, $\sum_{k=0}^m{m\choose k}^{-1}{a\choose n-k}^{-1}$, $\sum_{k=0}^{n-1}\frac{q^{-k(k-1)}}{{\genfrac{[}{]}{0pt}{}{n}{k}}_q}$, and the sum of the reciprocals of the summands in Dixon's…

Combinatorics · Mathematics 2009-09-12 Moa Apagodu , Doron Zeilberger

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Number Theory · Mathematics 2013-08-06 Renling Jin

The purpose of this paper is to show that functions that derivate the two-variable product function and one of the exponential, trigonometric or hyperbolic functions are also standard derivations. The more general problem considered is to…

Classical Analysis and ODEs · Mathematics 2019-04-30 Richárd Grünwald , Zsolt Páles

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

Number Theory · Mathematics 2018-07-17 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen

We study Birkhoff sums S(k,a) = g(a)+g(2a)+...+g(ka) at the golden mean rotation number a with periodic continued fraction approximations p(n)/q(n), where g(x) = log(2-2 cos(2 pi x). The summation of such quantities with logarithmic…

Dynamical Systems · Mathematics 2015-05-19 Oliver Knill , Folkert Tangerman

Explicit expressions for the hypergeometric series ${}_2F_1(-n, a; 2a\pm j;2)$ and ${}_2F_1(-n, a; -2n\pm j;2)$ for positive integer $n$ and arbitrary integer $j$ are obtained with the help of generalizations of Kummer's second and third…

Complex Variables · Mathematics 2014-04-01 Y S Kim , A K Rathie , R B Paris

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Combinatorics · Mathematics 2019-12-11 Imre Ruzsa , George Shakan , Jozsef Solymosi , Endre Szemerédi

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We consider functions of the type $f(z)=z+a_2z^2+a_3z^3+\cdots$ from a family of all analytic and univalent functions in the unit disk. Let $F$ be the inverse function of $f$, given by $F(z)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

Complex Variables · Mathematics 2021-11-02 Vasudevarao Allu , Vibhuti Arora

A conjecture of Erd\H{o}s states that for any infinite set $A \subseteq \mathbb R$, there exists $E \subseteq \mathbb R$ of positive Lebesgue measure that does not contain any nontrivial affine copy of $A$. The conjecture remains open for…

Classical Analysis and ODEs · Mathematics 2022-04-28 Angel Cruz , Chun-Kit Lai , Malabika Pramanik

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Classical Analysis and ODEs · Mathematics 2025-11-19 András Máthé , William O'Regan

In this article, we improve the convergence order of some finite volume solutions approximating some second order elliptic problems. We prove that finite volume approximations of order $O(h^{k+1})$, with $k$ integer, can be obtained after…

Numerical Analysis · Mathematics 2007-05-23 Bilal Atfeh , Abdallah Bradji

Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…

Number Theory · Mathematics 2008-12-16 M. Z. Garaev , Chun-Yen Shen