Related Research Articles
Algebraic geometry is a branch of mathematics which uses abstract algebraic techniques, mainly from commutative algebra, to solve geometrical problems. Classically, it studies zeros of multivariate polynomials; the modern approach generalizes this in a few different aspects.
Magma is a computer algebra system designed to solve problems in algebra, number theory, geometry and combinatorics. It is named after the algebraic structure magma. It runs on Unix-like operating systems, as well as Windows.
In commutative algebra and algebraic geometry, elimination theory is the classical name for algorithmic approaches to eliminating some variables between polynomials of several variables, in order to solve systems of polynomial equations.
In mathematics and specifically in algebraic geometry, the dimension of an algebraic variety may be defined in various equivalent ways.
Macsyma is one of the oldest general-purpose computer algebra systems still in wide use. It was originally developed from 1968 to 1982 at MIT's Project MAC.
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x1, ..., xn] over a field K. A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps.
In the theory of multivariate polynomials, Buchberger's algorithm is a method for transforming a given set of polynomials into a Gröbner basis, which is another set of polynomials that have the same common zeros and are more convenient for extracting information on these common zeros. It was introduced by Bruno Buchberger simultaneously with the definition of Gröbner bases.
Wolfgang Gröbner was an Austrian mathematician. His name is best known for the Gröbner basis, used for computations in algebraic geometry. However, the theory of Gröbner bases for polynomial rings was developed by his student Bruno Buchberger in 1965, who named them for Gröbner. Gröbner is also known for the Alekseev-Gröbner formula, which was actually proven by him.
Macaulay2 is a free computer algebra system created by Daniel Grayson and Michael Stillman for computation in commutative algebra and algebraic geometry.
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring. The algorithm uses the same mathematical principles as the Buchberger algorithm, but computes many normal forms in one go by forming a generally sparse matrix and using fast linear algebra to do the reductions in parallel.
Jean-Charles Faugère is the head of the POLSYS project-team of the Laboratoire d'Informatique de Paris 6 (LIP6) and Paris–Rocquencourt center of INRIA, in Paris. The team was formerly known as SPIRAL and SALSA.
In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. Although computer algebra could be considered a subfield of scientific computing, they are generally considered as distinct fields because scientific computing is usually based on numerical computation with approximate floating point numbers, while symbolic computation emphasizes exact computation with expressions containing variables that have no given value and are manipulated as symbols.
A system of polynomial equations is a set of simultaneous equations f1 = 0, ..., fh = 0 where the fi are polynomials in several variables, say x1, ..., xn, over some field k.
Daniel Lazard is a French mathematician and computer scientist. He is emeritus professor at Pierre and Marie Curie University.
In algebra, linear equations and systems of linear equations over a field are widely studied. "Over a field" means that the coefficients of the equations and the solutions that one is looking for belong to a given field, commonly the real or the complex numbers. This article is devoted to the same problems where "field" is replaced by "commutative ring", or, typically "Noetherian integral domain".
Vladimir P. Gerdt was a Russian mathematician and a full professor at the Joint Institute for Nuclear Research (JINR) where he was the head of the Group of Algebraic and Quantum Computations. His research interests were concentrated in computer algebra, symbolic and algebraic computations, algebraic and numerical analysis of nonlinear differential equations, polynomial equations, applications to mathematics and physics, and quantum computation with over 210 published articles.
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal. There are several generalization and various applications for FGLM.
In computer algebra, the Gröbner fan of an ideal in the ring of polynomials is a concept in the theory of Gröbner bases. It is defined to be a fan consisting of cones that correspond to different monomial orders on that ideal. The concept was introduced by Mora and Robbiano in 1988. The result is a weaker version of the result presented in the same issue of the journal by Bayer and Morrison. Gröbner fan is a base for the nowadays active field of tropical geometry. One implementation of the Gröbner fan is called Gfan, based on an article of Fukuda, et al. which is included in some computer algebra systems such as Singular, Macaulay2, and CoCoA.
Patrizia M. Gianni is an Italian mathematician specializing in computer algebra. She is known for her early research on Gröbner bases including her discovery of the FGLM algorithm for changing monomial orderings in Gröbner bases, and for her development of the components of the Axiom computer algebra system concerning polynomials and rational functions.
References
- 1 2 University of Genoa faculty-page.
- ↑ An algorithm to compute the equations of tangent cones; An introduction to the tangent cone algorithm.
- ↑ Better algorithms due to Greuel-Pfister and Gräbe are currently available.
- ↑ Gröbner bases for non-commutative polynomial rings.
- ↑ Extending the proposal set by George M. Bergman.
- ↑ De Nugis Groebnerialium 4: Zacharias, Spears, Möller, Buchberger–Weispfenning theory for effective associative rings; see also Seven variations on standard bases.
- ↑ The result is a weaker version of the result presented in the same issue of the journal by Bayer and Morrison.
- ↑ Springer-Verlag website.
- 1 2 David P. Roberts (UMN) (September 14, 2006). "[Review of the book] Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy [and also Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gröbner Technology]". Mathematical Association of America Press.
- ↑ S. C. Coutinho (UFRJ) (March 2009). "Review of solving polynomial equation systems II: Macaulay's paradigm and Gröbner technology by Teo Mora (Cambridge University Press 2005)" (PDF). ACM SIGACT News. 40 (1): 14–17. doi:10.1145/1515698.1515702. S2CID 12448065 – via ACM Digital Library.
- 1 2 Giovanni Bogani (December 11, 2002). "O tempora, O... Teo Mora". Genoa, Italy: Repubblica.it.
...Teo Mora vive a Genova. ...scritto libri come La madre di tutte le dualità: l'algoritmo di Moeller , Il teorema di Kalkbrenner , o L'algoritmo di Buchberger ... Negli [1977] anni '70, Mora aveva scritto una monumentale Storia del cinema horror. ... la [2001] ripropone, in una nuova edizione, riveduta, corretta e completamente aggiornata. ...Nel primo volume... fino al 1957... Nosferatu , attori come Boris Karloff e Bela Lugosi... film come Il gabinetto del dottor Caligari . ...Nel secondo volume si arriva fino al 1966... Roger Corman... Il terzo volume arriva fino al 1978... Brian De Palma, David Cronenberg, George Romero, Dario Argento, Mario Bava. ...
Translation: "...Teo Mora lives in Genoa. ...written works include The Mother of All Dualities: The Möller Algorithm , The Kalkbrenner Theorem , and The Buchberger Algorithm ... In the 1970s, Mora wrote the monumental History of Horror Cinema . ...reprinted [in 2001], as a new edition: revised, corrected, and completely updated. Two volume are already out, the third [volume] will be released in late January [2002], the fourth [volume] in spring 2003. ... In the first volume... [covering] through 1957... Nosferatu , actors like Boris Karloff and Bela Lugosi... films like The Cabinet of Dr. Caligari . ...The second volume covers until 1966... Roger Corman, director ...The third volume covers through 1978... Brian De Palma, David Cronenberg, George Romero, Dario Argento, Mario Bava. ..." - ↑ "Mostri Universal" [The Universal Pictures monsters]. No. 20. RAI 4, Radiotelevisione Italiana. September 12, 2014.
...[text:] L'intervista — Teo Mora: Professore di Algebra presso il dipartimento di Informatica e Scienze dell'Informazione dell'Università di Genova, è anche un noto esperto di cinema horror. Ha curato Storia del cinema dell'orrore, un'autorevole guida in tre volumi con approfondimenti, schede e analisi dettagliate sui film, i registi e gli attori... [multimedia: video content] ...
Translation: "...[text:] professor of Algebra in the Computer and Information Science department of the University of Genoa, also a well-known expert on horror films. His book Storia del cinema dell'orrore is an authoritative guide with in-depth detailed descriptions and analysis of films, directors, and actors... [multimedia: video content] ..."
