Abstract
In this paper, we study permutations on n elements that are even on every subset of size t. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral. In this context, we define and study monoids that generalize both monoids of order-preserving mappings and monoids of orientation-preserving mappings.
Funding Information
  • FCT - Fundação para a Ciência e a Tecnologia (UIDB/00297/2020)
  • FCT - Fundação para a Ciência e a Tecnologia (UIDP/00297/2020)

This publication has 12 references indexed in Scilit: