Mechanization of the Sturmfel-Salmon resultant method


  • Surajo Sulaiman Universiti Teknologi Malaysia
  • Noraini Aris Universiti Teknologi Malaysia
  • Shamsatun Nahar Ahmad Universiti Teknologi Mara



Mechanization, Procedure, Resultant, Polynomial Resultant


Designing and implementing a procedure for computing the polynomial resultant provides an avenue for analyzing both the computational complexity and performance of such construction. In this paper a new Maple procedure called Sturmfelmethod for computing the Sturmfel-Salmon resultant method is proposed based on existing methods and assumptions. Examples are provided to demonstrate the mechanization of the resulting new algorithm and its computing time. The new procedure can be used to determine whether three polynomials intersect or not and to solve a given system of polynomial equations.

Author Biography

Surajo Sulaiman, Universiti Teknologi Malaysia

Surajo Sulaiman is currenlty a Ph.D student at Universiti Teknologi Malaysia after completing an MSc at Yasar University in Turkey in 2014 and BSc mathematics at Kano university of science and technology, Wudil in Kano Nigeria in 2010. Untill today Mr Sulaiman is an academic staff of mathematics department at Northwest university Kano-Nigeria


CANNY, J. & EMIRIS, I. 1993. An efficient algorithm for the sparse mixed resultant. Applied algebra, algebraic algorithms and error-correcting codes. Springer.

CANNY, J. & PEDERSEN, P. 1993. An algorithm for the Newton resultant. Cornell University.

COX, D. A., LITTLE, J. & O'SHEA, D. 2006. Using algebraic geometry, Springer Science & Business Media.

EMIRIS, I. Z. & MOURRAIN, B. 1999. Matrices in elimination theory. Journal of Symbolic Computation, 28, 3-43.

LI, W., YUAN, C.-M. & GAO, X.-S. 2015. Sparse difference resultant. Journal of Symbolic Computation, 68, 169-203.

PALÁNCZ, B., ZALETNYIK, P., AWANGE, J. L. & GRAFAREND, E. W. 2008. Dixon resultant’s solution of systems of geodetic polynomial equations. Journal of Geodesy, 82, 505-511.

SALMON, G. 1885. Lessons introductory to the modern higher algebra, Hodges, Figgis, and Company.

STILLER, P. 1996. An introduction to the theory of resultants. Mathematics and Computer Science, T&M University, Texas, College Station, TX.

STURMFELS, B. Introduction to resultants. Proceedings of Symposia in Applied Mathematics, 1998. AMERICAN MATHEMATICAL SOCIETY, 25-40.

STURMFELS, B. 2002. Solving systems of polynomial equations, American Mathematical Soc.

SULAIMAN, S. & ARIS, N. 2016. Comparison of Some Multivariable Hybrid Resultant Matrix Formulations. Indian Journal of Science and Technology, 9.

SULAIMAN, S., ARIS, N. & AHMAD, S. N. Current Advances on Polynomial Resultant Formulations

Simposium Kebangsaan Sains Matematik Ke 24, 27-27 September, 2016 2016 Kuala Tarrangganu American Institute of Physics (AIP), 1-7.

SYLVESTER, J. J. 1853. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraical common measure. Philosophical transactions of the Royal Society of London, 143, 407-548.

WANG, W. & LIAN, X. 2005. Computations of multi-resultant with mechanization. Applied mathematics and computation, 170, 237-257.