Construction and estimation of bases in function fields
The context of the present paper is inter alia an endeavour to sharpen the results of \textit{J. Coates} [Construction of rational functions on a curve, Proc. Camb. Philos. Soc. 68, 105--123 (1970; Zbl 0215.37302)] with a view to improving the bounds of \textit{A. Baker} and \textit{J. Coates} [Integer points on curves of genus 1, Proc. Camb. Philos. Soc. 67, 595--602 (1970; Zbl 0194.07601)]. An important tool in the present improved results is the author's sharpened bounds for the so-called Eisenstein constant [\textit{W. M. Schmidt}, Acta Arith. 56, 161--179 (1990; Zbl 0659.12003)] controlling the height of the coefficients in Puiseux expansions; in this context see also the bounds of \textit{B. M. Dwork} and the reviewer [The Eisenstein constant, Duke Math. J. 65, 23--43 (1992; Zbl 0770.11051)]. The reader will find a detailed and instructive discussion of the construction of bases of the Riemann-Roch space of a divisor \(D\) of the function field of a plane curve given by an equation \(F(x,y)=0\). When \(F\) has coefficients in a number field and the divisor is defined over that field, the author gives bounds, depending on the height and the degree of \(F\) for the archimedean as well as the non-archimedean absolute values of the Puiseux series of the constructed bases.
- Eisenstein's theorem on power series expansions of algebraic functions
- scientific article; zbMATH DE number 4118449 (Why is no real title available?)
- scientific article; zbMATH DE number 3308501 (Why is no real title available?)
- scientific article; zbMATH DE number 3342122 (Why is no real title available?)
- On Siegel's lemma
- Explicit Chevalley-Weil theorem for affine plane curves
- Integer points and models of algebraic curves
- Effective estimation of integer points of a family of algebraic curves
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Effective analysis of integral points on algebraic curves
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Genus computation of global function fields
- Quantitative Chevalley-Weil theorem for curves
- Factoring polynomials over global fields. I
- Factoring polynomials over global fields. II.
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Quasi-equivalence of heights in algebraic function fields of one variable
- Computation of integral bases
- Remarks on Eisenstein
- Fast lattice reduction for F₂-linear pseudorandom number generators
- The Mathematical Work of Wolfgang Schmidt
- A Lattice-Based Minimal Partial Realization Algorithm
- scientific article; zbMATH DE number 34788 (Why is no real title available?)
- Higher Newton polygons and integral bases
- Polynomials with roots modulo every integer
- An upper bound for the number of \(S\)-integral points on curves of genus zero
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
- scientific article; zbMATH DE number 3250683 (Why is no real title available?)
- scientific article; zbMATH DE number 3049510 (Why is no real title available?)
- Solving genus zero Diophantine equations over number fields
- Computation of triangular integral bases
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length
- Lattice basis reduction algorithms and multi-dimensional continued fractions
- Enumeration results on the joint linear complexity of multisequences
This page was built for publication: Construction and estimation of bases in function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179505)
