Timeline for Are there enough additive permutations?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 14, 2015 at 21:42 | comment | added | Gerhard Paseman | I found the Bennett and Potts reference online, and they have effectively answered 3) and 4), except for the enumeration bit. I still think this approach deserves further reflection, but I am not first on the scene. There are connections to Costas arrays and other combinatorics to. Also, I haven't verified my "payoff" yet, so I may have to retract. Gerhard "Will Make The Computer Count" Paseman, 2015.07.14 | |
| Jul 13, 2015 at 17:02 | comment | added | Gerhard Paseman | Indeed, Golomb and Taylor in dealing with a more specific construct (hexagonal arrays) have considered this bijection and related problems, and refer to an older paper. Although I would appreciate other references answering 3) or 4), I still hope for more attempts at enumeration. Gerhard "Just Asking For The World" Paseman, 2015.07.13 | |
| Jul 13, 2015 at 1:00 | comment | added | Gerhard Paseman | It seems that one reference is arxiv.org/abs/0911.2384 on Honeycomb arrays. I would appreciate learning more, as I think question 4) still has not been answered regarding enumeration. Gerhard "Still Learning This Internet Thing" Paseman, 2015.07.12 | |
| Jul 12, 2015 at 23:58 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |