Solving norm equations in relative number fields using $S$-units
From MaRDI portal
Publication:4529720
DOI10.1090/S0025-5718-02-01309-1zbMath0990.11014OpenAlexW2040541934MaRDI QIDQ4529720
Publication date: 6 May 2002
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-02-01309-1
Computer solution of Diophantine equations (11Y50) Class numbers, class groups, discriminants (11R29) Multiplicative and norm form equations (11D57)
Related Items (13)
Minimizing representations over number fields. ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Computing Square Roots in Quaternion Algebras ⋮ Computing the Cassels–Tate pairing on 3-isogeny Selmer groups via cubic norm equations ⋮ Trivializing a central simple algebra of degree 4 over the rational numbers. ⋮ Writing representations over proper division subrings. ⋮ Integer circulant determinants of order 15 ⋮ Solving quadratic equations using reduced unimodular quadratic forms ⋮ Models of some genus one curves with applications to descent ⋮ On solving norm equations in global function fields ⋮ Isoclinism classes of Galois groups of number fields ⋮ Supersingular curves with small noninteger endomorphisms ⋮ Constructing abelian extensions with prescribed norms
Uses Software
Cites Work
- Über Normen algebraischer Zahlen. (On norms of algebraic numbers)
- An algorithm for finding an algebraic number whose norm is a given rational number.
- On solving relative norm equations in algebraic number fields
- Algorithmic methods for finitely generated Abelian groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving norm equations in relative number fields using $S$-units