Publiée 20 juillet 2026
Ingénieur de recherche pour la combinatoire des séquences d'inversions
Inria
Nancy, Grand-Est 54000, France
CDI
Contexte et atouts du poste
Pattern-avoiding permutations have been a major topic of interest in enumerative combinatorics, starting with the foundational work of Knuth in the seventies, and gaining increasing popularity over the past 25 years. The research on pattern-avoiding permutations has then evolved in several directions, an important one being the study of analoguous notions of pattern avoidance in other combinatorial objects. In particular, the study of pattern-avoidance in inversion sequences, which started in 2015 approximately, has displayed many nice combinatorial properties. In the past few years, this topic has been actively studied by the part of the Mocqua team working in the field of combinatorics. The main goal of this job is to continue developing our understanding of pattern-avoiding inversion sequences, both bringing to a conclusion the steps taken in the past years, and opening avenues for the future.
Mission confiée
It is expected that the candidate contributes to some or all of the following projects:
Principales activités
Contribution to research articles; Conception and (prototypical) implementation of algorithms computing generating functions.
Compétences
If possible PhD thesis, or at least master degree, in computer science or mathematics.
Skills in discrete mathematics are necessary.
Avantages
Rémunération
A partir de 2765 € brut/mois selon diplômes et expériences
Pattern-avoiding permutations have been a major topic of interest in enumerative combinatorics, starting with the foundational work of Knuth in the seventies, and gaining increasing popularity over the past 25 years. The research on pattern-avoiding permutations has then evolved in several directions, an important one being the study of analoguous notions of pattern avoidance in other combinatorial objects. In particular, the study of pattern-avoidance in inversion sequences, which started in 2015 approximately, has displayed many nice combinatorial properties. In the past few years, this topic has been actively studied by the part of the Mocqua team working in the field of combinatorics. The main goal of this job is to continue developing our understanding of pattern-avoiding inversion sequences, both bringing to a conclusion the steps taken in the past years, and opening avenues for the future.
Mission confiée
It is expected that the candidate contributes to some or all of the following projects:
- development of effective methods for the computation of generating series enumerating inversion sequences (and other types of sequences) avoiding a set of patterns that includes 021 (it is known that these generating series are algebraic);
- description of limit shapes of pattern-avoiding inversion sequences;
- other aspects of the study of inversion sequences in combinatorics.
Principales activités
Contribution to research articles; Conception and (prototypical) implementation of algorithms computing generating functions.
Compétences
If possible PhD thesis, or at least master degree, in computer science or mathematics.
Skills in discrete mathematics are necessary.
Avantages
- Restauration subventionnée
- Transports publics remboursés partiellement
- Congés: 7 semaines de congés annuels + 10 jours de RTT (base temps plein) + possibilité d'autorisations d'absence exceptionnelle (ex : enfants malades, déménagement)
- Possibilité de télétravail (après 6 mois d'ancienneté) et aménagement du temps de travail
- Équipements professionnels à disposition (visioconférence, prêts de matériels informatiques, etc.)
- Prestations sociales, culturelles et sportives (Association de gestion des œuvres sociales d'Inria)
- Accès à la formation professionnelle
- Sécurité sociale
Rémunération
A partir de 2765 € brut/mois selon diplômes et expériences
