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]
See also
- FGLM algorithm, Buchberger's algorithm
- Gröbner fan, Gröbner basis
- Algebraic geometry#Computational algebraic geometry, System of polynomial equations
- Horror film#History, per Mora's 1977 book: Storia del cinema dell'orrore
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|via= - ^ Springer-Verlag website.
- ^ CUNY website.
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 (1979). "Computation of Finite Categories". University of Genova: unpublished note (Neubüser).
{{cite journal}}: Cite journal requires|journal=(help). Cited in e.g. this paper. - 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 (1983). "Classification of monomial curves". 101. Rendiconti Accademia Nazionale dei XL: 13–28. ISSN 0370-3460.
{{cite journal}}: Cite journal requires|journal=(help) - F. Mora (1983). "A constructive characterization of standard bases". 2. Boll. UMI sez. D: 41–50.
{{cite journal}}: Cite journal requires|journal=(help) - 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|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.
- M.T. De Benedetti, F. Mora, G. Ucovich (1984). "Polynomials of minimal degree and fixed period". Proc.MIMI'84: 170–172.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - F. Mora (1985). "An algorithmic approach to local rings" (PDF). Proc.EUROCAL'85: Lecture Notes in Computer Science. 204. Springer: 518–525.
- 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). "Computational aspects of reduction strategies to construct resolutions of monomial ideals" (PDF). Proc.AAECC2: Lecture Notes in Computer Science. 228. Springer: 182–197.
- H.M. Möller, F. Mora (1986). "New constructive methods in classical ideal theory". Journal of Algebra. 100. Elsevier: 138–178.
- P Gianni, A Miola, T Mora (1987). "Symbolic and algebraic computation research in Italy". SIGSAM Bulletin. Association of Computing Machinery.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - Teo Mora (1988). "Seven variations on standard bases" – via Bibliography.
{{cite journal}}: Cite journal requires|journal=(help); External link in|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.
- A. Miola, T. Mora (1988). "Constructive lifting in graded structures: a unified view of Buchberger and Hensel methods". Journal of Symbolic Computation. 6. Elsevier: 305–322.
- T. Mora (1988). "Standard bases and non-noetherianity: non-commutative polynomial rings" (PDF). Proc.AAECC4: Lecture Notes in Computer Science. 307. Springer: 98–109.
- M.E. Alonso, T. Mora, M. Raimondo (1989). "Computing with Algebraic Series". Proc.ISSAC'89. Association of Computing Machinery: 101–111 – via Publisher's site.
{{cite journal}}: External link in|via= - 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|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|via= - T. Mora, ed. (July 10, 1989). Proc.AAECC6: Lecture Notes in Computer Science. Vol. 356. Berlin and Heidelberg: Springer. ISBN 9783540510833.
- C. Traverso, T. Mora, ed. (1991). "Effective Methods in Algebraic Geometry". Proc.MEGA'90: Progress in Mathematics. Birkhauser – via Austria.
{{cite journal}}: External link in|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|via= - T. Mora (1995). "Gröbner bases and the word problem". Mora's website.
{{cite journal}}: Cite journal requires|journal=(help) Work in progress (last modified in 1995). - 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|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|via= - M.E. Alonso, T. Mora, M. Raimondo (1991). "On the complexity of algebraic power series". Proc.AAECC8: Lecture Notes in Computer Science. 508. Springer: 197–207 – via Publisher's site. CiteSeerX.
{{cite journal}}: External link in|via= - T. Mora (1991). "La queste del Saint Gra (AL): a computational approach to local algebra". Proc.AAECC7: Discrete Applied Mathematics. 33. Elsevier: 161–190 – via Publisher's site.
{{cite journal}}: External link in|via= - H. F. Mattson, T. Mora, ed. (1991). "Proc. AAECC 7: Applied algebra, Algebraic algorithms, and Error-Correcting Codes". Discrete Applied Mathematics. 33. Elsevier.
- H. F. Mattson, T. Mora, T.R.N. Rao, ed. (1991). Proc. AAECC 9. Vol. 539. Springer.
{{cite book}}:|work=ignored (help)CS1 maint: multiple names: editors list (link) - 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|via= - M.E.Alonso, G.Niesi, T.Mora, M.Raimondo (1992). "An Algorithm for Computing Analytic Branches of Space Curves at Singular Points". Proc. 1992 Intl. Workshop on Math. Mechanization. International Academic Publishers: 135–166 – via CiteSeerX.
{{cite journal}}: External link in|via= - M. E. Alonso, T. Mora, G. Niesi, M. Raimondo (1992). B. Falcidieno, I. Herman, C. Pienovi (ed.). "Local Parameterization of Space Curves at Singular Points" (PDF). Computer Graphics and Mathematics. Eurographic Seminar Series. Springer: 61–90 – via Publisher's site. Author's site.
{{cite journal}}: External link in|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|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) - Abdallah Assi, T. Mora (1993). "The virtues of laziness: the complexity of the tangent cone algorithm". J.AAECC. 4 (4). Springer: 231–238 – via Publisher's site.
{{cite journal}}: External link in|via= - T. Mora, L. Robbiano (1993). D. Eisenbud, L. Robbiano (ed.). "Points in affine and projective spaces". Computational Algebraic Geometry and Commutative Algebra. Cambridge University Press: 106–150 – via ResearchGate.
{{cite journal}}: External link in|via= - 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|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|via= - Gérard Cohen, Teo Mora, Oscar Moreno, ed. (1993). "Proc.AAECC10: Applied algebra, Algebraic algorithms and Error-Correcting Codes". Lecture Notes in Computer Science. 673. Springer Verlag – via GoogleScholar.
{{cite journal}}: External link in|via= - S. Licciardi, T. Mora (1994). "Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion" (PDF). Proc.ISSAC'94. Association of Computing Machinery: 191–196 – via Publisher's site. Author's site.
{{cite journal}}: External link in|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|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|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|via= - T. Mora (1994). "Polynomial System Solving, a Survey: EIDMA minicourse" – via CiteSeerX.
{{cite journal}}: Cite journal requires|journal=(help); External link in|via= - Patrizia M Gianni, Ferdinando (Teo) Mora, Lorenzo Robbiano, Carlo Traverso (1994). "Hilbert functions and Buchberger algorithm". preprint.
{{cite journal}}: Cite journal requires|journal=(help)CS1 maint: multiple names: authors list (link) - T. Mora, M. Evelina Rossi (1995). "An algorithm for the Hilbert function of a primary ideal" (PDF). Communications in Algebra. 23. Taylor & Francis: 1899–1911 – via Publisher's site. Author's site.
{{cite journal}}: External link in|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|via= - G. Cohen, M. Giusti, T. Mora, ed. (1995). Proc. AAECC 11. Vol. 948. Springer.
{{cite book}}:|work=ignored (help)CS1 maint: multiple names: editors list (link) - 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|via= - T. Mora (1997). "Gröbner Duality and multiple points in linearly general position". Proceedings of the American Mathematical Society. American Mathematical Society – via Publisher's site. Publisher's PDF.
{{cite journal}}: External link in|via= - T. Mora (1997). "A Note on the Castelnuovo Theory". Communications in Algebra. 25. Taylor & Francis: 2342–2354 – via Publisher's site. CiteSeerX.
{{cite journal}}: External link in|via= - E. Green, T. Mora, V. Ufnarovski (1998). "The Non-Commutative Gröbner Freaks". Proc. Conf. on Symbolic Rewriting Techniques. Birkhauser/Springer – via Publisher's site. CiteSeerX.
{{cite journal}}: External link in|via= - H. F. Mattson, T. Mora, ed. (1997). "Proc. AAECC 12". Lecture Notes in Computer Science. 1255. Springer.
- Birgit Reinert, Klaus Madlener, T. Mora (1998). "A Note on Nielsen Reduction and Coset Enumeration". Proc.ISSAC'98. Association of Computing Machinery: 171–178 – via Publisher's site. CiteSeerX.
{{cite journal}}: External link in|via= - T. Mora (1998). "De Nugis Gröbnerialium 1: Eagon, Northcott, Gröbner". Gröbner Bases and Applications. London Math. Soc. Lecture Notes Series. 251. Cambridge University Press: 434–447 – via CiteSeerX.
{{cite journal}}: External link in|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|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|via= - T. Mora, ed. (2002). "ISSAC'02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation". 193. New York: Association of Computing Machinery Press.
{{cite journal}}: Cite journal requires|journal=(help) - 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|via= - M.E. Alonso, M.G. Marinari, T. Mora (2010). "Oracle-supported drawing of the Gröbner escalier". preprint.
{{cite journal}}: Cite journal requires|journal=(help)CS1 maint: multiple names: authors list (link) - M.G. Marinari, T. Mora (2003). "A Remark on a remark by Macaualay, or, Enhancing Lazard Structural Theorem" (PDF). 29 (1). Bulletin of the Iranian Mathematical Society: 1–45 – via Publisher's site.
{{cite journal}}: Cite journal requires|journal=(help); External link in|via= - T. Mora (2003). "De Nugis Gröbnerialium 2: Applying Macaulay's Trick in order to easily write a Gröbner basis" (PDF). J. AAECC 13. Springer: 437–446 – via Publisher's site. Author's site.
{{cite journal}}: External link in|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|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|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|via= - Maria Emilia Alonso, Maria Grazia Marinari, T. Mora (2006). "The Big Mother of All the Dualities, II: Macaulay Bases" (PDF). J. AAECC. 17. Springer: 409–451 – via Publisher's site.
{{cite journal}}: External link in|via= - M. G. Marinari, T. Mora (2006). "Cerlienco-Mureddu Correspondence and Lazard Structural Theorem" (PDF). Investigaciones Mathematicas/Operacional. 27: 155–178.. See also Daniel Lazard.
- 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|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|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|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|via= - Michela Ceria, T Mora, Margherita Roggero (2015). "Term-ordering free involutive bases". Journal of Symbolic Computation. Elsevier – via Publisher's site.
{{cite journal}}: External link in|via=
- T Mora (2015). "A primer on ideal theoretical operation in non-commutative polynomial rings". Journal of Algebra and Its Applications. World Scientific.
- T Mora (2016). Solving Polynomial Equation Systems IV: Buchberger Theory and Beyond. Encyclopedia of Mathematics and its Applications. Vol. 158. Cambridge University Press.
- Michela Ceria, T Mora (2017). "Buchberger–Zacharias theory of multivariate ore extensions". Journal of Pure and Applied Algebra. Elsevier – via Publisher's site.
{{cite journal}}: External link in|via=