May 15 – 20 , 2022, Event 22209

Squares in Permutations


Guillaume Fertin (Nantes Université, FR)

For support, please contact

Heike Clemens


This project is concerned with the notion of square permutations, whose algorithmic aspects have recently been studied by one of the applicants [2, 3]. Our goal here is to study in more depth the following questions: what makes a permutation square?

  • how many square roots can a permutation contain?
  • what is the length of a maximum-size square root in a permutation?

These questions will be tackled both under combinatorial and algorithmic viewpoints.

Motivation text license
  Creative Commons BY 4.0
  Mathilde Bouvel, Guillaume Fertin, and Stéphane Vialette

Online Publications

We offer several possibilities to publish the results of your event. Please contact publishing(at) if you are interested.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf in the library.