A refinement of the Cameron-Erdős conjecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Refinement of the Cameron-erdős Conjecture

In this paper we study sum-free subsets of the set {1, . . . , n}, that is, subsets of the first n positive integers which contain no solution to the equation x+ y = z. Cameron and Erdős conjectured in 1990 that the number of such sets is O(2). This conjecture was confirmed by Green and, independently, by Sapozhenko. Here we prove a refined version of their theorem, by showing that the number o...

متن کامل

The Cameron–Erdős Conjecture

A subset A of the integers is said to be sum-free if there do not exist elements x, y, z ∈ A with x+y = z. It is shown that the number of sum-free subsets of {1, . . . , N} is O(2N/2), confirming a well-known conjecture of Cameron and Erdős.

متن کامل

Adjusting a conjecture of Erdős

We investigate a conjecture of Paul Erdős, the last unsolved problem among those proposed in his landmark paper [2]. The conjecture states that there exists an absolute constant C > 0 such that, if v1, . . . , vn are unit vectors in a Hilbert space, then at least C 2 n of all ∈ {−1, 1} are such that | Pn i=1 ivi |≤ 1. We disprove the conjecture. For Hilbert spaces of dimension d > 2, the counte...

متن کامل

A proof of the Cameron-Ku conjecture

A family of permutations A ⊂ Sn is said to be intersecting if any two permutations in A agree at some point, i.e. for any σ, π ∈ A, there is some i such that σ(i) = π(i). Deza and Frankl [3] showed that for such a family, |A| ≤ (n− 1)!. Cameron and Ku [2] showed that if equality holds then A = {σ ∈ Sn : σ(i) = j} for some i and j. They conjectured a ‘stability’ version of this result, namely th...

متن کامل

On the Cameron-Praeger conjecture

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no nontrivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v, k, λ) designs with λ = 1, except possibly when t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 2013

ISSN: 0024-6115

DOI: 10.1112/plms/pdt033