Timeline for Computing Higher Order Tensor of Variable Rank
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 6, 2019 at 15:21 | comment | added | Henrik Schumacher | You're welcome! | |
| Aug 6, 2019 at 13:25 | comment | added | Pentaquark | Ah ok, gotcha. Thank you for your help! | |
| Aug 6, 2019 at 13:22 | comment | added | Henrik Schumacher |
The size of the output should actually only depend on ρ. So, if you write a function of ρ, you would set n = Log2[Length[ρ]] in the body of that function.
|
|
| Aug 6, 2019 at 13:15 | comment | added | Pentaquark | I'm sorry if I'm being dense here, but doesn't the fact that n is set to 4 define the length of the output string? Ideally, list_List should be an arbitary number of arguments, and the function returns the amount of arguments put into that list. | |
| Aug 6, 2019 at 13:07 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
added 167 characters in body
|
| Aug 6, 2019 at 13:04 | comment | added | Pentaquark | Thanks for your answer! Unfortunately, I seem to get a $RecursionLimit error when running this code | |
| Aug 6, 2019 at 12:47 | history | answered | Henrik Schumacher | CC BY-SA 4.0 |