This talk describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss a way to solve systems of polynomial equations with resultants. Using ideas of Bricard, we find a system of polynomial equations that models a configuration of quadralaterals that is equivalent to some three dimensional structures. These structures are of interest in computational chemistry, as they represent molecules. We then describe and demonstrate an algorithm that examines the resultant and determines ways that the structure can be flexible. We review som
Finding the solutions of a polynomial system is a fundamental problem with nu-merous applications in...
We present a computational approach for constructing Sylvester style resultants for sparse systems o...
We present a survey of some basic ideas involved in the use of homotopies for solving systems of pol...
Abstract. This paper describes the recent convergence of four topics: polynomial systems, flexibilit...
We solve systems of multivariate polynomial equations in order to understand flexibility of objects ...
Oftentimes in mathematics, a theoretical investigation leads to a system of polynomial equations. Ge...
Article dans revue scientifique avec comité de lecture.We review the different techniques known for ...
This paper is dedicated to our beloved friend and colleague Jean Pierre Dedieu. Abstract. These page...
AbstractWe present a new algorithm for the computation of resultants associated with multihomogeneou...
This paper will explore the use and construction of Gröbner bases through Buchberger\u27s algorithm....
We review the different techniques known for doing exact computations on polynomial systems. Some ar...
Abstract: New methods for computation of solutions of an algebraic equation of three varia...
Given a system of polynomial equations and inequations with coefficients in the field of rational nu...
AbstractGiven a system of polynomial equations and inequations with coefficients in the field of rat...
These notes accompany an introductory lecture given by the author at the workshop on solving polynom...
Finding the solutions of a polynomial system is a fundamental problem with nu-merous applications in...
We present a computational approach for constructing Sylvester style resultants for sparse systems o...
We present a survey of some basic ideas involved in the use of homotopies for solving systems of pol...
Abstract. This paper describes the recent convergence of four topics: polynomial systems, flexibilit...
We solve systems of multivariate polynomial equations in order to understand flexibility of objects ...
Oftentimes in mathematics, a theoretical investigation leads to a system of polynomial equations. Ge...
Article dans revue scientifique avec comité de lecture.We review the different techniques known for ...
This paper is dedicated to our beloved friend and colleague Jean Pierre Dedieu. Abstract. These page...
AbstractWe present a new algorithm for the computation of resultants associated with multihomogeneou...
This paper will explore the use and construction of Gröbner bases through Buchberger\u27s algorithm....
We review the different techniques known for doing exact computations on polynomial systems. Some ar...
Abstract: New methods for computation of solutions of an algebraic equation of three varia...
Given a system of polynomial equations and inequations with coefficients in the field of rational nu...
AbstractGiven a system of polynomial equations and inequations with coefficients in the field of rat...
These notes accompany an introductory lecture given by the author at the workshop on solving polynom...
Finding the solutions of a polynomial system is a fundamental problem with nu-merous applications in...
We present a computational approach for constructing Sylvester style resultants for sparse systems o...
We present a survey of some basic ideas involved in the use of homotopies for solving systems of pol...