Abstract

We study the arithmetic of bitangents of smooth quartics over global fields. With the aid of computer algebra systems and using Elsenhans--Jahnel's results on the inverse Galois problem for bitangents, we show that, over any global field of characteristic different from $2$, there exist smooth quartics which have bitangents over every local field, but do not have bitangents over the global field. We give an algorithm to find such quartics explicitly, and give an example over $\mathbb{Q}$. We also discuss a similar problem concerning symmetric determinantal representations. This paper is a summary of the first author's talk at the JSIAM JANT workshop on algorithmic number theory in March 2019. Details will appear elsewhere.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.