25,161
edits
Changes
Created page with "'''Home * People * Maurizio Monge''' FILE:MaurizioMonge.jpg|border|right|thumb|240px|link=https://www.linkedin.com/in/maurizio-monge-7300474a/ | Maurizio..."
'''[[Main Page|Home]] * [[People]] * Maurizio Monge'''
[[FILE:MaurizioMonge.jpg|border|right|thumb|240px|link=https://www.linkedin.com/in/maurizio-monge-7300474a/
| Maurizio Monge <ref>[https://www.linkedin.com/in/maurizio-monge-7300474a/ Maurizio Monge | LinkedIn]</ref>
]]
'''Maurizio Monge''',<br/>
an Italian mathematician and computer scientist, Ph.D. in 2012 from [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa] under supervision of [[Mathematician#RDvornicich|Roberto Dvornicich]] <ref>[[Maurizio Monge]] ('''2012'''). ''A constructive theory for extensions of p-adic fields''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa], advisor [[Mathematician#RDvornicich|Roberto Dvornicich]]</ref>.
His research interests include [https://en.wikipedia.org/wiki/Finite_extensions_of_local_fields extensions of local fields], [https://en.wikipedia.org/wiki/Galois_module Galois modules], structure of [https://en.wikipedia.org/wiki/Recurrence_relation recurrence sequences], arithmetic of [https://en.wikipedia.org/wiki/Field_%28mathematics%29#Field_of_functions function field], and more recently [https://en.wikipedia.org/wiki/Dynamical_system dynamical systems] and [https://en.wikipedia.org/wiki/Noise-induced_order noise-induced order].
=Computer Chess=
Interested in computer chess and programming, Maurizio Monge developed his chess engines [[RattateChess]] and [[RattatAjedrez]] <ref>[https://sites.google.com/site/rattatajedrez/ RattatAjedrez]</ref>.
He has further created various chess [[Pieces|piece sets]] using [https://en.wikipedia.org/wiki/Inkscape Inkscape], available as [https://en.wikipedia.org/wiki/Scalable_Vector_Graphics SVG] source, processed [https://en.wikipedia.org/wiki/Portable_Network_Graphics PNG files] and [[XBoard]] theme <ref>[https://poisson.phc.dm.unipi.it/~monge/chess_art.php Maurizio Monge's homepage - Chess art]</ref>.
=Perfect Hashing=
Motivated by the application of [[Magic Bitboards|magic bitboards]], Maurizio worked on its generalization of [[Hash Table#PerfectHashing|perfect hashing]] of numbers with sparse digit representation via multiplication by a constant, elaborating on [https://en.wikipedia.org/wiki/Convolution Convolution], [https://en.wikipedia.org/wiki/Toeplitz_matrix Toeplitz matrix], and [https://en.wikipedia.org/wiki/Schur_polynomial Schur polynomial], published in 2010 on [https://en.wikipedia.org/wiki/ArXiv arXiv] <ref>[[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196]</ref>, amd in 2011 in [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 159, No. 11.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/m/Monge:Maurizio.html dblp: Maurizio Monge]</ref> <ref>[https://scholar.google.com/citations?user=gpgb4LgAAAAJ&hl=en Maurizio Monge - Google Scholar Citations]</ref>
==2009==
* [[Maurizio Monge]] ('''2009'''). ''Generation of the Symmetric Field by Newton Polynomials in prime Characteristic''. [https://arxiv.org/abs/0903.3192 arXiv:0903.3192]
* [https://dblp.org/pers/hd/d/Dubbini:Nevio Nevio Dubbini], [[Maurizio Monge]] ('''2009'''). ''An equivalent of Kronecker's Theorem for powers of an Algebraic Number and Structure of Linear Recurrences of fixed length''. [https://arxiv.org/abs/0910.5182 arXiv:0910.5182]
* [https://dblp.org/pers/hd/d/Dubbini:Nevio Nevio Dubbini], [[Maurizio Monge]], [https://dblp.org/pers/hd/b/Bicchi:Antonio Antonio Bicchi] ('''2009'''). ''Left invertibility of I/O quantized linear systems in dimension 1: a number theoretic approach''. [https://arxiv.org/abs/0911.0768 arXiv:0911.0768]
==2010 ...==
* [[Maurizio Monge]] ('''2010'''). ''[https://www.semanticscholar.org/paper/Determination-of-the-number-of-isomorphism-classes-Monge/3aa9f1393d4a313d530a6710cb353a8c5f73fb0c Determination of the number of isomorphism classes of extensions of a p-adic field]''. [https://en.wikipedia.org/wiki/Journal_of_Number_Theory Journal of Number Theory], Vol. 131, No. 8 <ref>[https://en.wikipedia.org/wiki/Isomorphism_class Isomorphism class from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/P-adic_number p-adic number from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/v/Viglietta:Giovanni Giovanni Viglietta], [[Maurizio Monge]] ('''2010'''). ''The 3-dimensional searchlight scheduling problem''. [https://dblp.uni-trier.de/db/conf/cccg/cccg2010.html CCCG 2010], [https://pdfs.semanticscholar.org/9b35/9b2674c3b713352b346a547eaffdce695ebd.pdf pdf]
* [[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196] » [[Magic Bitboards]]
* [[Maurizio Monge]] ('''2010'''). ''Determination of the number of isomorphism classes of extensions of a p-adic field''. [https://arxiv.org/abs/1011.0357 arXiv:1011.0357]
* [[Maurizio Monge]] ('''2011'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 159, No. 11
* [[Mathematician#ACobbe|Alessandro Cobbe]], [[Maurizio Monge]] ('''2011'''). ''Answer to a question on A-groups, arisen from the study of Steinitz classes''. [https://arxiv.org/abs/1109.2065 arXiv:1109.2065] <ref>[https://en.wikipedia.org/wiki/Dedekind_domain Dedekind domain from Wikipedia]</ref>
* [[Maurizio Monge]] ('''2011'''). ''A characterization of Eisenstein polynomials generating cyclic extensions of degree p2 and p3 over an unramified p-adic field''. [https://arxiv.org/abs/1109.4616 arXiv:1109.4616] <ref>[https://en.wikipedia.org/wiki/Eisenstein%27s_criterion Eisenstein's criterion from Wikipedia]</ref>
* [[Maurizio Monge]] ('''2011'''). ''A family of Eisenstein polynomials generating totally ramified extensions, identification of extensions and construction of class fields''. [https://arxiv.org/abs/1109.4617 arXiv:1109.4617]
* [[Maurizio Monge]] ('''2012'''). ''A constructive theory for extensions of p-adic fields''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa], advisor [[Mathematician#RDvornicich|Roberto Dvornicich]]
==2015 ...==
* [[Mathematician#JFAlves|Jose F. Alves]], [[Maurizio Monge]] ('''2015'''). ''Non-denseness of hyperbolicity for linear isomorphisms in Banach spaces''. [https://arxiv.org/abs/1510.05831 arXiv:1510.05831] <ref>[https://en.wikipedia.org/wiki/Banach_space Banach space from Wikipedia]</ref>
* [[Mathematician#IDelCorso|Ilaria Del Corso]], [[Mathematician#RDvornicich|Roberto Dvornicich]], [[Maurizio Monge]] ('''2016'''). ''On wild extensions of a p-adic field''. [https://arxiv.org/abs/1601.05939 arXiv:1601.05939]
* [[Mathematician#SGalatolo|Stefano Galatolo]], [[Maurizio Monge]], [https://dblp.uni-trier.de/pers/hd/n/Nisoli:Isaia Isaia Nisoli] ('''2017'''). ''Existence of Noise Induced Order, a Computer Aided Proof''. [https://arxiv.org/abs/1702.07024 arXiv:1702.07024] <ref>[https://en.wikipedia.org/wiki/Noise-induced_order Noise-induced order from Wikipedia]</ref>
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=457918 What is Botvinnik-Markov extension?] by [[Maurizio Monge]], [[CCC]], October 26, 2005 » [[Botvinnik-Markoff Extension]]
* [https://www.stmintz.com/ccc/index.php?id=461084 Conspiracy Numbers Search] by [[Maurizio Monge]], [[CCC]], November 11, 2005 » [[Conspiracy Number Search]]
* [https://www.stmintz.com/ccc/index.php?id=464128 A. STEEN vs. FRUIT 2.2.1 {Posted at request of Graham Banks & M. Monge}] by A. Steen, [[CCC]], November 24, 2005 » [[Fruit]]
=External Links=
* [https://poisson.phc.dm.unipi.it/~monge/index.php Maurizio Monge's homepage]
: [https://poisson.phc.dm.unipi.it/~monge/programs.php Maurizio Monge's homepage - Programs]
: [https://poisson.phc.dm.unipi.it/~monge/chess_art.php Maurizio Monge's homepage - Chess art] » [[Pieces]], [[2D Graphics Board]], [[XBoard]]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=175098 The Mathematics Genealogy Project - Maurizio Monge]
* [https://www.linkedin.com/in/maurizio-monge-7300474a/ Maurizio Monge | LinkedIn]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Monge]]
[[Category:Mathematician|Monge]]
[[FILE:MaurizioMonge.jpg|border|right|thumb|240px|link=https://www.linkedin.com/in/maurizio-monge-7300474a/
| Maurizio Monge <ref>[https://www.linkedin.com/in/maurizio-monge-7300474a/ Maurizio Monge | LinkedIn]</ref>
]]
'''Maurizio Monge''',<br/>
an Italian mathematician and computer scientist, Ph.D. in 2012 from [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa] under supervision of [[Mathematician#RDvornicich|Roberto Dvornicich]] <ref>[[Maurizio Monge]] ('''2012'''). ''A constructive theory for extensions of p-adic fields''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa], advisor [[Mathematician#RDvornicich|Roberto Dvornicich]]</ref>.
His research interests include [https://en.wikipedia.org/wiki/Finite_extensions_of_local_fields extensions of local fields], [https://en.wikipedia.org/wiki/Galois_module Galois modules], structure of [https://en.wikipedia.org/wiki/Recurrence_relation recurrence sequences], arithmetic of [https://en.wikipedia.org/wiki/Field_%28mathematics%29#Field_of_functions function field], and more recently [https://en.wikipedia.org/wiki/Dynamical_system dynamical systems] and [https://en.wikipedia.org/wiki/Noise-induced_order noise-induced order].
=Computer Chess=
Interested in computer chess and programming, Maurizio Monge developed his chess engines [[RattateChess]] and [[RattatAjedrez]] <ref>[https://sites.google.com/site/rattatajedrez/ RattatAjedrez]</ref>.
He has further created various chess [[Pieces|piece sets]] using [https://en.wikipedia.org/wiki/Inkscape Inkscape], available as [https://en.wikipedia.org/wiki/Scalable_Vector_Graphics SVG] source, processed [https://en.wikipedia.org/wiki/Portable_Network_Graphics PNG files] and [[XBoard]] theme <ref>[https://poisson.phc.dm.unipi.it/~monge/chess_art.php Maurizio Monge's homepage - Chess art]</ref>.
=Perfect Hashing=
Motivated by the application of [[Magic Bitboards|magic bitboards]], Maurizio worked on its generalization of [[Hash Table#PerfectHashing|perfect hashing]] of numbers with sparse digit representation via multiplication by a constant, elaborating on [https://en.wikipedia.org/wiki/Convolution Convolution], [https://en.wikipedia.org/wiki/Toeplitz_matrix Toeplitz matrix], and [https://en.wikipedia.org/wiki/Schur_polynomial Schur polynomial], published in 2010 on [https://en.wikipedia.org/wiki/ArXiv arXiv] <ref>[[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196]</ref>, amd in 2011 in [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 159, No. 11.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/m/Monge:Maurizio.html dblp: Maurizio Monge]</ref> <ref>[https://scholar.google.com/citations?user=gpgb4LgAAAAJ&hl=en Maurizio Monge - Google Scholar Citations]</ref>
==2009==
* [[Maurizio Monge]] ('''2009'''). ''Generation of the Symmetric Field by Newton Polynomials in prime Characteristic''. [https://arxiv.org/abs/0903.3192 arXiv:0903.3192]
* [https://dblp.org/pers/hd/d/Dubbini:Nevio Nevio Dubbini], [[Maurizio Monge]] ('''2009'''). ''An equivalent of Kronecker's Theorem for powers of an Algebraic Number and Structure of Linear Recurrences of fixed length''. [https://arxiv.org/abs/0910.5182 arXiv:0910.5182]
* [https://dblp.org/pers/hd/d/Dubbini:Nevio Nevio Dubbini], [[Maurizio Monge]], [https://dblp.org/pers/hd/b/Bicchi:Antonio Antonio Bicchi] ('''2009'''). ''Left invertibility of I/O quantized linear systems in dimension 1: a number theoretic approach''. [https://arxiv.org/abs/0911.0768 arXiv:0911.0768]
==2010 ...==
* [[Maurizio Monge]] ('''2010'''). ''[https://www.semanticscholar.org/paper/Determination-of-the-number-of-isomorphism-classes-Monge/3aa9f1393d4a313d530a6710cb353a8c5f73fb0c Determination of the number of isomorphism classes of extensions of a p-adic field]''. [https://en.wikipedia.org/wiki/Journal_of_Number_Theory Journal of Number Theory], Vol. 131, No. 8 <ref>[https://en.wikipedia.org/wiki/Isomorphism_class Isomorphism class from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/P-adic_number p-adic number from Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/v/Viglietta:Giovanni Giovanni Viglietta], [[Maurizio Monge]] ('''2010'''). ''The 3-dimensional searchlight scheduling problem''. [https://dblp.uni-trier.de/db/conf/cccg/cccg2010.html CCCG 2010], [https://pdfs.semanticscholar.org/9b35/9b2674c3b713352b346a547eaffdce695ebd.pdf pdf]
* [[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196] » [[Magic Bitboards]]
* [[Maurizio Monge]] ('''2010'''). ''Determination of the number of isomorphism classes of extensions of a p-adic field''. [https://arxiv.org/abs/1011.0357 arXiv:1011.0357]
* [[Maurizio Monge]] ('''2011'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 159, No. 11
* [[Mathematician#ACobbe|Alessandro Cobbe]], [[Maurizio Monge]] ('''2011'''). ''Answer to a question on A-groups, arisen from the study of Steinitz classes''. [https://arxiv.org/abs/1109.2065 arXiv:1109.2065] <ref>[https://en.wikipedia.org/wiki/Dedekind_domain Dedekind domain from Wikipedia]</ref>
* [[Maurizio Monge]] ('''2011'''). ''A characterization of Eisenstein polynomials generating cyclic extensions of degree p2 and p3 over an unramified p-adic field''. [https://arxiv.org/abs/1109.4616 arXiv:1109.4616] <ref>[https://en.wikipedia.org/wiki/Eisenstein%27s_criterion Eisenstein's criterion from Wikipedia]</ref>
* [[Maurizio Monge]] ('''2011'''). ''A family of Eisenstein polynomials generating totally ramified extensions, identification of extensions and construction of class fields''. [https://arxiv.org/abs/1109.4617 arXiv:1109.4617]
* [[Maurizio Monge]] ('''2012'''). ''A constructive theory for extensions of p-adic fields''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Scuola_Normale_Superiore_di_Pisa Scuola Normale Superiore di Pisa], advisor [[Mathematician#RDvornicich|Roberto Dvornicich]]
==2015 ...==
* [[Mathematician#JFAlves|Jose F. Alves]], [[Maurizio Monge]] ('''2015'''). ''Non-denseness of hyperbolicity for linear isomorphisms in Banach spaces''. [https://arxiv.org/abs/1510.05831 arXiv:1510.05831] <ref>[https://en.wikipedia.org/wiki/Banach_space Banach space from Wikipedia]</ref>
* [[Mathematician#IDelCorso|Ilaria Del Corso]], [[Mathematician#RDvornicich|Roberto Dvornicich]], [[Maurizio Monge]] ('''2016'''). ''On wild extensions of a p-adic field''. [https://arxiv.org/abs/1601.05939 arXiv:1601.05939]
* [[Mathematician#SGalatolo|Stefano Galatolo]], [[Maurizio Monge]], [https://dblp.uni-trier.de/pers/hd/n/Nisoli:Isaia Isaia Nisoli] ('''2017'''). ''Existence of Noise Induced Order, a Computer Aided Proof''. [https://arxiv.org/abs/1702.07024 arXiv:1702.07024] <ref>[https://en.wikipedia.org/wiki/Noise-induced_order Noise-induced order from Wikipedia]</ref>
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=457918 What is Botvinnik-Markov extension?] by [[Maurizio Monge]], [[CCC]], October 26, 2005 » [[Botvinnik-Markoff Extension]]
* [https://www.stmintz.com/ccc/index.php?id=461084 Conspiracy Numbers Search] by [[Maurizio Monge]], [[CCC]], November 11, 2005 » [[Conspiracy Number Search]]
* [https://www.stmintz.com/ccc/index.php?id=464128 A. STEEN vs. FRUIT 2.2.1 {Posted at request of Graham Banks & M. Monge}] by A. Steen, [[CCC]], November 24, 2005 » [[Fruit]]
=External Links=
* [https://poisson.phc.dm.unipi.it/~monge/index.php Maurizio Monge's homepage]
: [https://poisson.phc.dm.unipi.it/~monge/programs.php Maurizio Monge's homepage - Programs]
: [https://poisson.phc.dm.unipi.it/~monge/chess_art.php Maurizio Monge's homepage - Chess art] » [[Pieces]], [[2D Graphics Board]], [[XBoard]]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=175098 The Mathematics Genealogy Project - Maurizio Monge]
* [https://www.linkedin.com/in/maurizio-monge-7300474a/ Maurizio Monge | LinkedIn]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Monge]]
[[Category:Mathematician|Monge]]
