Timeline for Counting lattice points on an n-simplex
Current License: CC BY-SA 2.5
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 6, 2010 at 1:28 | comment | added | Richard | Sam, thanks! I'm glad to see that I eventually found my way back to where you were pointing me. :) LattE is a pretty neat program. | |
Jan 6, 2010 at 1:21 | vote | accept | Richard | ||
Jan 6, 2010 at 1:21 | vote | accept | Richard | ||
Jan 6, 2010 at 1:21 | |||||
Jan 6, 2010 at 0:12 | comment | added | Sam Nead | Urk! Not my fault! I've added a hopefully more stable link to a better reference by the same person. :) | |
Jan 6, 2010 at 0:11 | history | edited | Sam Nead | CC BY-SA 2.5 |
added 202 characters in body
|
Jan 5, 2010 at 20:14 | comment | added | Ilya Nikokoshev | The link doesn't work for me! | |
Jan 3, 2010 at 19:25 | comment | added | Richard | As for 'S', my original problem specification described an example where one has a bag filled with marbles of certain (known) mass values, though the copy numbers of each marble type are unknown. A game is then played where you have to weigh the bag, obtaining a total weight 'S', and then decide whether: (1) you can exactly extrapolate the copy numbers of each marble type, or (2) how well you can extract probabilities for copy numbers. I wanted to know if there were analytical methods available to accomplish this and/or the most efficient algorithmic solution. | |
Jan 3, 2010 at 19:21 | comment | added | Richard | Fascinating about counting lattice points in polyhedra... thinking about it, that's exactly equivalent to my problem specification. As to your second point: I'm somewhat interested in the relationship between the 'precision' to which the real numbers (or integer sizes after a transformation) are known and the max(S) value for which this is a unique solution for [a_1, a_2, ..., a_n], however, I don't have a particular precision/integer size in mind. | |
Jan 3, 2010 at 0:04 | history | answered | Sam Nead | CC BY-SA 2.5 |