منابع مشابه
Cyclic resultants
Let k be a field of characteristic zero and let f ∈ k[x]. The m-th cyclic resultant of f is rm = Res(f, x − 1). We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial f of degree d, there are exactly 2 distinct degree d polynomials with the same set of cyclic resultants as f . However, in the generic monic case, degree d polynomials are uniqu...
متن کاملPolynomial Resultants
This paper covers various aspects of the resultant of polynomials. Starting with a definition, we move to a practical method of calculating the resultant, specifically through the use of the Sylvester matrix, whose entries are the coefficients of the two polynomials, and whose determinant gives the resultant of two polynomials. We focus on whether or not two univariate polynomials have a common...
متن کاملResultants of determinantal varieties
In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very ample vector bundle [GKZ94], it corresponds to a necessary and sufficient condition so that a given morphism between two vector bundles on a projective variety ...
متن کاملResultants Semantics for Prolog
In this paper we study some rst order formulas, called resultants, which can be used to describe in a concise way most of the relevant information associated to SLD-derivations. We rst extend to resultants some classical results of logic programming theory. Then we deene a xpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained by considering the leftmost selecti...
متن کاملImplicitization using univariate resultants
Among several implicitization methods, the method based on resultant computation is a simple and direct one, but it often brings extraneous factors which are difficult to remove. This paper studies a class of rational space curves and rational surfaces by implicitization with univariate resultant computations. This method is more efficient than the other algorithms in finding implicit equations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1948
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1948-09005-x