An Elementary Approach to Subresultants Theory

El Kahoui, M'hammed

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

An Elementary Approach to Subresultants Theory

MPS-Authors

/persons/resource/persons44379

El Kahoui, M'hammed
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

El Kahoui, M. (2003). An Elementary Approach to Subresultants Theory. Journal of Symbolic Computation, 35(3), 281-292.

引用: https://hdl.handle.net/11858/00-001M-0000-0019-EBCB-4

要旨

In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of the known results of subresultants are recovered, some with more precision, without using Euclidean divisions or existence of roots for univariate polynomials. The main contributions of this paper are not new results on subresultants, but rather extensions of the main results over integral rings to arbitrary commutative rings.