Romain Tabard (L3, UJM), Permutations et croisements de fonctions polynomiales, 2018 [In french], (Permutations and crossings of Polynomial functions)
(pdf).
Kenny Phommady (M2, ENS Lyon), Polynomialité de S(g)^g pour g une algèbre de Lie semi-simple et introduction au problème de la polynomialité de S(p)^{p'} pour p une sous-algèbre parabolique, 2017 [In french], (Polynomiality of algebras of invariants in Lie algebras)
(pdf).
Salma Grati et Nolwen Jouanin (L3, UJM), Topologie de Zariski et irréductibilité, 2017 [In french], (Zariski's topology on R and R^2)
(pdf).
Tristan Canale et Geoffrey Just (L3, UJM), Logique formelle, 2016 [In french], (Propositional calculus, Completeness theorem)
(pdf).
Ibtissem Zaafrani (L3, UJM), Cryptographie, 2014 [In french], (El-Gamal, public key cryptosystem using group theory)
(pdf).
Bruno Laurent (M1, ENS Lyon), (B,N)-paires et groupes finis de type Lie, 2013 [In french], ((B,N)-pairs and finite groups of Lie type) (pdf).
Title:
Etude de quelques sous-variétés des algèbres de Lie symétriques semi-simples
(Study of some varieties arising in semisimple symmetric Lie algebras).
Thematically, it is the union of my two first papers concerning nilpotent commuting variety and sheets.
Popularization: of the PHD subject through a poster and a slide show. [In french]
Training courses:
Training courses in L3:
Théorie de Galois en dimension infinie (ps).
[In french], (Galois Theory in infinite dimension), Advisor:
A. Chazad Movahhedi.
Training courses in M1: Problème des sous-groupes de congruences (pdf).
[In french], (Congruence subgroup problem), Advisor: Bertrand Remy.
Training courses in M2: Variétés commutantes des algèbres de Lie Réductives (pdf).
[In french], (Commuting varieties in reductive Lie algebras) with its errata, Advisor: Philippe Caldero.
Once upon a time, a colleague of mine, Olivier,
found a funny paper during his morning round on arXiv.
It is a short article written by some Doron Zeilberger. Doron offers
some money to the "OEIS" in honor of anybody able to prove his little conjecture. Without thinking twice, we start to work on it.
The conjecture seems true and another colleague
(Fréderic) joins us.
Profound reflexion... Middle of the day: we find a link with the so-called
Collatz conjecture... Effervescence...
Finally! After hours of hard work, it's the victory: we are able to show that the given problem is equivalent to Collatz's one.
We decide to post the result on the arXiv on the evening so that readers will get it the day after. We have been quick, we must be the first to have the result,
time for glory. 22H11: The file is now written, we upload it and send it to this good ol' Doron, a tad triumphalists. Answer to arxiv:1401.1532 and link with the 3x + 1 conjecture 22H53: Answer from the rascal: "Dear Michael, Frederic and Olivier, Good try, but it is unlikely that the proof is correct. See the note at the end of
this link."...
So... the guy has deliberately hidden Collatz in his damn conjecture.
He got so much answers during the day that he didn't even took a look to ours.
And, worst of all, we have clearly been overtaken by several people for the right answer...
Well... Let's erase everything from arXiv. It could have been a productive day. Bloody Doron.
MCF Campaign Game:
In a simplified way, this is how a MCF (teaching and researching french permanent positions) campaign looks like:
1. Each available position has its own selection process. The applicant has to send one application file per position.
2. For each position, a committee meets and settle the list of applicant for an audition.
In maths, it is customary to publish this list, in a transparent way, on the website Opération postes.
3. The applicant audition on the location of each position (where retained).
Concretely, this may result in a month-long trip across France.
4. A ranking is settled by the committee of each position. This ranking is published on Opération postes.
5. The applicant ranks the positions where he still is in the running. Then the machine assign him a position (or not) following the rules indicated
there.
4bis. Since the auditions are spread onto one mounth and there is almost the same period of time before getting the feedback of the machine,
the suspense might seem unbearable between steps 4. and 5. It is then tempting to guess your own fate concerning a possible assignment before the machine feedback.
2011: After 41 application files and 7 auditions, this
diagram
displays my rankings as well as the rankings concerning applicants whose choices may influence my fate.
The game consists in finding out whether or not I have reasonable chances to get a position at this stage.
After a careful study of the previous diagram, you may want to know the final choices of the other applicants. The answer is
there.
