Euclid
This preliminary chapter is just devoted to recalling the Euclidean Algorithms over a univariate polynomial ring and its elementary applications: roughly speaking they are essentially the obvious generalization of those over integers.The fundamental tool related to the Euclidean Algorithms and to so...
Saved in:
| Published in: | Solving Polynomial Equation Systems I pp. 3 - 22 |
|---|---|
| Main Author: | |
| Format: | Book Chapter |
| Language: | English |
| Published: |
Cambridge University Press
27.03.2003
|
| ISBN: | 0521811546, 9780521811545 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This preliminary chapter is just devoted to recalling the Euclidean Algorithms over a univariate polynomial ring and its elementary applications: roughly speaking they are essentially the obvious generalization of those over integers.The fundamental tool related to the Euclidean Algorithms and to solving univariate polynomials is nothing more than the elementary Division Algorithm (Section 1.1), whose iterative application produces the Euclidean Algorithm (Section 1.2), which can be extended to prove and compute Bezout's Identity (Section 1.3).The Division- and Euclidean Algorithms and theorems have many important consequences for solving polynomial equations: they relate roots and linear factors of a polynomial (Section 1.4) allowing them, at least, to be counted, and are the basis for the theory (not the practice) of polynomial factorization (Section 1.5).They also have another, more important, consequence which is a crucial tool in solving: they allow a computational system to be developed within quotients of polynomial rings; the discussion of this is postponed to Section 5.1.A direct implementation of the Euclidean Algorithm provides an unexpected phenomenon, the ‘coefficient explosion’: during the application of the Euclidean Algorithm to two polynomials whose coefficients have small size, polynomials are produced with huge coefficients, even if the final output is simply 1. Finding efficient implementations of the Euclidean Algorithm was a crucial subject of research in the early days of Computer Algebra; in Section 1.6 I will briefly discuss this phenomenon and present efficient solutions to this problem. |
|---|---|
| AbstractList | This preliminary chapter is just devoted to recalling the Euclidean Algorithms over a univariate polynomial ring and its elementary applications: roughly speaking they are essentially the obvious generalization of those over integers.The fundamental tool related to the Euclidean Algorithms and to solving univariate polynomials is nothing more than the elementary Division Algorithm (Section 1.1), whose iterative application produces the Euclidean Algorithm (Section 1.2), which can be extended to prove and compute Bezout's Identity (Section 1.3).The Division- and Euclidean Algorithms and theorems have many important consequences for solving polynomial equations: they relate roots and linear factors of a polynomial (Section 1.4) allowing them, at least, to be counted, and are the basis for the theory (not the practice) of polynomial factorization (Section 1.5).They also have another, more important, consequence which is a crucial tool in solving: they allow a computational system to be developed within quotients of polynomial rings; the discussion of this is postponed to Section 5.1.A direct implementation of the Euclidean Algorithm provides an unexpected phenomenon, the ‘coefficient explosion’: during the application of the Euclidean Algorithm to two polynomials whose coefficients have small size, polynomials are produced with huge coefficients, even if the final output is simply 1. Finding efficient implementations of the Euclidean Algorithm was a crucial subject of research in the early days of Computer Algebra; in Section 1.6 I will briefly discuss this phenomenon and present efficient solutions to this problem. |
| Author | Mora, Teo |
| Author_xml | – sequence: 1 givenname: Teo surname: Mora fullname: Mora, Teo organization: University of Genoa |
| BookMark | eNqNj0tLw1AQhUd8UFvzD_wLqTOZe3snuIqhPqDQja7DfUo17YUGwZ9vRDe1G2cznHOYjzNTONvlXQS4JpwTkrlp79a1EdREWlXCNEfkEygOvFOYoq5IvvViAsUwvOE4lRJd8SVcLD98vwlXcJ5sP8Tid8_g5X753D6Wq_XDU9usSk-EpkzOu6QoWtaLmtELifJJGVNFo0hSTMLBReVcsCkIOREeUyKrFNeeeQbND9fbrdtvwmvsfN5Hl_P70B307j63fff3wQbRjIzbI4bL_73-AhgjUd0 |
| ContentType | Book Chapter |
| Copyright | Cambridge University Press 2003 |
| Copyright_xml | – notice: Cambridge University Press 2003 |
| DOI | 10.1017/CBO9780511542831.003 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 9780511542831 0511542836 |
| EndPage | 22 |
| ExternalDocumentID | 9780511542831_xml_CBO9780511542831A007 |
| GroupedDBID | -G2 -VQ -VX 089 20A A4I A4J AAAAZ AABBV AAHFW ABARN ABIAV ABZUC ACCTN ACLGV ACNOG ADCGF ADQZK ADVEM AEDFS AERYV AEWAL AEWQY AFTBM AHAWV AIAQS AJFER AJPFC AJXXZ AKHYG ALMA_UNASSIGNED_HOLDINGS AMJDZ ANGWU ASYWF AZZ BBABE BFIBU BOIVQ COBLI COXPH CYGLA CZZ DUGUG EBACC EBSCA EBZNK ECOWB FH2 FVPQW GEOUK HF4 ICERG IVK IWG JJU MYL OLDIN OTBUH OZASK OZBHS P73 PP- PQQKQ RQEQA S36 SACVX SN- SUPCW XI1 ZXKUE ABESS ABMRC |
| ID | FETCH-LOGICAL-c1107-fbcbf41ea356930c8184cf4772e7418fef83dbe4bbdafd81b88347711a4439c33 |
| ISBN | 0521811546 9780521811545 |
| IngestDate | Wed Mar 12 03:52:40 EDT 2025 Mon Sep 16 05:28:53 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1107-fbcbf41ea356930c8184cf4772e7418fef83dbe4bbdafd81b88347711a4439c33 |
| PageCount | 20 |
| ParticipantIDs | cambridge_corebooks_9780511542831_xml_CBO9780511542831A007 cambridge_cbo_9780511542831_xml_CBO9780511542831A007 |
| PublicationCentury | 2000 |
| PublicationDate | 20030327 |
| PublicationDateYYYYMMDD | 2003-03-27 |
| PublicationDate_xml | – month: 03 year: 2003 text: 20030327 day: 27 |
| PublicationDecade | 2000 |
| PublicationSubtitle | The Kronecker-Duval Philosophy |
| PublicationTitle | Solving Polynomial Equation Systems I |
| PublicationYear | 2003 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| SSID | ssj0000248523 |
| Score | 1.2679365 |
| Snippet | This preliminary chapter is just devoted to recalling the Euclidean Algorithms over a univariate polynomial ring and its elementary applications: roughly... |
| SourceID | cambridge |
| SourceType | Publisher |
| StartPage | 3 |
| Title | Euclid |
| URI | http://dx.doi.org/10.1017/CBO9780511542831.003 https://doi.org/10.1017/CBO9780511542831.003?locatt=mode:legacy |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELagdAAWnqK81IENBZraTRw2qApIqI-hlbpF8UtCShNoWlT-PWcnTdPCUIRYrCjJWRefdT5f_H2H0BWFVYBJndcgklvEC4TlEQjkgjrEpsx2uaOUKTbhdjp0OPR6Gb1AYsoJuFFEZzPv7V9NDffA2Bo6-wtz553CDbgGo0MLZod2JSJezr1maNvQZAh6cfipAceaNfg9ZfOek5Mv8qTt2BQZuu7LuDhzWlMeZufc5-kArM9Dpej6fFeo8bhU0-w0Cp4JF5a4FAn8zXmmjEvNh67pQ3cAsYd9U6vhxWKRH-FbesefjUJ_VfDeoPw3XRfcz9ZTqzt4yZNfhkitjjPssNHVydiQct3nOEfbvf1JpSIXRiEi6O-hXY0SqWr4Bui7jzZkdIB22jkJbnKIyulAHqHBY6vffLayshMW15thSzHOFLFlgBu6TiSHkIZwRWAbIjXVj5KKYsEkYUwESsBUpxTDU9sOCER3HONjVIriSJ6gqhAYU-GQhu0yIhU4R6Gx9YED_dcDUqsgkn-Ez1nsrzeqFXRXEIvH5r96sqbw6V-Ez9D2YtKdo9JkPJUXqMw_Jq_J-DIz8xcBXSYF |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Solving+Polynomial+Equation+Systems+I&rft.au=Mora%2C+Teo&rft.atitle=Euclid&rft.date=2003-03-27&rft.isbn=9780521811545&rft.spage=3&rft.epage=22&rft_id=info:doi/10.1017%2FCBO9780511542831.003&rft.externalDocID=9780511542831_xml_CBO9780511542831A007 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fassets.cambridge.org%2F97805218%2F11545%2Fcover%2F9780521811545.jpg |