Timeline for Functions representing all strings somewhere
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23 at 0:51 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |
added 127 characters in body
|
| May 22 at 19:55 | comment | added | Bjørn Kjos-Hanssen | @ChristianRemling that sounds good! The next question would be, can you use polynomials? I expect not, of course. | |
| May 22 at 19:46 | comment | added | Christian Remling | If I grasped this correctly, then for any given $n,\sigma$, one can satisfy this at a predetermined $x$ by manipulating $f_j$ at only finitely many points. Let's say $n=2$, $\sigma =00$, $x=0$. Then we could set $f_0(0)=1$, $f_0(1)=2$, $f_1(0)=3$, $f_0(3)=4$, $f_1(3)=5$. The point is to never reuse values. Since for any discrete set (here, the integers), there is an entire function that takes any prescribed values on that set, we can make $f_j$ entire. | |
| May 22 at 19:22 | history | edited | Bjørn Kjos-Hanssen |
edited tags
|
|
| May 22 at 19:03 | history | asked | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |