Sparse resultant under vanishing coefficients

被引:11
|
作者
Minimair, M [1 ]
机构
[1] Seton Hall Univ, Dept Math & Comp Sci, S Orange, NJ 07079 USA
关键词
elimination theory; resultant; product formula; Newton polytope;
D O I
10.1023/A:1025169426299
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The main question of this paper is: What happens to the sparse (toric) resultant under vanishing coefficients? More precisely, let f(1),..., f(n) be sparse Laurent polynomials with supports A(1),..., A(n) and let (A) over tilde (1) superset of A(1). Naturally a question arises: Is the sparse resultant of f(1), f(2),..., f(n) with respect to the supports (A) over tilde (1), A(2),...A(n) in any way related to the sparse resultant of f(1), f(2),..., f(n) with respect to the supports A(1), A(2),..., A(n)? The main contribution of this paper is to provide an answer. The answer is important for applications with perturbed data where very small coefficients arise as well as when one computes resultants with respect to some fixed supports, not necessarily the supports of the f(i)'s, in order to speed up computations. This work extends some work by Sturmfels on sparse resultant under vanishing coefficients. We also state a corollary on the sparse resultant under powering of variables which generalizes a theorem for Dixon resultant by Kapur and Saxena. We also state a lemma of independent interest generalizing Pedersen's and Sturmfels' Poisson-type product formula.
引用
收藏
页码:53 / 73
页数:21
相关论文
共 50 条
  • [31] Vanishing of the coefficients of a half Lerch sum
    Chen, Shi-Chao
    INTERNATIONAL JOURNAL OF NUMBER THEORY, 2019, 15 (02) : 251 - 263
  • [32] Vanishing Fourier coefficients of Hecke eigenforms
    Calegari, Frank
    Sardari, Naser Talebizadeh
    MATHEMATISCHE ANNALEN, 2021, 381 (3-4) : 1197 - 1215
  • [33] Efficient Incremental Algorithms for the Sparse Resultant and the Mixed Volume
    Emiris, I. Z.
    Canny, J. F.
    Journal of Symbolic Computation, 20 (02):
  • [34] A sparse resultant based method for efficient minimal solvers
    Bhayani, Snehal
    Kukelova, Zuzana
    Heikkila, Janne
    2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, : 1767 - 1776
  • [35] Techniques for exploiting structure in matrix formulae of the sparse resultant
    Emiris, Ioannis Z.
    Pan, Victor Y.
    Calcolo, 1996, 33 (1-4) : 352 - 369
  • [36] Efficient incremental algorithms for the sparse resultant and the mixed volume
    Emiris, IZ
    Canny, JF
    JOURNAL OF SYMBOLIC COMPUTATION, 1995, 20 (02) : 117 - 149
  • [37] Lacunary eta quotients with identically vanishing coefficients
    Huber, Timothy
    McLaughlin, James
    Ye, Dongxi
    INTERNATIONAL JOURNAL OF NUMBER THEORY, 2023, 19 (07) : 1639 - 1670
  • [38] Vanishing properties of analytically continued matrix coefficients
    Krötz, B
    Otto, M
    JOURNAL OF LIE THEORY, 2002, 12 (02) : 409 - 421
  • [39] Non-vanishing Fourier coefficients of Δk
    Tian, Peng
    Qin, Hourong
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 339 : 507 - 515
  • [40] REMEC TEST WITH VANISHING LEADING ARRAY COEFFICIENTS
    HASAN, AAK
    HASAN, MAK
    INTERNATIONAL JOURNAL OF CONTROL, 1987, 45 (04) : 1275 - 1279