Timeline for Concise formulation of set of equation systems
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 19, 2020 at 13:49 | history | suggested | Alex Ravsky | CC BY-SA 4.0 |
corrected a misprint
|
| Apr 19, 2020 at 12:21 | review | Suggested edits | |||
| S Apr 19, 2020 at 13:49 | |||||
| Sep 18, 2019 at 23:54 | vote | accept | Mario Krenn | ||
| S Sep 18, 2019 at 23:54 | history | bounty ended | Mario Krenn | ||
| S Sep 18, 2019 at 23:54 | history | notice removed | Mario Krenn | ||
| Sep 18, 2019 at 6:18 | answer | added | Michael Engelhardt | timeline score: 3 | |
| Sep 18, 2019 at 4:44 | comment | added | Mario Krenn | yes thats right. but if you can solve it for $n$ up to 26, and arbitrary $c$, i guess your representation would already be quite good :-). | |
| Sep 18, 2019 at 4:34 | comment | added | Michael Engelhardt | Oh, so you don't mean a literal alphabet, where there is an upper bound on $n$? You mean an arbitrarily long alphabet of letters $X_i $, $i$ integer? | |
| Sep 18, 2019 at 4:27 | history | edited | Mario Krenn | CC BY-SA 4.0 |
why infinite
|
| Sep 18, 2019 at 4:26 | comment | added | Mario Krenn | Because $n$ can be an arbitrary even number (and yes $c$ can become arbitrarily large), i specify that in the question now. thanks. | |
| Sep 18, 2019 at 3:51 | comment | added | Michael Engelhardt | Why do you call it an "infinite" set of equation systems? Because you'll ultimately increase $c$ without bound? | |
| S Sep 17, 2019 at 17:29 | history | bounty started | Mario Krenn | ||
| S Sep 17, 2019 at 17:29 | history | notice added | Mario Krenn | Draw attention | |
| Sep 15, 2019 at 22:26 | answer | added | Sheridan Grant | timeline score: 1 | |
| Sep 15, 2019 at 21:47 | history | edited | Mario Krenn | CC BY-SA 4.0 |
problem are indices.
|
| Sep 15, 2019 at 8:51 | history | edited | Mario Krenn | CC BY-SA 4.0 |
added graphs
|
| Sep 15, 2019 at 8:37 | history | asked | Mario Krenn | CC BY-SA 4.0 |