Sparse resultant of composed polynomials II unmixed-mixed case

被引:3
|
作者
Minimair, M [1 ]
机构
[1] N Carolina State Univ, Dept Math, Raleigh, NC 27695 USA
基金
美国国家科学基金会;
关键词
D O I
10.1006/jsco.2001.0517
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper is the second in a series of papers on sparse resultants of composed polynomials. In the first paper, "Sparse Resultant of Composed Polynomials I", Hong and Minimair (2000, http://minimair.org/HM2000.ps) considered the sparse resultant of polynomials having arbitrary (mixed) supports composed with polynomials having the same (unmixed) supports. Here, we consider the sparse resultant of polynomials having the same (unmixed) supports composed with polynomials having arbitrary (mixed) supports (under a mild technical assumption on their exponents). The main contribution of this paper is to show that the sparse resultant of these composed polynomials is the product of certain powers of the (sparse) resultants of the component polynomials. The resulting formula looks similar to the formula of the first paper, which is good because it suggests that there is some common underlying structure for sparse resultants of composed polynomials. However. the formulae differ substantially in detail. It also seems that it is not possible to apply the techniques used to show the main result of the first paper in order to show the formula of the present paper. It is expected that this result can be applied to compute sparse resultants of composed polynomials with improved efficiency. (C) 2002 Elsevier Science Ltd.
引用
收藏
页码:467 / 478
页数:12
相关论文
共 50 条
  • [1] Sparse resultant of composed polynomials I* mixed-unmixed case
    Hong, H
    Minimair, M
    JOURNAL OF SYMBOLIC COMPUTATION, 2002, 33 (04) : 447 - 465
  • [2] Dense resultant of composed polynomials - Mixed-mixed case
    Minimair, M
    JOURNAL OF SYMBOLIC COMPUTATION, 2003, 36 (06) : 825 - 834
  • [3] The height of the mixed sparse resultant
    Sombra, M
    AMERICAN JOURNAL OF MATHEMATICS, 2004, 126 (06) : 1253 - 1260
  • [4] Hybrid sparse resultant matrices for bivariate polynomials
    D'Andrea, C
    Emiris, IZ
    JOURNAL OF SYMBOLIC COMPUTATION, 2002, 33 (05) : 587 - 608
  • [5] Sparse Differential Resultant for Laurent Differential Polynomials
    Li, Wei
    Yuan, Chun-Ming
    Gao, Xiao-Shan
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2015, 15 (02) : 451 - 517
  • [6] Sparse Differential Resultant for Laurent Differential Polynomials
    Wei Li
    Chun-Ming Yuan
    Xiao-Shan Gao
    Foundations of Computational Mathematics, 2015, 15 : 451 - 517
  • [7] Efficient Incremental Algorithms for the Sparse Resultant and the Mixed Volume
    Emiris, I. Z.
    Canny, J. F.
    Journal of Symbolic Computation, 20 (02):
  • [8] Efficient incremental algorithms for the sparse resultant and the mixed volume
    Emiris, IZ
    Canny, JF
    JOURNAL OF SYMBOLIC COMPUTATION, 1995, 20 (02) : 117 - 149
  • [9] Cayley-Dixon resultant matrices of multi-univariate composed polynomials
    Chtcherba, AD
    Kapur, D
    Minimair, M
    COMPUTER ALGEBRA IN SCIENFIFIC COMPUTING, PROCEEDINGS, 2005, 3718 : 125 - 137
  • [10] Towards Mixed Grobner Basis Algorithms: the Multihomogeneous and Sparse Case
    Bender, Matias R.
    Faugere, Jean-Charles
    Tsigaridas, Elias
    ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2018, : 71 - 78