Timeline for Number of vectors so that no two subset sums are equal
Current License: CC BY-SA 3.0
33 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
S Mar 9, 2014 at 19:16 | history | bounty ended | Simd | ||
S Mar 9, 2014 at 19:16 | history | notice removed | Simd | ||
Mar 9, 2014 at 19:16 | vote | accept | Simd | ||
Mar 2, 2014 at 22:06 | comment | added | Benjamin Dickman | Surely someone has put the conjectured values into OEIS by now and seen oeis.org/A214051: 1, 1, 2, 4, 5, 7, 9, 12, 14, 16, 19, 21, 24, 27, 29, 32... | |
S Mar 2, 2014 at 21:31 | history | bounty started | Simd | ||
S Mar 2, 2014 at 21:31 | history | notice added | Simd | Draw attention | |
Feb 25, 2014 at 8:47 | history | edited | Simd | CC BY-SA 3.0 |
added 52 characters in body
|
Feb 25, 2014 at 3:43 | answer | added | Brendan McKay | timeline score: 4 | |
Feb 24, 2014 at 17:45 | history | edited | Simd | CC BY-SA 3.0 |
added 13 characters in body
|
Feb 24, 2014 at 17:24 | history | edited | Simd | CC BY-SA 3.0 |
added 92 characters in body
|
Feb 24, 2014 at 15:47 | history | edited | Simd | CC BY-SA 3.0 |
added 52 characters in body
|
Feb 24, 2014 at 14:38 | history | edited | Simd | CC BY-SA 3.0 |
deleted 48 characters in body
|
Feb 24, 2014 at 14:32 | history | edited | Simd | CC BY-SA 3.0 |
deleted 48 characters in body
|
Feb 23, 2014 at 11:45 | comment | added | domotorp | I don't know what you get for 10, but you might want to check what this paper gives: tau.ac.il/~nogaa/PDFS/av1.pdf | |
Feb 22, 2014 at 21:28 | history | edited | Simd | CC BY-SA 3.0 |
added 46 characters in body
|
Feb 20, 2014 at 20:16 | history | edited | Simd | CC BY-SA 3.0 |
added 45 characters in body
|
Feb 19, 2014 at 17:45 | history | edited | Simd | CC BY-SA 3.0 |
added 163 characters in body
|
Feb 18, 2014 at 7:33 | answer | added | Oleg567 | timeline score: 3 | |
Feb 16, 2014 at 5:18 | comment | added | Brendan McKay | This question is also interesting if only subsets of a given fixed size are considered, rather than all subsets. | |
Feb 16, 2014 at 1:29 | comment | added | vzn | bears some resemblance to the subset sum problem from TCS have you heard of it? | |
Feb 16, 2014 at 0:43 | comment | added | user9072 | @vzn I assume the idea was only to stress that it is not modulo 2. | |
Feb 15, 2014 at 16:13 | comment | added | vzn | why addition over $\mathbb{R}$ and not $\mathbb{N}$ if all the elements are also in $\mathbb{N}$? | |
Feb 15, 2014 at 14:14 | history | edited | user9072 |
edited tags
|
|
Feb 15, 2014 at 13:45 | answer | added | Brendan McKay | timeline score: 10 | |
Feb 15, 2014 at 13:44 | answer | added | Seva | timeline score: 20 | |
Feb 15, 2014 at 13:24 | comment | added | Simd | @AlexDegtyarev Ah well that is not something I can judge for someone else :) If it helps motivate it, the equivalent question for integers rather than vectors has exercised such luminaries as Erdos and others. See e.g. ams.org/journals/proc/1996-124-12/S0002-9939-96-03653-2/… | |
Feb 15, 2014 at 13:22 | comment | added | Alex Degtyarev | To me, the distinction is that a puzzle is not worth investing too much effort :) | |
Feb 15, 2014 at 13:18 | comment | added | Simd | @AlexDegtyarev Really it's a puzzle at this point although maybe I don't fully understand the distinction. What I mean is that there is no greater goal than my interest in how one would solve the problem. I did however try smaller dimensions and my guess is that the optimal answer is no more than $20$. | |
Feb 15, 2014 at 12:32 | comment | added | Alex Degtyarev | Is this a puzzle or a problem? If it's a problem, did you try smaller dimensions? That might help to guess the pattern. | |
Feb 15, 2014 at 10:42 | history | edited | Simd | CC BY-SA 3.0 |
deleted 1 characters in body
|
Feb 15, 2014 at 9:31 | history | asked | Simd | CC BY-SA 3.0 |