✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Moreover, we estimate β1(F) for each such tower.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Let F = (Fn)n≥0 be a quadratic recursive tower of algebraic function fields over the finite field F2 , i.e.
📊
Temel Bulgular & Veri:F is a recursive tower such that [Fn : Fn−1] = 2 for all n ≥ 1.
💡
Sonuç & Katkı:Moreover, we estimate β1(F) for each such tower.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
Let F = (Fn)n≥0 be a quadratic recursive tower of algebraic function fields over the finite field F2 , i.e. F is a recursive tower such that [Fn : Fn−1] = 2 for all n ≥ 1. For any integer r ≥ 1, let βr(F) := limn→∞ Br(Fn)/g(Fn), where Br(Fn) is the number of places of degree r and g(Fn) is the genus, respectively, of Fn/F2 . In this paper we give a classification of all rational functions f(X, Y ) ∈ F2(X, Y ) that may define a quadratic recursive tower F over F2 with at least one positive invariant βr(F). Moreover, we estimate β1(F) for each such tower.
🔖
Bu Makaleye Atıf Yap
TUTDERE, S., STICHTENOTH, H. (2022). Quadratic recursive towers of function fields over F2. Turkish Journal of Mathematics, Cilt: 39 - Sayı: 5, 665–682. https://ajindex.com/articles/608226