𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On A Problem of Erdős and Turán and Some Related Results

✍ Scribed by N. Alon; M.N. Kolountzakis

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
315 KB
Volume
55
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We employ the probabilistic method to prove a stronger version of a result of Helm, related to a conjecture of Erdos and Turan about additive bases of the positive integers. We show that for a class of random sequences of positive integers (A), which satisfy (|A \cap[1, x]| \gg \sqrt{x}) with probability 1 , all integers in any interval ([1, N]) can be written in at least (c_{1} \log N) and at most (c_{2} \log N) ways as a difference of elements of (A \cap\left[1, N^{2}\right]). We also prove several results related to another result of Helm. We show that for every sequence of positive integers (M), with counting function (M(x)), there is always another sequence of positive integers (A) such that (M \cap(A-A)=\varnothing) and (\boldsymbol{A}(x)>x /(M(x)+1)). We also show that this result is essentially best possible, and we show how to construct a sequence (A) with (A(x)>) (c /(M(x)+1)) for which every element of (M) is represented exactly as many times as we wish as a difference of elements of (A). 1995 Academic Press. Inc.

📜 SIMILAR VOLUMES

On an Inequality of Erdős and Turán Conc
On an Inequality of Erdős and Turán Concerning Uniform Distribution Modulo One, II
✍ I.Z. Ruzsa 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 126 KB

A famous inequality of Erdös and Turán estimates the discrepancy \(\Delta\) of a finite sequence of real numbers by the quantity \(B=\min _{K} K^{-1}+\sum_{k=1}^{K-1}\left|\alpha_{k}\right| / k\), where the \(\alpha_{k}\) are the Fourier coefficients. We investigate how bad this estimate can be. We

On a Problem of Erdős and Sárközy
On a Problem of Erdős and Sárközy
✍ Tomasz Schoen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i

On Some Problems of P. Turán Concerning
On Some Problems of P. Turán Concerning Lm Extremal Polynomials and Quadrature Formulas
✍ Ying Guang Shi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The L m extremal polynomials in an explicit form with respect to the weights (1&x) &1Â2 (1+x) (m&1)Â2 and (1&x) (m&1)Â2 (1+x) &1Â2 for even m are given. Also, an explicit representation for the Cotes numbers of the corresponding Tura n quadrature formulas and their asymptotic behavior is provided. 1

Proof of a Conjecture of Bollobás and Ko
Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem
✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

A Ramsey-type problem and the Turán numb
A Ramsey-type problem and the Turán numbers
✍ N. Alon; P. Erdős; D. S. Gunderson; M. Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract For each __n__ and __k__, we examine bounds on the largest number __m__ so that for any __k__‐coloring of the edges of __K~n~__ there exists a copy of __K~m~__ whose edges receive at most __k−__1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$, the largest value of __m__ i

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that