## RJMI

Python tutorial for maze generation

I continue this year to get involved in the Rendez-vous des jeunes mathématiciennes et informaticiennes. We now include more computer-science-oriented tutorials, and ot only mathematic ones. I was looking for a topic easy to understand and to explain to parents and relatives. Maze generation was looking fun and reasonable for 3 hour work.
We generate mazes with two different algorithms. For small mazes, the construction can be seen step by step with animation. We finish with mazes following the form of a picture.
You can find the notebook that we use during the tutorial (in french).
Once again, I was surprised by the quality of the questions and solutions found by the girls. Let's share also share a fun fact. I got one expected question that I wasn't prepared to. How can we draw the figure in pink? Well, usually, I'd prefer to use other colors, but we can look at the possibilities. Is purple enough? (You can see the result)

## Ethics of algorithms

12 hours tutorial

I design three practicals from scratch for people coming from social sciences, with Python programming. Still on-going work.

• Compas example: How to compute the fairness metrics in this simple but interesting example.
• Introduction on Privacy: what is re-identification and can we do it at scale ? Which solutions ?
• Bias in NLP: why and how we keep historical gender bias.
The goal is to open some of the black boxes and give them some tools that they could reuse in other projects.

## Rendez-vous des jeunes mathématiciennes

A Python tutorial (French)

### Une implémentation python : construire un bon graphe planaire

On peut construire un graphe planaire d'étirement maximal 6 et de degré maximal 12

On donnes un nuage de point, et on souhaite construire un réseau à partir de celui-ci. Comment procéder ? On souhaite que le graphe soit planaire, c'est-à-dire sans croisement. Si on fait l'analogie avec des villes et des routes, cela veut dire qu'on ne veut pas de tunnel ou de pont. Mais ce n'est pas tout : il faut que tout le monde soit bien desservi, c'est-à-dire qu'on puisse aller d'un point à un autre sans parcourir une distance beaucoup plus grande que celle qu'on aurait parcouru à vol d'oiseau : on parle pour cela de l'étirement d'un graphe. Ce TP propose une construction qui garantit qu'on parcourra au plus une distance deux fois plus grande.

Une deuxième partie du TP, un peu plus ambitieuse, propose de construire un second graphe avec un contrainte supplémentaire : pas plus de 12 routes par ville, c'est-à-dire un graphe de degré maximal 12.

Le sujet du TP est ici.

Dans un premier temps, on va regarder ce code. Le code à compléter est et un corrigé est disponible

## Girls Can Code

I was one of the assistant. In one week, girls discover programming and code a little game in Python. We also have RasberryPi programming and web.

Here for the official website.

## Introduction to Combinatorics

Club de mathématiques discrètes de Lyon

I designed and taught two lectures for beginners on Combinatorics. With a total of 8 hours, this course introduces typical reasoning and the needed background to model these problems in a mathematical way.

Here the lectures notes

## Rendez-vous des jeunes mathématiciennes

Promote girls in maths studies !

I co-organized the first Rendez-vous des jeunes mathématiciennes in Lyon, with the financial support of Animath. 30 girls in high school met during three intensive days to discover Olympic mathematics. I was responsible of both mathematical (tutorial, lectures) and non mathematical parts (housing, food, games, workshop on stereotypes). I wrote an article on this experience.