Narad Rampersad. Research interests: Combinatorics on words. Formal languages and automata. Number theory. Ramsey theory.

Size: px

Start display at page:

Download "Narad Rampersad. Research interests: Combinatorics on words. Formal languages and automata. Number theory. Ramsey theory."

Easter Flynn
6 years ago
Views:

1 Narad Rampersad Assistant Professor Department of Mathematics and Statistics University of Winnipeg 515 Portage Ave. Winnipeg, MB, R3B 2E9 CANADA Citizenship: Canadian. Research interests: Combinatorics on words. Formal languages and automata. Number theory. Ramsey theory. Education: Ph.D., Computer Science, University of Waterloo, June Thesis subject: Overlap- Free Words and Generalizations. Advisor: Jeffrey Shallit. M.Math., Computer Science, University of Waterloo, June Thesis subject: Infinite Sequences and Pattern Avoidance. Advisor: Jeffrey Shallit. B.Sc., Summa cum laude, Computer Science, University of Ottawa, June Languages: English (native speaker), French (fluent). Academic employment: University of Winnipeg, Dept. of Mathematics and Statistics, Assistant Professor, Sept Current. University of Liège, Discrete Mathematics Group, Postdoctoral Researcher, Jan Aug University of Winnipeg, Dept. of Mathematics and Statistics, NSERC Postdoctoral fellow, Jan Dec

2 Other employment: EMS Technologies, Engineering Assistant, Jun Aug Teaching: Instructor, Basic Calculus (1st year course), Winter Instructor, Number Theory (2nd year course), Fall Instructor, Discrete Mathematics (1st year course), Spring 2008, Fall 2009, Fall Instructor, Formal Languages and Parsing (4th year course), Fall Journal publications in press: 1. E. Charlier, N. Rampersad, J. Shallit, Enumeration and decidable properties of automatic sequences. To appear in Internat. J. Found. Comp. Sci. 2. M. Domaratzki, N. Rampersad, Abelian primitive words. To appear in Internat. J. Found. Comp. Sci. 3. N. Rampersad, J. Shallit, Z. Xu, The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. To appear in Fundamenta Informaticae. 4. A. Lacroix, N. Rampersad, M. Rigo, E. Vandomme, Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure. To appear in Fundamenta Informaticae. Journal publications: 1. E. Charlier, A. Lacroix, N. Rampersad, Multi-dimensional sets recognizable in all abstract numeration systems, Theor. Inform. Appl. 46 (2012), J. Currie, N. Rampersad, Fixed points avoiding Abelian k-powers, J. Combin. Theory Ser. A. 119 (2012), E. Charlier, N. Rampersad, The growth function of S-recognizable sets, Theoret. Comput. Sci. 412 (2011), E. Charlier, N. Rampersad, M. Rigo, L. Waxweiler, The minimal automaton recognizing mn in a linear numeration system, INTEGERS 11B (2011), A4. 5. N. Rampersad, Further applications of a power series method for pattern avoidance, Electron. J. Combinatorics 18(1) (2011), #P134. 2

3 6. J. Currie, N. Rampersad, Recurrent words with constant Abelian complexity, Adv. Appl. Math. 47 (2011), J. Currie, N. Rampersad, A proof of Dejean s conjecture, Math. Comp. 80 (2011), N. Rampersad, J. Shallit, M.-w. Wang, Inverse star, borders, and palstars, Inform. Process. Lett. 111 (2011), B. Blakeley, F. Blanchet-Sadri, J. Gunter, N. Rampersad, On the complexity of deciding avoidability of sets of partial words, Theoret. Comput. Sci. 411 (2010), P. Gawrychowski, D. Krieger, N. Rampersad, J. Shallit, Finding the growth rate of a regular or context-free language in polynomial time, Internat. J. Found. Comp. Sci. 21 (2010), J. Currie, N. Rampersad, Cubefree words with many squares, Discrete Math. and Theoret. Comput. Sci. 12 (2010), J. Currie, N. Rampersad, Infinite words containing squares at every position, Theor. Inform. Appl. 44 (2010), N. Rampersad, J. Shallit, Detecting patterns in finite regular and context-free languages, Inform. Process. Lett. 110 (2010), J. Currie, N. Rampersad, Dejean s conjecture holds for n 27, Theor. Inform. Appl. 43 (2009), T. Anderson, J. Loftus, N. Rampersad, N. Santean, J. Shallit, Detecting palindromes, patterns, and borders in regular languages, Inform. and Comput. 207 (2009), J.-Y. Kao, A. Malton, N. Rampersad, J. Shallit, On NFA s where all states are final, initial, or both, Theoret. Comput. Sci. 410 (2009), J. Currie, N. Rampersad, Dejean s conjecture holds for n 30, Theoret. Comput. Sci. 410 (2009), J.-P. Allouche, N. Rampersad, J. Shallit, Periodicity, repetitions, and orbits of an automatic sequence, Theoret. Comput. Sci. 410 (2009), J. Currie, N. Rampersad, There are k-uniform cubefree binary morphisms for all k 0, Discrete Appl. Math. 157 (2009), N. Rampersad, B. Ravikumar, N. Santean, J. Shallit, A study on unique rational operations, Theoret. Comput. Sci. 410 (2009),

