Timeline for Solving a Eigenvalue Problem
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2021 at 9:27 | history | edited | Roman | CC BY-SA 4.0 |
added 2 characters in body
|
| Feb 25, 2021 at 8:56 | history | edited | Roman | CC BY-SA 4.0 |
added 1347 characters in body
|
| Feb 16, 2021 at 9:31 | comment | added | Roman | Sorry, this is not the right place for an introduction to generating functions or Jacobi theta functions. | |
| Feb 16, 2021 at 8:32 | comment | added | Roman |
We should work with the generating function explicitly because it gives a very efficient recipe, especially in the high-dimensional case. Just look at the given example for the 17-dimensional hypercube: manually summing and counting is going to be very tedious and difficult, whereas the call to m[17, 1000] takes less than half a second. The same is true, to some extent, for your case $d=2$ when you work with large values of $\lambda$.
|
|
| Feb 16, 2021 at 7:49 | history | edited | Roman | CC BY-SA 4.0 |
added 472 characters in body
|
| Feb 16, 2021 at 7:01 | vote | accept | user2022 | ||
| Feb 15, 2021 at 19:01 | history | answered | Roman | CC BY-SA 4.0 |