Timeline for What are the best current bounds on $\times a \times b$?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2018 at 18:42 | comment | added | Asaf | Bourgain (in his EMS conference paper) mentions that studying the order of $<2,3>$ mod $p$ is a challenging problem. | |
| Jun 15, 2018 at 18:42 | comment | added | Asaf | The constants $\kappa,\kappa'$ are very explicit, and can be deduced from the computation done in the paper (they are computed explicitly from some constants appearing in Baker's inequality). The bound itself have not been improved (to the best of my knowledge), nevertheless, if the order of $<a,b>$ is large, the famous exponential sum estimate of Bourgain-Konyagin-Gilbichuk gives you much better rates. People believe the later is the correct one, but the iterated log estimates in the BLMV paper follows from Baker's, which is essentially sharp, so definitely some new ingredients are needed. | |
| Jun 7, 2017 at 22:11 | history | edited | YCor | CC BY-SA 3.0 |
added full reference info; added tags; fixed initial assumption; avoided "if" for setup.
|
| Jun 7, 2017 at 17:36 | history | edited | john mangual | CC BY-SA 3.0 |
added reference
|
| Jun 7, 2017 at 16:04 | history | asked | john mangual | CC BY-SA 3.0 |