On the complexity of computing integral bases of function fields

by   Simon Abelard, et al.

Let π’ž be a plane curve given by an equation f(x,y)=0 with f∈ K[x][y] a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field K(π’ž) and give new complexity bounds for three known algorithms dealing with this problem. For each algorithm, we study its subroutines and, when it is possible, we modify or replace them so as to take advantage of faster primitives. Then, we combine complexity results to derive an overall complexity estimate for each algorithm. In particular, we modify an algorithm due to BΓΆhm et al. and achieve a quasi-optimal runtime.


page 1

page 2

page 3

page 4

βˆ™ 10/23/2017

Symbolic Computations of First Integrals for Polynomial Vector Fields

In this article we show how to generalize to the Darbouxian, Liouvillian...
βˆ™ 08/05/2019

Sommerfeld type integrals for discrete diffraction problems

Three discrete problems for Helmholtz equation is studied analytically u...
βˆ™ 01/28/2019

On the Complexity of Computing the Topology of Real Algebraic Space Curves

In this paper, we present a deterministic algorithm to find a strong gen...
βˆ™ 07/24/2018

Constant-Delay Enumeration for Nondeterministic Document Spanners

We consider the information extraction approach known as document spanne...
βˆ™ 10/15/2015

Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity

The diagonal of a multivariate power series F is the univariate power se...
βˆ™ 02/04/2019

On the Complexity of Toric Ideals

We investigate the computational complexity of problems on toric ideals ...
βˆ™ 06/03/2016

The Complexity of Computing all Subfields of an Algebraic Number Field

For a finite separable field extension K/k, all subfields can be obtaine...

Please sign up or login with your details

Forgot password? Click here to reset