Algebraic solutions of holomorphic foliations: An algorithmic approach

Authors:
S. C. Coutinho;L. Menasché Schechter
Affiliations:
Departamento de Ciência da Computação, Instituto de Matemática, Universidade Federal do Rio de Janeiro, P.O. Box 68530, 21945-970 Rio de Janeiro, RJ, Brazil and Programa de Eng ...;Departamento de Ciência da Computação, Instituto de Matemática, Universidade Federal do Rio de Janeiro, P.O. Box 68530, 21945-970 Rio de Janeiro, RJ, Brazil
Venue:
Journal of Symbolic Computation
Year:
2006

Citing 2
Cited 1

Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
A rational approach to the Prelle-Singer algorithm

Journal of Symbolic Computation

Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their implementations in the computer algebra system Singular.