کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4652161 | 1632588 | 2013 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Applications of the Erdős-Rado Canonical Ramsey Theorem to Erdős-Type Problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let {p1,…,pn}⊆Rd. We think of d≪n. How big is the largest subset X of points such that all of the distances determined by elements of are different? We show that X is at least . This is not the best known; however the technique is new.Assume that no 3 of the original points are in the line. How big is the largest subset X of points such that all of the areas determined by elements of are different? If d=2 then the the size is at least ; if d=3 then the size is at least .All of our proofs use variants of the canonical Ramsey theorem and some geometric lemmas.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 43, 5 September 2013, Pages 305-310
Journal: Electronic Notes in Discrete Mathematics - Volume 43, 5 September 2013, Pages 305-310