Timeline for Largest cardinality $n$ of a subset $A$ of $\{1,2,\ldots,M\}$ such that $(A+A) \cap A$ is empty

11 events

when toggle format	what		by	license	comment
Dec 12, 2018 at 19:42	vote	accept	kodlu
Dec 12, 2018 at 15:19	answer	added	Seva		timeline score: 2
Dec 12, 2018 at 8:12	history	edited	kodlu	CC BY-SA 4.0	clarified the question, gave pointers to a related problem.
Dec 12, 2018 at 4:15	review	Close votes
Dec 14, 2018 at 20:30
Dec 12, 2018 at 2:19	history	edited	kodlu	CC BY-SA 4.0	fixed problem statement
Dec 12, 2018 at 0:26	comment	added	fedja		I mean, you already have $n\ge \frac 12 M$ with a trivial example. So what does your phrase about $M>n^a$ mean?
Dec 12, 2018 at 0:23	comment	added	kodlu		@fedja you're right, fixed typo in title. But it may well be hopeless.
Dec 12, 2018 at 0:22	history	edited	kodlu	CC BY-SA 4.0	edited title
Dec 12, 2018 at 0:17	comment	added	fedja		"Largest cardinality of an $n$-element subset" is $n$, isn't it? You definitely meant something more interesting than that. Also odd integers up to $M/2$ and all integers from $M/2$ to $M$ occupy quite a bit of space already, so if you look for a strong upper bound, it looks hopeless.
Dec 12, 2018 at 0:13	comment	added	user44191		Is this in reference to something? It seems to be discussing an earlier problem, but without linking the earlier problem, the language is unclear.
Dec 12, 2018 at 0:05	history	asked	kodlu	CC BY-SA 4.0