機率方法再組合學中的探討;The probabilistic method in additive combinatorics

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/68893

Title:	機率方法再組合學中的探討;The probabilistic method in additive combinatorics
Authors:	鍾明珈;Chung,Ming-chia
Contributors:	數學系
Keywords:	機率方法;The probabilistic method
Date:	2015-07-31
Issue Date:	2015-09-23 14:46:06 (UTC+8)
Publisher:	國立中央大學
Abstract:	機率方法又稱為Erdős 機率方法，用機率方法去建構一個合理性質的集合對組合學來說是很有用而且強大的，像是thin bases 。在這篇論文裡，我們探討和機率方法有關的內容，包含sum-free set, prime divisors, thin bases 還有 complementary bases。讓我們透過探討過程，了解論文中的內容以及定理間的關係。;The probabilistic method is also called Erdős probabilistic method. In combinatorics, the probabilistic method is powerful and useful for constructing sets with certain desirable properties (Example. thin bases of the integers). In this thesis we use probabilistic method to study sum-free set, prime divisors, thin bases and complementary bases to probing the probabilistic method.
Appears in Collections:	[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	516	View/Open

社群 sharing