Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Elimination theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Part of algebraic geometry devoted to the elimination of variables between polynomials}} In [[commutative algebra]] and [[algebraic geometry]], '''elimination theory''' is the classical name for algorithmic approaches to eliminating some variables between [[polynomial]]s of several variables, in order to solve [[systems of polynomial equations]]. Classical elimination theory culminated with the work of [[Francis Sowerby Macaulay|Francis Macaulay]] on [[multivariate resultant]]s, as described in the chapter on ''Elimination theory'' in the first editions (1930) of [[Bartel Leendert van der Waerden|Bartel van der Waerden]]'s ''[[Moderne Algebra]]''. After that, elimination theory was ignored by most algebraic geometers for almost thirty years, until the introduction of new methods for solving polynomial equations, such as [[Gröbner bases]], which were needed for [[computer algebra]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)