Generalizing the Steiner-Lehmus theorem using the Gröbner cover
From MaRDI portal
Publication:2229890
DOI10.1016/j.matcom.2013.06.006zbMath1467.68231OpenAlexW2099411995MaRDI QIDQ2229890
Publication date: 18 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2013.06.006
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (4)
The Steiner-Lehmus theorem and ``triangles with congruent medians are isosceles hold in weak geometries ⋮ Computing the canonical representation of constructible sets ⋮ NAPOLEON'S THEOREM FROM THE VIEW POINT OF GRÖBNER BASES ⋮ Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases for polynomial systems with parameters
- On protocols for the automated discovery of theorems in elementary geometry
- Minimal canonical comprehensive Gröbner systems
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Automatic discovery of theorems in elementary geometry
- A software tool for the investigation of plane loci
- Canonical comprehensive Gröbner bases
- An Introduction to Automated Discovery in Geometry through Symbolic Computation
- A new algorithm for computing comprehensive Gröbner systems
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Computing with semi-algebraic sets represented by triangular decomposition
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
This page was built for publication: Generalizing the Steiner-Lehmus theorem using the Gröbner cover
