Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Computing the Length of Sum of Squares and Pythagoras Element in a Global Field
EN
This paper presents algorithms for computing the length of a sum of squares and a Pythagoras element in a global field K of characteristic different from 2. In the first part of the paper, we present algorithms for computing the length in a non-dyadic and dyadic (if K is a number field) completion of K. These two algorithms serve as subsidiary steps for computing lengths in global fields. In the second part of the paper we present a procedure for constructing an element whose length equals the Pythagoras number of a global field, termed a Pythagoras element.
2
Content available remote Intrinsic Factorization of Ideals in Dedekind Domains
EN
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of the ring of polynomials into the Dedekind domain in question.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.