Timeline for Sums of subsets of $\mathbb{Z}/n\mathbb{Z}$
Current License: CC BY-SA 2.5
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 30, 2016 at 18:57 | comment | added | benblumsmith | @EricNaslund - It is similar to Richard Stanley's solution below, but less clever. I had a polynomial based on roots of 1 whose coefficients give info about the desired numbers and which was obtainable a different way. | |
Oct 5, 2015 at 18:17 | vote | accept | benblumsmith | ||
Jul 11, 2014 at 1:47 | answer | added | Richard Stanley | timeline score: 6 | |
Jan 27, 2011 at 19:21 | vote | accept | benblumsmith | ||
Sep 4, 2012 at 17:30 | |||||
Jan 24, 2011 at 1:27 | comment | added | benblumsmith | Agreed, the size of $\{S(A,B)=x\}$ is constant on $x$ of the same order, for just the reason you say. The question is really about distribution across the order classes. My solution for prime $n$ is based on there being just 2 order classes. | |
Jan 23, 2011 at 20:38 | comment | added | user9072 | Reading this I got somewhat confused: is the question about the values of the function $f: \mathbb{Z}/n \mathbb{Z} \to \mathbb{N}_0$ where $f(x)$ is defined as the number of ways one can write $x$ in a specified particular form, or am I getting this wrong? If this is so, then in the prime case, it seems to me it should be constant on the non-zero elements, multiplying 'everything' by an appropriate non-zero element (preserving cardinality and disjointness of the sets). Likewise, for elements of the same order in general. Sorry, that this comment does not contribute to the actual question. | |
Jan 23, 2011 at 8:18 | answer | added | Thomas Bloom | timeline score: 7 | |
Jan 23, 2011 at 7:55 | history | edited | Thomas Bloom |
edited tags
|
|
Jan 23, 2011 at 3:19 | comment | added | Eric Naslund | What is your solution for $n$ prime? | |
Jan 23, 2011 at 2:54 | history | edited | Anthony Quas |
edited tags
|
|
Jan 23, 2011 at 1:01 | history | asked | benblumsmith | CC BY-SA 2.5 |