4 21. D. Krieger, A. Miller, N. Rampersad, B. Ravikumar, J. Shallit, Decimations of languages and state complexity, Theoret. Comput. Sci. 410 (2009), N. Rampersad, Avoiding sufficiently large binary patterns, Bull. Europ. Assoc. Theoret. Comput. Sci. 95 (2008), J. Currie, N. Rampersad, For each α > 2 there is an infinite binary word with critical exponent α, Electron. J. Combinatorics 15 (2008), #N P. Ochem, N. Rampersad, J. Shallit, Avoiding approximate squares, Internat. J. Found. Comp. Sci. 19 (2008), B. Adamczewski, N. Rampersad, On patterns occurring in binary algebraic numbers, Proc. Amer. Math. Soc. 136 (2008), J.-Y. Kao, N. Rampersad, J. Shallit, M. Silva, Words avoiding repetitions in arithmetic progressions, Theoret. Comput. Sci. 391 (2008), N. Rampersad, On the context-freeness of the set of words containing overlaps, Inform. Process. Lett. 102 (2007), J. Currie, N. Rampersad, J. Shallit, Binary words containing infinitely many overlaps, Electron. J. Combinatorics 13 (2006), #R N. Rampersad, The state complexity of L 2 and L k, Inform. Process. Lett. 98 (2006), S. Brown, N. Rampersad, J. Shallit, T. Vasiga, Squares and overlaps in the Thue Morse sequence and some variants, Theor. Inform. Appl. 40 (2006), N. Rampersad, Words avoiding 7/3-powers and the Thue-Morse morphism, Internat. J. Found. Comp. Sci. 16 (2005), N. Rampersad, J. Shallit, M.-w. Wang, Avoiding large squares in infinite binary words, Theoret. Comput. Sci. 339 (2005), J.-P. Allouche, N. Rampersad, J. Shallit, On integer sequences whose first iterates are linear, Aequationes Math. 69 (2005), N. Rampersad, J. Shallit, Words avoiding reversed subwords, J. Combin. Math. Combin. Comput. 54 (2005), A. Aberkane, J. Currie, N. Rampersad, The number of ternary words avoiding abelian cubes grows exponentially, J. Integer Sequences 7 (2004), Article

5 Conference publications: 1. E. Charlier, N. Rampersad, M. Rigo, L. Waxweiler, Structure of the minimal automaton of a numeration language and applications to state complexity. In Proceedings of Journées Montoises D Informatique Théorique E. Charlier, N. Rampersad, M. Rigo, L. Waxweiler, State complexity of testing divisibility. In Proceedings of DCFS F. Blanchet-Sadri, B. Blakeley, J. Gunter, N. Rampersad, On the complexity of deciding avoidability of sets of partial words. In Proceedings of DLT 09, LNCS 5583, pp , Springer-Verlag, J. Currie, N. Rampersad, Infinite words containing squares at every position. In Proceedings of Journées Montoises D Informatique Théorique P. Gawrychowski, D. Krieger, N. Rampersad, J. Shallit, Finding the growth rate of a regular or context-free language in polynomial time. In Proceedings of DLT 08, LNCS 5257, pp , Springer-Verlag, T. Anderson, N. Rampersad, N. Santean, J. Shallit, Finite automata, palindromes, patterns, and borders. In Proceedings of LATA 08, LNCS 5196, pp , Springer- Verlag, D. Krieger, P. Ochem, N. Rampersad, J. Shallit, Avoiding approximate squares. In Proceedings of DLT 07, LNCS 4588, pp , Springer-Verlag, S. Brown, N. Rampersad, J. Shallit, T. Vasiga, Squares and overlaps in the Thue Morse sequence and some variants. In Proceedings of WACAM 04, LaRIA Technical Report , pp , N. Rampersad, Words avoiding 7/3-powers and the Thue-Morse morphism. In Proceedings of DLT 04, LNCS 3340, pp , Springer-Verlag, N. Rampersad, J. Shallit, M.-w. Wang, Avoiding large squares in infinite binary words. In Proceedings of WORDS 03, TUCS General Publication No. 27, pp , Preprints: 1. D. Henshall, N. Rampersad, J. Shallit, Shuffling and unshuffling. Submitted. 2. A. Lacroix, N. Rampersad, Automaticity of primitive words and irreducible polynomials. Submitted. 5

