Timeline for Bijective function ℤ → ℤⁿ
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 4, 2017 at 7:44 | comment | added | Zgarb |
@Jonah I'm not sure. You could try to compute the array of all k-tuples with entries from i: x and sort it by the sum of absolute values, then index into that. The idea is that these arrays are prefixes of one "infinite array" that contains all k-tuples.
|
|
| Nov 4, 2017 at 1:34 | comment | added | Jonah |
This is beautiful. As a J programmer, do you know if there's a good way to convert a lazy list solution like this into J, which doesn't support them? ^:^:_ type solutions usually end up much more cumbersome...
|
|
| Nov 3, 2017 at 12:34 | comment | added | Zgarb | @EriktheOutgolfer Umm yeah, fixed now. | |
| Nov 3, 2017 at 12:34 | history | edited | Zgarb | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Nov 3, 2017 at 12:25 | comment | added | Erik the Outgolfer |
[[0,1,-1,..],[[0,1,-1,..],[[0,1,-1,..]] is this part supposed to be [[0,1,-1,..],[0,1,-1,..],[0,1,-1,..]]?
|
|
| Nov 3, 2017 at 11:00 | history | answered | Zgarb | CC BY-SA 3.0 |