Construction and estimation of bases in function fields
From MaRDI portal
Publication:1179505
DOI10.1016/0022-314X(91)90044-CzbMath0764.11046OpenAlexW2066969977MaRDI QIDQ1179505
Publication date: 26 June 1992
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-314x(91)90044-c
heightdivisordegreePuiseux seriesEisenstein constantRiemann-Roch spacearchimedean absolute valuesconstruction of basesfunction field of a plane curvenon-archimedean absolute values
Arithmetic theory of algebraic function fields (11R58) Algebraic number theory: local fields (11S99) Algebraic functions and function fields in algebraic geometry (14H05)
Related Items
Computation of integral bases ⋮ Integer points and models of algebraic curves ⋮ Quantitative Chevalley-Weil theorem for curves ⋮ Effective analysis of integral points on algebraic curves ⋮ An upper bound for the number of $S$-integral points on curves of genus zero ⋮ Effective estimation of integer points of a family of algebraic curves ⋮ Solving genus zero Diophantine equations over number fields ⋮ Quasi-equivalence of heights in algebraic function fields of one variable ⋮ Computation of triangular integral bases ⋮ An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ The Mathematical Work of Wolfgang Schmidt ⋮ Higher Newton polygons and integral bases ⋮ Polynomials with roots modulo every integer ⋮ A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Factoring polynomials over global fields. I ⋮ Factoring polynomials over global fields. II. ⋮ On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators ⋮ Lattice basis reduction algorithms and multi-dimensional continued fractions ⋮ Genus computation of global function fields ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) ⋮ A Lattice-Based Minimal Partial Realization Algorithm ⋮ Unnamed Item ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Explicit Chevalley-Weil theorem for affine plane curves ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators ⋮ REMARKS ON EISENSTEIN ⋮ Computing Riemann-Roch spaces in algebraic function fields and related topics.
Cites Work
This page was built for publication: Construction and estimation of bases in function fields
