Timeline for Number of partitions of a number on a combinatorial bracelet
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 23, 2011 at 16:14 | vote | accept | Nemanja | ||
Jun 23, 2011 at 15:40 | answer | added | Douglas Zare | timeline score: 7 | |
Jun 23, 2011 at 15:14 | answer | added | Gerhard Paseman | timeline score: 3 | |
Jun 23, 2011 at 12:43 | history | edited | Nemanja | CC BY-SA 3.0 |
added 101 characters in body
|
Jun 23, 2011 at 12:37 | comment | added | Nemanja | Yes, I meant positive integers. Sorry for not being clear. And yes, Gerry, that is the right definition of a bracelet. | |
Jun 23, 2011 at 12:36 | history | edited | Nemanja | CC BY-SA 3.0 |
added 63 characters in body
|
Jun 23, 2011 at 4:01 | comment | added | Steve Huntsman | mathoverflow.net/questions/12214/… | |
Jun 22, 2011 at 23:54 | comment | added | Gerry Myerson | The term "combinatorial bracelet" is not defined, or used, at the link. I take it you want to put (positive?) intgers around a circle, adding up to $N$, with two arrangements considered equivalent if you can get from one to the other via rotation or reflection. My advice would be to calculate the answer for some small values of $N$, then look it up in the Online Encyclopedia of Integer Sequences. | |
Jun 22, 2011 at 23:52 | comment | added | Gerhard Paseman | Infinitely many, if there is no positivity requirement. Gerhard "Email Me About System Design" Paseman, 2011.06.22 | |
Jun 22, 2011 at 23:52 | comment | added | user9072 | When you say 'integers', do you mean 'positive integers'; or is there another additional condition? | |
Jun 22, 2011 at 23:35 | history | asked | Nemanja | CC BY-SA 3.0 |