Article

Sylvester-resultants for bivariate polynomials with planar newton polygons

Authors:

Ron GoldmanAuthors Info & Claims

ISSAC '04: Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Pages 205 - 212

https://doi.org/10.1145/1005285.1005316

Published: 04 July 2004 Publication History

Abstract

We derive necessary and sufficient conditions which guarantee that a multiplying set of monomials generates exactly a Sylvester A-resultant for three bivariate polynomials with a given planar Newton polygon. We show that valid multiplying sets come in complementary pairs, and any two complementary pairs of multiplying sets can be used to index the rows and columns of a pure Bezoutian A-resultant for the same Newton polygon.The necessary and sufficient conditions include a set of Diophantine equations that can be solved to generate the multiplying sets and therefore the corresponding Sylvester $A$-resultants. Examples relevant to Geometric Modeling are provided, including a new family of hexagonal examples for which Sylvester formulas were not previously known. These examples not only flesh out the theory, but also demonstrate that none of the conditions are superfluous and that all the conditions are mutually independent. The proof of the main theorem makes use of tools from algebraic geometry, including sheaf cohomology on toric varieties and Weyman's resultant complex.

References

[1]

L. Buse and A. Galligo. A resultant approach to detect intersecting curves in P3. Presented at MEGA'2003, Preprint available at math.AG/0301088, 2003.

[2]

E. Chionh, M. Zhang, and R. Goldman. Implicitization by Dixon A-resultants. In Proceedings of Geometric Modeling and Processing 2000, pages 310--318. IEEE, 2000.

Digital Library

[3]

D. A. Cox. Toric varieties and toric resolutions. In Resolution of singularities Obergurgl, 1997, volume 181 of Progr. Math., pages 259--284. Birkhäuser, Basel, 2000.

[4]

A. Dixon. The eliminant of three quantics in two independent variables. Proc. London Mathematical Society, 6:46--69, 1908.

[5]

N. Fakhruddin. Multiplication maps of linear systems on smooth projective toric surfaces. Preprint avaliable math. AG/0208178, 2002.

[6]

W. Fulton. Introduction to toric varieties, volume 131 of Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 1993. The William H. Roever Lectures in Geometry.

[7]

I. Gelfand, M. Kapranov, and A. Zelevinsky. Discriminants, Resultants, and Multidimensional Determinants. Birkhäuser, Boston-Basel-Berlin, 1994.

[8]

C. Hoffmann. Geometric and Solid Modeling: An Introduction. Morgan Kaufmann, San Mateo, California, 1989.

Digital Library

[9]

A. Khetan. Formulas for Resultants. PhD thesis, University of California, Berkeley, May 2003. Department of Mathematics.

[10]

A. Khetan. The resultant of an unmixed bivariate system. J. Symbolic Comput., 36(3-4):425--442, 2003. International Symposium on Symbolic and Algebraic Computation ISSAC'2002 Lille.

Digital Library

[11]

R. Krasauskas. Toric surface patches. Adv. Comput. Math., 17(1-2):89--113, 2002. Advances in geometrical algorithms and representations.

[12]

R. Krasauskas and R. Goldman. Toric Bezier patches with depth. In Topics in Geometric Modeling and Algebraic Geometry, volume 334 of Contemporary Mathematics, pages 65--91. AMS Mathematics of Computation, 2003.

[13]

M. Mustaţă. Vanishing theorems on toric varieties. Tohoku Math. J. (2), 54(3):451--470, 2002.

[14]

T. Sederberg, D. Anderson, and R. Goldman. Implicit representation of parametric curves and surfaces. Computer Vision, Graphics and Image Processing, 28:72--84, 1984.

[15]

T. W. Sederberg. Applications to computer aided geometric design. In Applications of computational algebraic geometry (San Diego, CA, 1997), volume 53 of Proc. Sympos. Appl. Math., pages 67--89. Amer. Math. Soc., Providence, RI, 1998.

[16]

M. Zhang and R. Goldman. Rectangular corner cutting and Sylvester $A$-resultants. In Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (St. Andrews), pages 301--308 (electronic), New York, 2000. ACM.

Digital Library

[17]

S. Zube. The n-sided toric patches and A-resultants. Comput. Aided Geom. Design, 17(7):695--714, 2000.

Digital Library

Cited By

Busé LMantzaflaris ATsigaridas E(2019)Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomialsJournal of Symbolic Computation10.1016/j.jsc.2019.07.007Online publication date: Jul-2019
https://doi.org/10.1016/j.jsc.2019.07.007
Mantzaflaris ATsigaridas EYap CEl Din M(2017)Resultants and Discriminants for Bivariate Tensor-Product PolynomialsProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087646(309-316)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087646
Emiris IKonaxis C(2011)Single-lifting Macaulay-type formulae of generalized unmixed sparse resultantsJournal of Symbolic Computation10.1016/j.jsc.2011.02.00246:8(919-942)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.jsc.2011.02.002
Show More Cited By

Index Terms

Sylvester-resultants for bivariate polynomials with planar newton polygons
1. Computing methodologies
  1. Symbolic and algebraic manipulation

Recommendations

Resultants and Discriminants for Bivariate Tensor-Product Polynomials
ISSAC '17: Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation

Optimal resultant formulas have been systematically constructed mostly for unmixed polynomial systems, that is, systems of polynomials which all have the same support. However, such a condition is restrictive, since mixed systems of equations arise ...
Bivariate Krawtchouk polynomials

In this paper we present a recurrent procedure to solve an inversion problem for monic bivariate Krawtchouk polynomials written in vector column form, giving its solution explicitly. As a by-product, a general connection problem between two vector ...
Bivariate affine Gončarov polynomials

Bivariate Gončarov polynomials are a basis of the solutions of the bivariate Gončarov Interpolation Problem in numerical analysis. A sequence of bivariate Gončarov polynomials is determined by a set of nodes Z = { ( x i , j , y i , j ) ź R 2 } and is an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSAC '04: Proceedings of the 2004 international symposium on Symbolic and algebraic computation

July 2004

334 pages

ISBN:158113827X

DOI:10.1145/1005285

General Chair:
Josef Schicho
RICAM, Austrian Academy of Sciences, Linz, Austria

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 July 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC04

Sponsor:

ISSAC04: International Symposium on Symbolic and Algebraic Computation

July 4 - 7, 2004

Santander, Spain

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
299
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Busé LMantzaflaris ATsigaridas E(2019)Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomialsJournal of Symbolic Computation10.1016/j.jsc.2019.07.007Online publication date: Jul-2019
https://doi.org/10.1016/j.jsc.2019.07.007
Mantzaflaris ATsigaridas EYap CEl Din M(2017)Resultants and Discriminants for Bivariate Tensor-Product PolynomialsProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087646(309-316)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087646
Emiris IKonaxis C(2011)Single-lifting Macaulay-type formulae of generalized unmixed sparse resultantsJournal of Symbolic Computation10.1016/j.jsc.2011.02.00246:8(919-942)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.jsc.2011.02.002
Kaltofen EKoiran PSendra JGonzalez-Vega L(2008)Expressing a fraction of two determinants as a determinantProceedings of the twenty-first international symposium on Symbolic and algebraic computation10.1145/1390768.1390790(141-146)Online publication date: 20-Jul-2008
https://dl.acm.org/doi/10.1145/1390768.1390790

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents