Groups of permutations that are even on subsets of a fixed size, and related monoids
- 16 October 2025
- journal article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 36 (01) , 1-15
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.Keywords
All Related Versions
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:
- Correction to: Orientation preserving and orientation reversing mappings: a new descriptionSemigroup Forum, 2024
- Orientation-preserving and orientation-reversing mappings: a new descriptionSemigroup Forum, 2022
- Parity Alternating Permutations and Signed Eulerian NumbersAnnals of Combinatorics, 2010
- Combinatorics of the group of parity alternating permutationsAdvances in Applied Mathematics, 2010
- On Rank Properties of Endomorphisms of Finite Circular OrdersCommunications in Algebra, 2006
- PRESENTATIONS FOR SOME MONOIDS OF PARTIAL TRANSFORMATIONS ON A FINITE CHAINCommunications in Algebra, 2005
- The monoid of all injective orientation preserving partial transformations on a finite chainCommunications in Algebra, 2000
- Combinatorial results for semigroups of order-preserving mappingsMathematical Proceedings of the Cambridge Philosophical Society, 1993
- On the ranks of certain semigroups of order-preserving transformationsSemigroup Forum, 1992
- Products of idempotents in certain semigroups of transformationsProceedings of the Edinburgh Mathematical Society, 1971