Teo Mora
An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion, which will decide whether or not to retain it. |
Ferdinando 'Teo' Mora[a] is an Italian mathematician, and since 1990,[1] a professor of algebra at the University of Genoa.[b]
Life and work
Mora's degree is in mathematics from the University of Genoa in 1974.[1] Mora's publications span forty years; his best-cited[c] works thus far:
- 1982 paper on tangent cones
- 1984 paper on Gröbner bases and bounding the degree thereof
- 1985 paper on Gröbner bases and non-commutative polynomial rings
- 1986 paper on ideal theory methods
- 1988 paper on the Gröbner fan
- 1989 paper on Gröbner bases and systems of polynomial equations
- 1991 paper on Buchberger algorithm selection-strategies
- 1992 paper on Gröbner bases and syzygies
- 1993 paper on Gröbner bases and projective points
- 1993 paper on computing Gröbner bases using the FGLM algorithm (named for Mora and his co-authors)
- 1994 paper on the shape lemma
- 1994 paper on commutative and non-commutative Gröbner bases
- 1996 paper on multiplicities in polynomial systems
- 2009 book (co-editor and author of four chapters) on several aspects of Gröbner bases
- 2003 book-volume, Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy, on equations in one variable[2]
- 2005 book-volume, Solving Polynomial Equation Systems II: Macaulay's paradigm and Gröbner technology, on equations in several variables[3][2]
- 2016 book-volume, Solving Polynomial Equation Systems IV: Buchberger Theory and Beyond, on the Buchberger algorithm
Mora is on the managing-editorial-board of the journal AAECC published by Springer,[4] and was also formerly an editor of the Bulletin of the Iranian Mathematical Society.[d] Mora co-chaired a 2008 conference at the University of Catania on differential algebra.[5]
Personal life
Mora lives in Genoa.[6] Mora published a book trilogy in 1977-1978 (reprinted 2001-2003) called Storia del cinema dell'orrore on the history of horror films.[6] Italian television said in 2014 that the books are an "authoritative guide with in-depth detailed descriptions and analysis."[7]
See also
- FGLM algorithm, Buchberger's algorithm
- Gröbner fan, Gröbner basis
- Algebraic geometry#Computational algebraic geometry, System of polynomial equations
References
- ^ a b c d University of Genoa faculty-page.
- ^ a b 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). SIGACT Newsletter. New York: Association of Computing Machinery. pp. 14–17. doi:10.1145/1515698.1515702 – via Publisher's site.
{{cite web}}
: External link in
(help)|via=
- ^ Springer-Verlag website.
- ^ CUNY website.
- ^ a b 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. ...che alla fine si comporrà di sette volumi. Ne sono usciti i primi due: il terzo uscirà a fine gennaio, il quarto in primavera 2003. ...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... ultimately will consist of seven volumes. 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" ['Monsters Universe' aka The Horror-film Channel]. 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] ...
{{cite news}}
: Unknown parameter|episode=
ignored (help) 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] ..."
Notes
- ^ Teo Mora is his nickname, but used in most of his post-1980s publications; he has also used the pen name Theo Moriarty.[1]
- ^ Currently in the Dipartimento di Matematica,[1] formerly[when?] in the Dipartimento di Informatica e Scienze dell'Informazione. See previous faculty-page.
- ^ GoogleScholar.
- ^ See previous faculty-page.
Further reading
- Teo Mora (1977). Storia del cinema dell'orrore. Vol. 1. Fanucci. ISBN 88-347-0800-8.. Second and third volumes: ISBN 88-347-0850-4, ISBN 88-347-0897-0. Reprinted 2001.
- F. Mora (1982). "An algorithm to compute the equations of tangent cones" (PDF). Proc.EUROCAM'82: Lecture Notes in Computer Science (Computer algebra). 144. Springer: 158–165.
- F. Mora, H.M. Moeller (1983). "The computation of the Hilbert function" (PDF). Proc.EUROCAL'83: Lecture Notes in Computer Science (Computer Algebra). 162. Springer: 157–167 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- F. Mora, H.M. Möller (1984). "Upper and lower bounds for the degree of Gröbner bases" (PDF). Proc.EUROSAM'84: Lecture Notes in Computer Science. 174. Springer: 172–183.
- F. Mora (1986). "Gröbner bases for non-commutative polynomial rings" (PDF). Proc.AAECC3: Lecture Notes in Computer Science. 229. Springer: 353–362.
- H.M. Möller, F. Mora (1986). "New constructive methods in classical ideal theory". Journal of Algebra. 100. Elsevier: 138–178.
- Teo Mora (1988). "Seven variations on standard bases" – via Bibliography.
{{cite journal}}
: Cite journal requires|journal=
(help); External link in
(help)|via=
- Teo Mora; Lorenzo Robbiano (1988). "The Gröbner fan of an ideal". Journal of Symbolic Computation. 6. Elsevier: 183–208.
- also in: Lorenzo Robbiano, ed. (1989). Computational Aspects of Commutative Algebra. Vol. 6. London: Academic Press.
- T. Mora (1989). "Gröbner bases in non-commutative algebras" (PDF). Proc.ISSAC'88: Lecture Notes in Computer Science. 358. Springer: 150–161 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- P. Gianni, T. Mora (1989). "Algebraic solution of systems of polynomial equations using Gröbner bases" (PDF). AAECC5: Lecture Notes in Computer Science. 356. Springer: 247–257 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- M.E. Alonso, T. Mora, M. Raimondo (1991). "Local decomposition algorithms". Proc.AAECC8: Lecture Notes in Computer Science. 508. Springer: 208–221 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.G. Marinari, H.M. Möller, T. Mora (1991). "Gröbner bases of ideals given by dual bases" (PDF). Proc.ISSAC'91. Association of Computing Machinery: 55–63 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Alessandro Giovini, T. Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso (1991). "'One sugar cube, please'; or: Selection strategies in Buchberger algorithm". Proc.ISSAC'91. Association of Computing Machinery: 49–54 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- H. M. Möller, T. Mora, C. Traverso (1992). "Gröbner Bases Computation Using Syzygies" (PDF). Proc.ISSAC'92. Association of Computing Machinery – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M. E. Alonso, T. Mora, M. Raimondo (1992). "A computational model for algebraic power series". Journal of Pure and Applied Algebra. 77. Elsevier: 1–38 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Gerhard Pfister, T.Mora, Carlo Traverso (1992). Christoph M Hoffmann (ed.). "An introduction to the tangent cone algorithm". Issues in Robotics and Nonlinear Geometry (Advances in Computing Research). 6. Greenwich, Connecticut: JAI Press: 199–270.
{{cite journal}}
: CS1 maint: multiple names: authors list (link) - M. G. Marinari, H. M. Möller, T. Mora (1993). "Gröbner bases of ideals defined by functionals with an application to ideals of projective points". J.AAECC4. Springer: 103–145 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Jean-Charles Faugère, P. Gianni, Daniel Lazard, T. Mora (1993). "Efficient computation of zero-dimensional Gröbner bases by change of ordering". Journal of Symbolic Computation. 16. Elsevier: 329–344 – via Publisher's site. Publisher's PDF.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- E. Becker, T. Mora, M.G. Marinari, C. Traverso (1994). "The shape of the Shape Lemma". Proc.ISSAC'94. Association of Computing Machinery: 129–133 – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Boo Barkee, D. C. Can, J. Ecks, T. Moriarty, R.F. Ree (1994). "Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed" (PDF). Journal of Symbolic Computation. 18 (6). Elsevier: 497–501 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1994). "An introduction to commutative and non-commutative Gröbner bases". Theoretical Computer Science (journal). 134. Elsevier: 131–173 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- M.G. Marinari, T. Mora, H.M. Möller (1995). "Gröbner Duality and Multiplicities in Polynomial System Solving". Proc.ISSAC'95. Association of Computing Machinery – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.G. Marinari, H.M. Möller, T. Mora (1996). "On multiplicities in Polynomial System Solving". Transactions of the American Mathematical Society. 348 (8). American Mathematical Society: 3283–3321 – via Publisher's site. Publisher's PDF.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M. Borges-Trenard, M. Borges-Quintana, T. Mora (2000). "Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting". Journal of Symbolic Computation. 30. Elsevier: 429–449 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.Caboara, T.Mora (2002). "The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem" (PDF). AAECC: J.Appl.Alg. 13. Springer: 209–232 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- Teo Mora (March 1, 2003). Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy (PDF). Encyclopedia of Mathematics and its Applications Series. Vol. 88. Cambridge University Press. ISBN 9780521811545 – via Publisher's website. Excerpt. Draft.
{{cite book}}
: External link in
(help)|via=
- T. Mora, Massimiliano Sala (2003). "On the Gröbner bases of some symmetric systems and their application to Coding Theory". Journal of Symbolic Computation. 35. Elsevier: 177–194 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- M.E. Alonso, M.G. Marinari, M.T. Mora (2003). "The Big Mother of All the Dualities, I: Möller Algorithm" (PDF). Communications in Algebra. 31. Taylor & Francis: 783–818 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (2005). Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gröbner Technology. Encyclopedia of Mathematics and its Applications. Vol. 99. Cambridge University Press.
- T. Mora, E. Orsini, Massimiliano Sala (2006). "General error locator polynomials for binary cyclic codes with t <= 2 and n < 63" (PDF). 43. Ireland: Boole Centre (BCRI), University College Cork – via Publisher's site. Author's site.
{{cite journal}}
: Cite journal requires|journal=
(help); External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Eimear Byrne, T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "Gröbner bases over commutative rings and applications to coding theory" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 239–262. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via ResearchGate. GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora, Emmanuela Orsini (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). Decoding cyclic codes: the Cooper Philosophy (PDF). Springer. pp. 62–92. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite book}}
:|work=
ignored (help); External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "Gröbner Technology" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 11–26. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "The FGLM Problem and Moeller's Algorithm on Zero-dimensional Ideals" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 27–46. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T Mora (2016). Solving Polynomial Equation Systems IV: Buchberger Theory and Beyond. Encyclopedia of Mathematics and its Applications. Vol. 158. Cambridge University Press.