Holes in the Infrastructure of Global Hyperelliptic Function Fields
Felix Fontein

TL;DR
This paper provides an explicit formula and bounds for the number of 'holes' in the infrastructure of hyperelliptic function fields, confirming a conjecture and analyzing the asymptotic size of holes.
Contribution
It derives an explicit formula for the number of holes in hyperelliptic function fields and proves a special case of a conjecture regarding their distribution.
Findings
The number of holes approximates n'/q with bounded error.
An explicit formula for holes depends only on infinite places and L-polynomial coefficients.
Asymptotic size of a hole near a reduced divisor behaves like n^{g - deg D}/(g - deg D)!.
Abstract
We prove that the number of "hole elements" in the infrastructure of a hyperelliptic function field of genus with finite constant field with places at infinity, of whom are of degree one, satisfies We obtain an explicit formula for the number of holes using only information on the infinite places and the coefficients of the -polynomial of the hyperelliptic function field. This proves a special case of a conjecture by E. Landquist and the author on the number of holes of an infrastructure of a global function field. Moreover, we investigate the size of a hole in case , and show that asymptotically for , the size of a hole next to a reduced divisor behaves like the function .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Cryptography and Residue Arithmetic
