Timeline for Is there a non-perfect field in which polynomials of large degree are reducible?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27 at 20:30 | comment | added | LSpice | @WillSawin's answer in the comments to the edited question. | |
| Jun 27 at 20:05 | history | became hot network question | |||
| Jun 27 at 14:34 | comment | added | YCor | PS I see afterwards that this is already observed in comments to that question. So there is no follow-up question anymore. | |
| Jun 27 at 14:31 | comment | added | YCor | Will Sawin's answer being (duly) accepted, you should ask the follow-up ("edit") question separately. Nevertheless, it seems that any non-algebraically-closed, separably closed field would work (every polynomial of degree $>1$ coprime to $p$ is reducible). | |
| Jun 27 at 14:31 | history | edited | YCor | CC BY-SA 4.0 |
simplified formulation (non-perfect implies positive char)
|
| Jun 27 at 13:46 | vote | accept | Medo | ||
| Jun 27 at 13:44 | history | edited | Medo | CC BY-SA 4.0 |
added 51 characters in body
|
| Jun 27 at 13:26 | answer | added | Will Sawin | timeline score: 10 | |
| Jun 27 at 12:04 | history | edited | Medo | CC BY-SA 4.0 |
deleted 2 characters in body
|
| S Jun 27 at 12:02 | review | First questions | |||
| Jun 27 at 12:56 | |||||
| S Jun 27 at 12:02 | history | asked | Medo | CC BY-SA 4.0 |