Timeline for Number of vectors so that no two subset sums are equal
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2014 at 19:16 | history | bounty ended | Simd | ||
| Mar 9, 2014 at 19:16 | vote | accept | Simd | ||
| Feb 25, 2014 at 10:30 | comment | added | Brendan McKay | Say $P$ is a polynomial in $x$ and $y$. To make a sorted list of the coefficients: sort(subs(x=1,y=1,[op(expand(P))]),`>`). Then use add() to sum the first so many entries. | |
| Feb 25, 2014 at 9:38 | comment | added | Seva | Very nice! By a chance, do you use Maple? I wonder how with Maple can one find the sum of, say, 55 largest coefficients of a polynomial. | |
| Feb 25, 2014 at 4:11 | comment | added | Suvrit | The third sentence of the 1st para somehow reminds me of the sunflower conjecture and related stuff :-) | |
| Feb 25, 2014 at 3:43 | history | answered | Brendan McKay | CC BY-SA 3.0 |