Timeline for Sum of $n$ vectors in $(\mathbb Z/n)^k$
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2022 at 16:27 | comment | added | Roland Bacher | I got a bit confused by the notations $\mathbb Z/n$ and $\mathbb Z/(n)$. Perhaps better: Given two strictly positive integers $n,k$, find the smallest integer $N\geq n$ such that every set of $N$ elements in $\mathbb Z^k$ contains a subset of $n$ elements with sum in $n\mathbb Z^k$. | |
| Dec 3, 2016 at 9:04 | review | Suggested edits | |||
| Dec 3, 2016 at 9:30 | |||||
| Oct 19, 2013 at 0:27 | history | edited | S. Carnahan♦ | CC BY-SA 3.0 |
appended answer 7893 as supplemental
|
| Jan 26, 2010 at 7:38 | answer | added | Douglas Zare | timeline score: 6 | |
| Dec 5, 2009 at 23:54 | comment | added | Ilya Nikokoshev |
Indeed, the same example has no size n-1 subsets summing to 0 vector, which explains why the problem is about size n subsets.
|
|
| Dec 5, 2009 at 20:16 | vote | accept | Hailong Dao | ||
| Dec 5, 2009 at 20:03 | answer | added | Ricky Liu | timeline score: 11 | |
| Dec 5, 2009 at 19:52 | answer | added | Gil Kalai | timeline score: 3 | |
| Dec 5, 2009 at 19:51 | answer | added | Kevin O'Bryant | timeline score: 3 | |
| Dec 5, 2009 at 19:32 | answer | added | Kristal Cantwell | timeline score: 1 | |
| Dec 5, 2009 at 18:31 | answer | added | Reid Barton | timeline score: 7 | |
| Dec 5, 2009 at 18:29 | comment | added | Anton Geraschenko | @José: I think the lowercase n is correct. It's slightly long, but a good title would be, "Minimum N st any size N set in (Z/n)^k has a size n subset summing to 0." | |
| Dec 5, 2009 at 18:18 | comment | added | José Figueroa-O'Farrill | In the title of the question, don't you mean the sum of $N$ (not $n$) vectors? | |
| Dec 5, 2009 at 18:14 | history | asked | Hailong Dao | CC BY-SA 2.5 |