Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Prando, Rafael Froner, Speziali, Pietro
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2511.20316
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909924409212928
author Prando, Rafael Froner
Speziali, Pietro
author_facet Prando, Rafael Froner
Speziali, Pietro
contents Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from elliptic and Hermitian curves--typically meet this lower bound. In this paper, we construct, for every integer $n \geqslant 4$, a new family of lattices arising from the Fermat function field $F_n$ and the set of its $3n$ total inflection points. These lattices have rank $3n-1$, and we show that their minimum distance equals $\sqrt{2n}$, thereby exceeding the classical bound $\sqrt{2γ(F_n)} = \sqrt{2(n-1)}$. We also determine their kissing number, which turns out to be independent of $n$, and analyze the structure of the second shortest vectors. Our results provide the first explicit examples of function field lattices of arbitrarily large rank whose minimum distance surpasses the expected bound, offering new geometric features of potential interest for coding-theoretic and cryptographic applications.
format Preprint
id arxiv_https___arxiv_org_abs_2511_20316
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On lattices over Fermat function fields
Prando, Rafael Froner
Speziali, Pietro
Algebraic Geometry
Information Theory
Number Theory
14G50, 14H05, 94B27, 11H31, 52C07, 52C17
Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from elliptic and Hermitian curves--typically meet this lower bound. In this paper, we construct, for every integer $n \geqslant 4$, a new family of lattices arising from the Fermat function field $F_n$ and the set of its $3n$ total inflection points. These lattices have rank $3n-1$, and we show that their minimum distance equals $\sqrt{2n}$, thereby exceeding the classical bound $\sqrt{2γ(F_n)} = \sqrt{2(n-1)}$. We also determine their kissing number, which turns out to be independent of $n$, and analyze the structure of the second shortest vectors. Our results provide the first explicit examples of function field lattices of arbitrarily large rank whose minimum distance surpasses the expected bound, offering new geometric features of potential interest for coding-theoretic and cryptographic applications.
title On lattices over Fermat function fields
topic Algebraic Geometry
Information Theory
Number Theory
14G50, 14H05, 94B27, 11H31, 52C07, 52C17
url https://arxiv.org/abs/2511.20316