Timeline for Reducibility of polynomials maps
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 9, 2014 at 13:27 | vote | accept | joro | ||
| Dec 24, 2013 at 16:25 | history | edited | Joe Silverman |
Added the arithmetic-dynamics tag, since that's the most descriptive tag for this question.
|
|
| Dec 24, 2013 at 16:05 | answer | added | Joe Silverman | timeline score: 13 | |
| Dec 24, 2013 at 14:56 | history | edited | joro | CC BY-SA 3.0 |
Added Z[x]
|
| Dec 24, 2013 at 14:27 | comment | added | Sidney Raffer | Yes. In fact $x^2+1$ does the job. | |
| Dec 24, 2013 at 13:56 | comment | added | joro | @SJR the answer to your question appears to be yes, check the arxiv reference from my comment. | |
| Dec 24, 2013 at 13:54 | comment | added | joro | Related: arxiv.org/abs/1210.4127 Newly reducible iterates in families of quadratic polynomials | |
| Dec 24, 2013 at 13:30 | comment | added | Jason Starr | You guys should ask Michael Zieve. He has answered similar questions. | |
| Dec 24, 2013 at 13:22 | comment | added | Sidney Raffer | Do we actually know a non-linear polynomial $f(x)$ such that $f^n(x)$ is irreducible for all $n$? | |
| Dec 24, 2013 at 11:36 | comment | added | Sidney Raffer | Joro, I added a logic tag. | |
| Dec 24, 2013 at 11:35 | history | edited | Sidney Raffer |
edited tags
|
|
| Dec 24, 2013 at 10:31 | history | asked | joro | CC BY-SA 3.0 |