Mostra el registre d'ítem simple
Generalizing the Steiner-Lehmus theorem using the Gröbner cover
dc.contributor.author | Montes Lozano, Antonio |
dc.contributor.author | Recio Muñiz, Tomás |
dc.date.accessioned | 2014-07-21T08:52:22Z |
dc.date.created | 2014-10-01 |
dc.date.issued | 2014-10-01 |
dc.identifier.citation | Montes, A.; Tomás, R. Generalizing the Steiner-Lehmus theorem using the Gröbner cover. "Mathematics and computers in simulation", 01 Octubre 2014, vol. 104, p. 67-81. |
dc.identifier.issn | 0378-4754 |
dc.identifier.uri | http://hdl.handle.net/2117/23574 |
dc.description.abstract | In this note we present an application of a new tool (the Gröbner cover method, to discuss parametric polynomial systems of equations) in the realm of automatic discovery of theorems in elementary geometry. Namely, we describe, through a relevant example, how the Gröbner cover algorithm is particularly well suited to obtain the missing hypotheses for a given geometric statement to hold true. We deal with the following problem: to describe the triangles that have at least two bisectors of equal length. The case of two inner bisectors is the well known, XIX century old, Steiner-Lehmus theorem, but the general case of inner and outer bisectors has been only recently addressed. We show how the Gröbner cover method automatically provides, while yielding more insight than through any other method, the conditions for a triangle to have two equal bisectors of whatever kind. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica::Aplicacions informàtiques a la física i l‘enginyeria |
dc.subject.lcsh | Computational geometry |
dc.subject.other | Automatic deduction |
dc.subject.other | Automatic discovery |
dc.subject.other | Comprehensive Gröbner system |
dc.subject.other | Elementarygeometry |
dc.subject.other | Gröbner cover |
dc.title | Generalizing the Steiner-Lehmus theorem using the Gröbner cover |
dc.type | Article |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1016/j.matcom.2013.06.006 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0378475413001961 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 14994566 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Montes, A.; Tomás, R. |
local.citation.publicationName | Mathematics and computers in simulation |
local.citation.volume | 104 |
local.citation.startingPage | 67 |
local.citation.endingPage | 81 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]