Finding large 3-free sets I: The small n case
نویسندگان
چکیده
منابع مشابه
Finding large 3-free sets I: The small n case
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch applications of large 3-free sets, present techniques to find large 3-free sets of {1, . . . , n} for n ≤ 250, and give empirical results obtained by codin...
متن کاملFinding Large Independent Sets
This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...
متن کاملFinding Small Stubborn Sets Automatically
State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.
متن کاملOn Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) such that every element of S is an element of X or is the the sum of two (non-necessarily distinct) elements of X. We give some elementary properties of 2-generating sets and prove that finding a minimum cardinality 2-generating set is ...
متن کاملFinding Groups in Large Data Sets
This paper aims to give an overview of methods to find groups in large data sets, such as household expenditure survey data. These methods are grouped in three: cluster analysis, dimension reduction and basic explorative methods. The emphasis is put on a critical analysis and potential drawbacks, especially of inputs that have to be provided by the researcher. These may impose some structure no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.06.002