Timeline for Number of prime factors of a polynomial discriminant
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2023 at 20:27 | vote | accept | Nicolas Banks | ||
| Jul 16, 2023 at 14:54 | answer | added | Will Sawin | timeline score: 3 | |
| Jul 15, 2023 at 3:03 | history | edited | Nicolas Banks | CC BY-SA 4.0 |
added 27 characters in body
|
| Jul 15, 2023 at 3:02 | comment | added | Nicolas Banks | @WillSawin upper bounds, yes. Basically I want to estimate how many such polynomials might fail Hensel’s lemma. | |
| Jul 15, 2023 at 2:30 | comment | added | Will Sawin | The answer depends on $f$ - are you asking for lower and upper bounds? I guess one expects the best lower bound for the number of prime factors is $1$ so the main question would be upper bounds. | |
| Jul 14, 2023 at 21:33 | history | edited | Nicolas Banks | CC BY-SA 4.0 |
added 2 characters in body
|
| Jul 14, 2023 at 19:25 | history | edited | Nicolas Banks | CC BY-SA 4.0 |
added 37 characters in body
|
| Jul 14, 2023 at 18:54 | history | asked | Nicolas Banks | CC BY-SA 4.0 |