1
$\begingroup$

What efficient algorithms are there to compute the $S$-units of a given imaginary quadratic field $K$, where $S$ is a finite set of non-archimedean primes?

Computing $S$-units are implemented in computer algebra software like Sage and Pari. But they are implemented only in general for number fields (as far as I know), I would like to use an algorithm specialized for imaginary quadratic fields in case it could improve efficiency.

Please let me know if such an algorithm is implemented somewhere or if such an algorithm is known to exist.

$\endgroup$
1
  • $\begingroup$ Why are you so sure that there should exist specifically optimized algorithms for the imaginary quadratic case? $\endgroup$ Aug 9, 2022 at 21:32

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.