Epsilon

swMATH244MaRDI QIDQ13007FDOQ13007

Author name not available (Why is that?)

Cited In (46)

• A concise proof of the Kronecker polynomial system solver from scratch
• A Maple Package for Automatic Theorem Proving and Discovery in 3D-Geometry
• On \(n\)-sectors of the angles of an arbitrary triangle
• Extension of Simson–Wallace Theorem on Skew Quadrilaterals and Further Properties
• Computing differential characteristic sets by change of ordering
• Title not available (Why is that?)
• Solution of center-focus problem for a class of cubic systems
• Complexity of triangular representations of algebraic sets
• Multiplicity-preserving triangular set decomposition of two polynomials
• Title not available (Why is that?)
• Automated theorem proving in GeoGebra: current achievements
• Doing Algebraic Geometry with the RegularChains Library
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
• Title not available (Why is that?)
• On decomposition of algebraic PDE systems into simple subsystems
• Infinite orders and non-\(D\)-finite property of 3-dimensional lattice walks
• On protocols for the automated discovery of theorems in elementary geometry
• Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
• Thomas Decomposition of Algebraic and Differential Systems
• Generic regular decompositions for parametric polynomial systems
• Symbolic computation of strongly nonlinear periodic oscillations
• An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
• On computing absolutely irreducible components of algebraic varieties with parameters
• Complexity of solving parametric polynomial systems
• Generalizing the Steiner-Lehmus theorem using the Gröbner cover
• Computational Origami Construction as Constraint Solving and Rewriting
• Symbolic computation of the orthogonal projection of rational curves onto rational parameterized surfaces
• Algorithm for computing differential char sets efficiently
• Characteristic sets verses generalized characteristic sets
• Automated discovery of geometric theorems based on vector equations
• A simple method for implicitizing rational curves and surfaces
• Chordal Networks of Polynomial Ideals
• Decomposition of polynomial sets into characteristic pairs
• An algorithmic approach to small limit cycles of nonlinear differential systems: the averaging method revisited
• Symbolic computation of hyperbolic tangent solutions for nonlinear differential-difference equations
• Finding solutions of fuzzy polynomial equations systems by an Algebraic method
• On One Method of Proving Inequalities in Automated Way
• Morley's theorem revisited: origami construction and automated proof
• Computing singular points of plane rational curves
• Model reduction of chemical reaction systems using elimination
• Title not available (Why is that?)
• A normal form algorithm for regular differential chains
• A \textit{Maple} package for finding interaction solutions of nonlinear evolution equations
• Algebraic analysis of stability and bifurcation of a self-assembling micelle system
• An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
• Generic regular decompositions for generic zero-dimensional systems

This page was built for software: Epsilon