{"id":56,"date":"2015-06-16T13:44:07","date_gmt":"2015-06-16T11:44:07","guid":{"rendered":"http:\/\/members.loria.fr\/thierrygartiser\/?page_id=56"},"modified":"2026-07-09T15:38:09","modified_gmt":"2026-07-09T13:38:09","slug":"home","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/BTestart\/","title":{"rendered":"Home"},"content":{"rendered":"<p>Member of the <a href=\"https:\/\/mocqua.loria.fr\/en\/welcome\/\">MOCQUA<\/a> team in <a href=\"https:\/\/www.loria.fr\/en\/\">Loria<\/a>. I was a PhD student from October 2022 to June 2026, under the supervision of <a href=\"https:\/\/members.loria.fr\/MBouvel\/\">Mathilde Bouvel<\/a> and <a href=\"https:\/\/members.loria.fr\/EJeandel\/\">Emmanuel Jeandel<\/a>. After defending my thesis, I am now staying as a postdoc in Loria while looking for my next job (offers are welcome!). My main research interests are enumerative and bijective combinatorics. More specifically, I have been working on pattern avoidance in inversion sequences.<\/p>\n<p><strong>Preprints:<\/strong><br \/>\n<em>On minimal pattern-containing inversion sequences<\/em>. 2026. <a href=\"https:\/\/arxiv.org\/abs\/2602.12130\" target=\"_blank\" rel=\"noopener\">arXiv:2602.12130<\/a>.<\/p>\n<p><strong>Publications:<\/strong><br \/>\n<em>Completing the enumeration of inversion sequences avoiding one or two patterns of length 3<\/em>. The Electronic Journal of Combinatorics, volume 32, issue 4. 2025. <a href=\"https:\/\/doi.org\/10.37236\/13750\" target=\"_blank\" rel=\"noopener\">https:\/\/doi.org\/10.37236\/13750<\/a>.<\/p>\n<p><em>Generating trees growing on the left for pattern-avoiding inversion sequences<\/em>. Discrete Mathematics and Theoretical Computer Science, vol 27:1 (special volume for Permutation Patterns 2024). 2025. <a href=\"https:\/\/doi.org\/10.46298\/dmtcs.14716\" target=\"_blank\" rel=\"noopener\">https:\/\/doi.org\/10.46298\/dmtcs.14716<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Member of the <a href=\"https:\/\/mocqua.loria.fr\/en\/welcome\/\">MOCQUA<\/a> team in <a href=\"https:\/\/www.loria.fr\/en\/\">Loria<\/a>. I was a PhD student from October 2022 to June 2026, under the supervision of <a href=\"https:\/\/members.loria.fr\/MBouvel\/\">Mathilde Bouvel<\/a> and <a href=\"https:\/\/members.loria.fr\/EJeandel\/\">Emmanuel Jeandel<\/a>. After defending my thesis, I am now staying as a postdoc in Loria while looking for my next job (offers are welcome!). My main research interests are enumerative and bijective combinatorics. More specifically, I have been working on pattern avoidance in inversion sequences.<\/p>\n<p>Preprints:<br \/>\n<em>On minimal pattern-containing inversion sequences<\/em>. 2026. <a href=\"https:\/\/arxiv.org\/abs\/2602.12130\" target=\"_blank\" rel=\"noopener\">arXiv:2602.12130<\/a>.<\/p>\n<p>Publications:<br \/>\n<em>Completing the enumeration of inversion sequences avoiding one or two patterns of length 3<\/em>.<\/p>\n","protected":false},"author":5,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-56","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/pages\/56","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/comments?post=56"}],"version-history":[{"count":25,"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/pages\/56\/revisions"}],"predecessor-version":[{"id":335,"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/pages\/56\/revisions\/335"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/BTestart\/wp-json\/wp\/v2\/media?parent=56"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}