Automated reasoning for the existence of Darboux polynomials

DOI10.1145/3666000.3669705MaRDI QIDQ7033526zbMATH OpenFDO

Authors Khalil Ghorbal, Maxime Bridoux

Publication date 3 February 2025

Full work available at URL https://doi.org/10.1145/3666000.3669705

zbMATH Keywords

automated reasoningDarboux Polynomialslienard systemsNewton Polytopetheorem provingVan der Pol oscillator

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A Mathematica package for certifying the nonexistence of Darboux polynomials
• Computing closed form solutions of first order ODEs using the Prelle- Singer procedure
• Constructing invariants for hybrid systems
• Darboux theory of integrability in the sparse case
• Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
• Elementary First Integrals of Differential Equations
• Generating invariants for non-linear hybrid systems
• scientific article; zbMATH DE number 3935185 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Integrability and nonintegrability of dynamical systems
• Integrability of dynamical systems: algebra and analysis
• Invariant algebraic curves and conditions for a centre
• Mémoire sur les équations différentielles algébriques du premier ordre et du premier degré.
• The limit cycle of the van der Pol equation is not algebraic

Cited in

(1)

• A Mathematica package for certifying the nonexistence of Darboux polynomials

This page was built for publication: Automated reasoning for the existence of Darboux polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033526)