Curriculum Vitae up to February 3, 2013 Alessandro De Luca DIETI, University of Naples Federico II via Cintia, Monte S. Angelo 80126 Napoli, Italy alessandro.deluca@unina.it Personal Born: 1981 in Heerlen, Netherlands. Nationality: Italian. Current position Researcher (assistant professor) in Computer Science at the University of Naples Federico II, since December 28, 2010. Education and Employment Post-doc researcher at the Department of Mathematics of the University of Turku (Finland), within the Words, Numbers and Tilings with Applications project, headed by Luca Q. Zamboni and sponsored by the Finnish Academy via a FiDiPro grant, from October 1 to December 28, 2010. Afterwards, active participation in the project (part-time) until February 29, 2012. Post-doc researcher at the Laboratoire de Combinatoire et d Informatique Mathématique (LaCIM) of Université du Québec à Montréal (UQAM) under the supervision of Christophe Reutenauer and Srečko Brlek, from September 21, 2009 to September 20, 2010. Post-doc researcher in Computer Science at the Department of Mathematics and Applications of University of Naples Federico II, from June 1, 2008 to May 31, 2009. 1
Ph.D. in Mathematical Sciences, awarded on March 3, 2008 by the Graduate School in Mathematical and Computing Sciences of the University of Naples Federico II. Thesis: Combinatorial aspects of Sturmian sequences and their generalizations. Supervisor: Aldo de Luca. Attendance of the Algebraic Geometry and Algebraic Topology classes of the Scuola Matematica Interuniversitaria (SMI), at the University of Perugia (Italy), August 2003. Native Italian speaker; fluent English speaker and good French speaker. Teaching Experience Since academic year 2011/12, teacher of the Databases and information systems lab class, for undergraduate Computer Science students at the University of Naples Federico II. Teaching assistance for the Mathematics for computer scientists class held by Anne Bergeron at UQAM in 2010. Teaching assistance for the Matrix Algebra class held by Srečko Brlek at UQAM in 2010. Teaching assistance for the Information Theory class held by Aldo de Luca at University of Naples Federico II, 2005 2008. Scientific research The main areas of my research are theoretical computer science and discrete mathematics. In particular, I am interested in combinatorics on words, the study of structural and algebraic properties of finite and infinite strings of symbols. This field has deep connections with number theory, physics, biology, and other areas of computer science. Sturmian and episturmian words, as well as several generalizations, have been the main topic of my investigation. In 2004 I began working on finite factors of Sturmian words, finding new characterizations (implemented as linear-time algorithms) and studying the structure and enumeration of palindromic factors [1 3]. More recently, we characterized infinite Sturmian words in terms of lexicographic orders [4], and considered Christoffel words [5, 6], which are factors of Sturmian words, and trapezoidal words [7], which include such factors. 2
After the first papers we also moved to generalizations, and in particular episturmian words, mostly from the point of view of the palindrome closure operator [8 10]. Inspired by bioinformatics (Watson-Crick involution), we introduced and studied some further generalizations, all based on special factors and involutory antimorphisms of the free monoid [8, 11 18]. Recently I also focused on rich words, a family of finite and infinite words which contains episturmian words and their factors, from the point of view of complexity [19, 20] and periodicity [21]. I am currently investigating such themes also in the context of 2-dimensional infinite words (Nivat s conjecture), with the FiDiPro team in Turku. Research Projects and Collaborations Member of the Group for Algebraic and Geometric Structures and Their Applications (GNSAGA) by the Italian Institute for Higher Mathematics (INdAM) since 2005. Participating in the project PRIN 2010 11 Automi e Linguaggi Formali: Aspetti Matematici e Applicativi (Automata and formal languages: mathematical and applicative aspects) funded by the Italian Ministry of Education (MIUR). Previously member of similar projects PRIN 2007 and PRIN 2005. Invited at the University of Turku (Finland) from March till June 2006, for research under the supervision of Prof. Juhani Karhumäki. Visiting University of North Texas (Denton, USA) in 2007, from November 6 to December 18, invited by Prof. Luca Q. Zamboni. Active participation in the Words, Numbers and Tilings with Applications project at the University of Turku, sponsored by the Finnish Academy. Current collaborations with the research teams headed by Christophe Reutenauer and Srečko Brlek at UQAM, and by Luca Zamboni and Jarkko Kari at University of Turku. Conferences attended Developments in Language Theory: Palermo (Italy) July 4 8, 2005; Kyoto (Japan) September 16 19, 2008; Stuttgart (Germany) Jun 30 Jul 3, 2009; London, ON (Canada) August 17 20, 2010; Milan (Italy) July 19 22, 2011. 3
WORDS: Montreal (Canada) September 13 17, 2005; Marseille (France) September 17 21, 2007; Salerno (Italy) September 14 18, 2009 (member of the organizing committee); Prague (Czech Republic) September 12 16, 2011. Workshop on Words and Automata, St. Petersburg (Russia) June 7, 2006. Journées Montoises d Informatique Théorique: Rennes (France) Aug 30 Sep 2, 2006; Mons (Belgium) August 27 30, 2008. Workshop on Fibonacci Words, Turku (Finland) September 27 30, 2006. AutoMathA, Palermo, June 18 22, 2007. Language and Automata Theory and Applications, Tarragona (Spain) April 2 8, 2009. Discrete Geometry for Computer Imagery, Montreal, Sep 30 Oct 2, 2009. Interaction entre Géometrie discrete et combinatoire des mots workshop, Marseille, June 7 10, 2010. LaCIM 2010, Montreal, August 29 31, 2010. Sage Day 25.5 and GASCom: Génération aléatoire de structures combinatoires, Montreal, September 1 4, 2010. Highlights of AutoMathA, Vienna (Austria) 21 24, 2010. Combinatorial and Algorithmic Aspects of Sequence Processing seminar, Dagstuhl (Germany) February 20 25, 2011. Russian-Finnish Symposium on Discrete Mathematics: St. Petersburg, September 21 24, 2011; Turku, September 25 28, 2012. GAMES, Naples, September 7 12, 2012. 4
Talks Palindromes in Sturmian Words, at the DLT 2005 conference in Palermo, July 8, 2005. Sequenze Sturmiane. Teoria e Applicazioni, at the University of Naples Federico II, October 24, 2005. Sturmian Words. Some characterisations and extensions, at University of Turku, May 24, 2006. Some generalizations of episturmian words and morphisms, at the WORDS 2007 conference in Marseille, September 18, 2007. Special factors and images of Arnoux-Rauzy words, at the JM08 conference in Mons, August 30, 2008. On a Family of Morphic Images of Arnoux-Rauzy Words, at the LATA 2009 conference in Tarragona, April 6, 2009. Palindromic Richness in Finite and Infinite Words, for the Séminaire du LaCIM in Montreal, November 27, 2009. Reversible Christoffel factorizations, at the RuFiDiM conference in St. Petersburg, September 22, 2011. Publications [1] A. de Luca and A. De Luca. Palindromes in Sturmian Words. In C. De Felice and A. Restivo, editors, Developments in Language Theory, volume 3572 of Lecture Notes in Computer Science, pages 199 208. Springer, 2005. [2] A. de Luca and A. De Luca. Combinatorial properties of Sturmian palindromes. Internat. J. Found. Comput. Sci., 17:557 574, 2006. [3] A. de Luca and A. De Luca. Some characterizations of finite Sturmian words. Theoret. Comput. Sci., 356:118 125, 2006. [4] M. Bucci, A. De Luca, and L. Q. Zamboni. Some characterizations of sturmian words in terms of the lexicographic order. Fund. Inform., 116(1 4):25 33, 2012. [5] A. De Luca and C. Reutenauer. Christoffel words and the Calkin-Wilf tree. Electron. J. Combin., 18(2):P22, 2011. [6] M. Bucci, A. De Luca, and L. Q. Zamboni. Reversible Christoffel factorizations. In First Russian-Finnish Symposium on Discrete Mathematics (RuFiDiM), pages 13 15, St. Petersburg, Russia, 2011. Euler International Mathematical Institute. 5
[7] M. Bucci, A. De Luca, and G. Fici. Enumeration and structure of trapezoidal words. Theoret. Comput. Sci., 468:12 22, 2013. doi: 10.1016/j.tcs.2012.11.007. [8] A. de Luca and A. De Luca. Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci., 362:282 300, 2006. [9] M. Bucci, A. de Luca, and A. De Luca. On the number of episturmian palindromes. Theoret. Comput. Sci., 411:3668 3684, 2010. [10] A. de Luca and A. De Luca. A generalized palindromization map in free monoids. Theoret. Comput. Sci., 454:109 128, 2012. [11] M. Bucci and A. De Luca. On a Family of Morphic Images of Arnoux-Rauzy Words. In A. H. Dediu, A. M. Ionescu, and C. Martín-Vide, editors, Language and Automata Theory and Applications, volume 5457 of Lecture Notes in Computer Science, pages 259 266. Springer, 2009. [12] M. Bucci, A. de Luca, and A. De Luca. Characteristic morphisms of generalized episturmian words. Theoret. Comput. Sci., 410:2840 2859, 2009. [13] M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On -episturmian words. European J. Combin., 30:473 479, 2009. [14] M. Bucci, A. de Luca, and A. De Luca. On a Generalization of Standard Episturmian Morphisms. In M. Ito and M. Toyama, editors, Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, pages 158 169. Springer, 2008. [15] M. Bucci and A. De Luca. Special factors and images of Arnoux-Rauzy words. In Local Proceedings of the 12th Journées Montoises d Informatique Théorique, 2008. [16] M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On different generalizations of episturmian words. Theoret. Comput. Sci., 393:23 36, 2008. [17] M. Bucci, A. de Luca, A. De Luca, and L. Q. Zamboni. On some problems related to palindrome closure. Theor. Inform. Appl., 42:679 700, 2008. [18] M. Bucci, A. de Luca, and A. De Luca. Some generalizations of episturmian words and morphisms. In P. Arnoux, N. Bédaride, and J. Cassaigne, editors, Proceedings of WORDS 2007, pages 100 108, 2007. [19] M. Bucci, A. De Luca, A. Glen, and L. Q. Zamboni. A new characteristic property of rich words. Theoret. Comput. Sci., 410:2860 2863, 2009. Preliminary version in Local Proceedings of the 12th Journées Montoises d Informatique Théorique, 2008. [20] M. Bucci, A. De Luca, A. Glen, and L. Q. Zamboni. A connection between palindromic and factor complexity using return words. Adv. in Appl. Math., 42:60 74, 2009. [21] M. Bucci, A. de Luca, and A. De Luca. Rich and periodic-like words. In V. Diekert and D. Nowotka, editors, DLT 2009, volume 5583 of Lecture Notes in Computer Science, pages 145 155. Springer, 2009. 6