6 Invited conference talks: Decidable Properties of Automatic Sequences, Summer Meeting of the Canadian Mathematical Society 2011, Edmonton, Alberta, 4 June Abstract Numeration Systems. LATA 2011, Tarragona, Spain, June Repetitions in Words: Classical and Recent Results. 13èmes Journées Montoises D Informatique Théorique, Amiens, France, 9 September Recent Progress on Dejean s Conjecture. CORS/INFORMS 2009, Toronto, Ontario, June Combinatorics on Words: Applications to Number Theory and Ramsey Theory. Conference of the Prairie Network for Research in Mathematical Sciences, Brandon University, May Contributed conference talks: The State Complexity of Testing Divisibility, Descriptional Complexity of Formal Systems 2010, Saskatoon, Saskatchewan, 8 August Non-Constructive Methods in Combinatorics on Words, Numeration 2010, Lorentz Center, Leiden, The Netherlands, 9 June Infinite Words Containing Squares at Every Position. 12èmes Journées Montoises D Informatique Théorique, Université de Mons-Hainaut, Mons, Belgium, August Automata, Palindromes, Powers, and Patterns. Applications 2008, Tarragona, Spain, March Language, Automata Theory and Avoiding Approximate Squares. Developments in Language Theory 2007, Turku, Finland, July Squares and Overlaps in the Thue-Morse Sequence and some Variants, Word Avoidability, Complexity, and Morphisms 2004, Turku, Finland, July Words Avoiding 7/3-powers and the Thue-Morse Morphism, Developments in Language Theory 2004, Auckland, New Zealand, December Avoiding Large Squares in Infinite Binary Words, WORDS 2003, Turku, Finland, September

7 Seminar and colloquium talks: The State Complexity of Testing Divisibility in Linear Numeration Systems, LIAFA, University of Paris 7, 4 June Non-repetitive Sequence Games, Computer Science and Communications Research Unit, University of Luxembourg, 10 May Synchronizing Automata, Louvain School of Engineering, Catholic University of Louvain, 30 April Abelian Repetitions and Related Topics, CIRM, University of Aix-Marseille II, 6 April Repetitions in Words, Mathematics Institute of Luminy, University of Aix-Marseille II, 9 March Combinatorics on Words and Noncommutative Algebra, Department of Mathematics, University of Liège, January Combinatorics on Words and Noncommutative Algebra, Department of Mathematics and Statistics, University of Winnipeg, November Proving Dejean s Conjecture, Department of Computer Science, University of Manitoba, October Černý s Conjecture. Department of Mathematics and Statistics, University of Winnipeg, October Avoiding Approximate Squares. Algorithms Seminar, School of Computer Science, University of Waterloo, June Paperfolding and Words Avoiding Repetitions. Algorithms Seminar, School of Computer Science, University of Waterloo, November Journal/conference referee: Acta Informatica Crux Mathematicorum Discrete Applied Mathematics Discrete Mathematics Discrete Mathematics and Theoretical Computer Science Electronic Journal of Combinatorics 7

8 Information and Computation Information Processing Letters International Journal of Foundations of Computer Science INTEGERS: Electronic Journal of Combinatorial Number Theory Journal of Combinatorial Theory, Series A Journal of Integer Sequences Mathematical Reviews Theoretical Computer Science International Colloquium on Automata, Languages and Programming (ICALP) 2011 International Conference on Language and Automata Theory and Applications (LATA) 2009, 2011 International Conference on Developments in Language Theory (DLT) 2006, 2009, 2010, 2012 International Conference on Implementation and Application of Automata (CIAA) 2009, 2010, 2012 International Symposium on Theoretical Aspects of Computer Science (STACS) 2011, International Symposium on Mathematical Foundations of Computer Science (MFCS) Professional activities: Co-organizer of an invited minisymposium on Combinatorics on Words for the 2nd Canadian Discrete and Algorithmic Mathematics Conference Grants: NSERC Discovery Grant ($85,000)

9 Awards: Outstanding Achievement in Graduate Studies (Ph.D.), University of Waterloo, Best Student Paper, Developments in Language Theory 2004 (shared prize). Distinguished Teaching Assistantship Award, School of Computer Science, University of Waterloo, Winter University plaque for the highest standing in computer science, University of Ottawa, June

TAMU Department of Mathematics, College Station, TX Office: Blocker 245E

CURRICULUM VITAE: Oksana Shatalov (Avshalumova) Contact Information TAMU Department of Mathematics, College Station, TX 77843-3368 Office: Blocker 245E E-mail: shatalov@math.tamu.edu, shatalov68@tamu.edu