After a two month suspension of all the ECOS-Sud projects, due to the restructuration of the Argentine Ministry of Science into a State Department depending on the Ministry of Education, the new Department and ECOS France have agreed to continue the projects starting from November 2018.
Julien Clément and Loïck Lhote from Université de Caen will visit the Departamento de Computación (FCEyN – Universidad de Buenos Aires) and they will teach the course “Análisis de algoritmos” from October 26 to November 23. This course is devoted to undergraduated students or those who are interested in the principles of the probabilistic study of algorithms (For more information, click here).
Pablo ROTONDO successfully defended his PhD thesis on September 27th, 2018, at Université Paris-Diderot.
Title: Probabilistic studies in Number Theory and Word Combinatorics: instances of dynamical analysis
- Brigitte VALLÉE, Université de Caen, France
- Valérie BERTHÉ, IRIF, Université Paris-Diderot, France
- Alfredo VIOLA, Universidad de la República, Uruguay
- Bruno SALVY (rapporteur)
- Pierre ARNOUX (rapporteur)
- Cyril NICAUD (examiner)
- Franco ROBLEDO (examiner)
- Thomas STOLL (examiner)
Dynamical Analysis incorporates tools from dynamical systems, namely the Transfer Operator, into the framework of Analytic Combinatorics, permitting the analysis of numerous algorithms and objects naturally associated with an underlying dynamical system. This dissertation presents, in the integrated framework of Dynamical Analysis, the probabilistic analysis of seemingly distinct problems in a unified way: the probabilistic study of the recurrence function of Sturmian words, and the probabilistic study of the Continued Logarithm algorithm.
Sturmian words are a fundamental family of words in Word Combinatorics. They are in a precise sense the simplest infinite words that are not eventually periodic. Sturmian words have been well studied over the years, notably by Morse and Hedlund (1940) who demonstrated that they present a notable number theoretical characterization as discrete codings of lines with irrational slope, relating them naturally to dynamical systems, in particular the Euclidean dynamical system. These words have never been studied from a probabilistic perspective. Here, we quantify the recurrence properties of a “random” Sturmian word, which are dictated by the so-called “recurrence function”; we perform a complete asymptotic probabilistic study of this function, quantifying its mean and describing its distribution under two different probabilistic models, which present different virtues: one is a naturaly choice from an algorithmic point of view (but is innovative from the point of view of dynamical analysis), while the other allows a natural quantification of the worst-case growth of the recurrence function. We discuss the relation between these two distinct models and their respective techniques, explaining also how the two seemingly different techniques employed could be linked through the use of the Mellin transform. In this dissertation we also discuss our ongoing work regarding two special families of Sturmian words: those associated with a quadratic irrational slope, and those with a rational slope (not properly Sturmian). Our work seems to show the possibility of a unified study.
The Continued Logarithm Algorithm, introduced by Gosper in Hakmem (1978) as a mutation of classical continued fractions, computes the greatest common divisor of two natural numbers by performing division-like steps involving only binary shifts and substractions. Its worst-case performance was studied recently by Shallit (2016), who showed a precise upper-bound for the number of steps and gave a family of inputs attaining this bound. In this dissertation we employ dynamical analysis to study the average running time of the algorithm, giving precise mathematical constants for the asymptotics, as well as other parameters of interest. The underlying dynamical system is akin to the Euclidean one, and was first studied by Chan (around 2005) from an ergodic, but the presence of powers of 2 in the quotients ingrains into the central parameters a dyadic flavour that cannot be grasped solely by studying this system. We thus introduce a dyadic component and deal with a two-component system. With this new mixed system at hand, we then provide a complete average-case analysis of the algorithm by Dynamical Analysis.
Delia Kesner visits Universidad de Buenos Aires from the 1st to the 11th of September 2018.
Raúl Fervari (Universidad Nacional de Córdoba & CONICET) visits Stéphane Demri at LSV, ENS Paris-Cachan from August 31 to September 12, 2018. From this visit, a joint publication entitled “On the complexity of modal separation logics” has been issued.
Robin Pelle, from LRI, Université Paris-Sud, has visited Beta Ziliani at FaMaF, Universidad Nacional de Córdoba, from August 15th to September 16th.
A new course for graduate and undergraduate level will take place at Computer Science Department, School of Exact and Natural Sciences, University of Buenos Aires:
Probabilistic Análisis of Algorithms
26 October to 23 November 2018
- Julien Clement (Laboratoire GREYC – Université de Caen)
- Loïck Lothe (Université de Caen)
- Eda Cesaratto (Universidad Nacional General Sarmiento)
On July 19, 2018 Elisa Orduna defends her “Tesis de Licenciatura en Ciencias de la Computación” (eq. Masters in the EU system) at the Computer Science Department, School of Exact and Natural Sciences, University of Buenos Aires
Title: Preservation of normality in transducers.
Directors: Verónica Becher (Argentina) and Olivier Carton (France).
Evaluation committee: Sergio Abriola and Santiago Figueira
Eda Cesarato will be visiting GREYC Lab (Université de Caen), and LABRI Lab (Univestié de Bordeaux) from June 7 to June 20, 2018, funded by ANR Dyna3S and GREYC Lab.
Logic and Foundations of Programming Languages Day
May 21, 2018
Departamento de Computación, FCEN, Universidad de Buenos Aires
Pabellón 1, Ciudad Universitaria, Buenos Aires
More info at http://infinis.org/?page_id=1033