arxiv: 2605.12342 · v1 · submitted 2026-05-12 · 🧮 math.RA

Recognition: 1 theorem link

· Lean Theorem

Groups of permutations that are even on maximal proper subsets, and related monoids

V\'itor H. Fernandes

Pith reviewed 2026-05-13 02:59 UTC · model grok-4.3

classification 🧮 math.RA

keywords permutation groupstransformation monoidseven permutationsmaximal proper subsetsgenerating setscardinalityranksymmetric group

0 comments

The pith

Permutations even on every maximal proper subset form a subgroup with explicit description, order and minimal generators.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines Γ_n as the subgroup of the symmetric group on n points consisting of those permutations whose restriction to any subset of size n-1 is an even permutation. It defines Σ_n as the monoid of all transformations on n points whose injective restrictions to every size-(n-1) subset are even, and Δ_n as the submonoid generated by the rank-at-least-(n-1) members of Σ_n. The authors supply concrete descriptions of each object, compute their cardinalities and ranks, and exhibit minimal generating sets. A reader would care because the evenness filter on large subsets selects a structured subcollection whose size and generators turn out to be simple and explicit rather than opaque.

Core claim

The paper claims that Γ_n, Δ_n and Σ_n admit explicit descriptions in terms of the even-restriction condition, that their cardinalities and ranks are determined by closed expressions in n, and that each possesses a minimal generating set consisting of explicitly identifiable elements.

What carries the argument

The even-restriction condition on every maximal proper subset, which selects Γ_n inside the symmetric group, Σ_n inside the full transformation monoid, and Δ_n as the high-rank submonoid of Σ_n.

If this is right

The order of Γ_n is given by an explicit formula in n.
Minimal generating sets for Γ_n, Δ_n and Σ_n consist of identifiable families of permutations or transformations.
Δ_n sits properly between the high-rank generators and the full Σ_n while inheriting the even-restriction property.
The ranks supply the smallest number of elements needed to generate each object.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same evenness filter might produce equally tractable objects when applied to subsets of size n-2 or to other classical groups.
Direct computation for small n supplies an independent check of the claimed cardinalities and generators.
These monoids could serve as test cases for algorithms that enumerate or factor elements under parity constraints.

Load-bearing premise

That imposing evenness on the restrictions to every maximal proper subset yields algebraic objects possessing clean explicit descriptions together with finite minimal generating sets for every n.

What would settle it

For n=5, enumerate every permutation whose restriction to each 4-element subset is even, compute the resulting set's order and a minimal generating set by direct search, and compare the numbers and generators against the paper's claimed formulas.

read the original abstract

Let $n$ be a positive integer and let $[n]=\{1,2,\ldots,n\}$. Let $\Gamma_n$ denote the group of permutations on $[n]$ whose restrictions to maximal proper subsets of $[n]$ are even, let $\Sigma_n$ denote the monoid of transformations on $[n]$ whose injective restrictions to maximal proper subsets of $[n]$ are even and let $\Delta_n$ denote the submonoid of $\Sigma_n$ generated by transformations of rank at least $n-1$. In this paper, we present descriptions of $\Gamma_n$, $\Delta_n$ and $\Sigma_n$, determine their cardinalities and ranks, and provide minimal generating sets for each of them.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper pins down explicit descriptions, cardinalities, ranks, and minimal generators for three substructures of S_n and T_n defined by even restrictions to every (n-1)-subset.

read the letter

The core contribution is the concrete handling of Γ_n, Σ_n, and Δ_n. The authors define Γ_n as the subgroup of even permutations on each maximal proper subset, then build the monoids Σ_n and its submonoid Δ_n from injective transformations satisfying the same local condition. They split into cases on n, list the elements or generators directly, and compute the sizes and ranks as closed expressions. The proofs are direct: verify closure under composition, check the parity condition holds for the claimed sets, and enumerate the minimal generators by testing small sets of elements. That approach works cleanly here and produces usable results like explicit generating sets that anyone can check by hand or code for small n. The evenness condition itself looks new in this exact form relative to earlier work on transformation monoids, and the case-by-case descriptions avoid hidden parameters or circular appeals. The main limitation is scope. Everything stays inside the narrow lane of describing submonoids of T_n by local properties, with no links to other areas or broader questions about parity in semigroups. The case splits on n are necessary but make the write-up a bit mechanical. No load-bearing gaps appear in the verification steps, though the abstract-only view leaves the full enumeration details unexamined. This is for readers already working on combinatorial semigroup theory and submonoids of the transformation monoid. If that is your area, the explicit generators and counts are worth adding to the literature. Otherwise the payoff is small. I would send it for peer review; the claims are specific, the methods are standard and checkable, and the results are reproducible in principle.

Referee Report

0 major / 3 minor

Summary. The paper defines Γ_n as the subgroup of S_n consisting of permutations whose restrictions to every maximal proper subset (i.e., every (n-1)-set) are even permutations. It defines Σ_n as the monoid of all transformations on [n] whose injective restrictions to maximal proper subsets are even, and Δ_n as the submonoid of Σ_n generated by the elements of rank at least n-1. The authors supply explicit descriptions of Γ_n, Δ_n and Σ_n (typically by cases on n), closed-form expressions for their cardinalities and ranks, and minimal generating sets, with proofs proceeding by direct verification of the defining properties, closure, and enumeration.

Significance. The explicit case-by-case descriptions, cardinality formulas, and minimal generating sets provide concrete, computable information about these parity-constrained permutation groups and transformation monoids. Such results are useful for enumeration, computational algebra, and further classification work in combinatorial group and monoid theory.

minor comments (3)

[Theorems 3.1–3.3 and 4.1–4.2] The case distinctions (small n versus n ≥ some threshold) in the descriptions of Γ_n, Δ_n and Σ_n should be cross-checked for consistency at the boundary values of n to ensure no overlap or omission.
[Section 5] Notation for the explicit generators (e.g., specific transpositions or 3-cycles) could be standardized across sections to improve readability when listing minimal generating sets.
[Introduction and Section 4] A brief remark on how the rank formulas for Δ_n and Σ_n relate to the known ranks of the full transformation monoid would help contextualize the results.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, recognition of its significance for enumeration and computational algebra in combinatorial group and monoid theory, and recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces Γ_n, Σ_n and Δ_n directly via the evenness condition on restrictions to maximal proper subsets, then derives explicit descriptions, cardinalities, ranks and minimal generating sets by case-by-case verification and direct enumeration. No equation or claim reduces a derived quantity back to a fitted parameter, self-citation chain, or definitional tautology; the central results are obtained from the definitions by standard algebraic arguments without load-bearing self-references or ansatz smuggling.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper works inside the standard axioms of group and semigroup theory. No free parameters, invented entities, or non-standard axioms are visible in the abstract.

axioms (1)

standard math The alternating group A_{n-1} is the unique subgroup of index 2 in S_{n-1} consisting of even permutations.
Implicit in the definition of 'even' restriction; standard background fact used throughout.

pith-pipeline@v0.9.0 · 5412 in / 1326 out tokens · 99719 ms · 2026-05-13T02:59:42.275089+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean; IndisputableMonolith/Foundation/AlexanderDuality.lean reality_from_one_distinction; Jcost uniqueness (washburn_uniqueness_aczel) unclear
Let Γ_n denote the group of permutations on [n] whose restrictions to maximal proper subsets of [n] are even... descriptions of Γ_n, Δ_n and Σ_n, determine their cardinalities and ranks, and provide minimal generating sets

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

[1]

Arthur and N

R.E. Arthur and N. Ruˇ skuc, Presentations for two extensions of the monoid of order-preserving mappings on a finite chain, Southeast Asian Bull. Math. 24, 1–7 (2000)

work page 2000
[2]

A˘ ızenˇ stat, The defining relations of the endomorphism semigroup of a finite linearly ordered set, Sibirsk

A.Ya. A˘ ızenˇ stat, The defining relations of the endomorphism semigroup of a finite linearly ordered set, Sibirsk. Mat. Zh. 3, 161–169 (1962). (in Russian)

work page 1962
[3]

A˘ ızenˇ stat, Homomorphisms of semigroups of endomorphisms of ordered sets, Uch

A.Ya. A˘ ızenˇ stat, Homomorphisms of semigroups of endomorphisms of ordered sets, Uch. Zap., Leningr. Gos. Pedagog. Inst. 238, 38–48 (1962). (in Russian)

work page 1962
[4]

Catarino and P.M

P.M. Catarino and P.M. Higgins, The monoid of orientation-preserving mappings on a chain, Semigroup Forum 58, 190–206 (1999)

work page 1999
[5]

Delgado and J

M. Delgado and J. Morais, SgpViz, A package for semigroup visualization, Version 0.999.6 (GAP package)

work page
[6]

Fernandes, Semigroups of order-preserving mappings on a finite chain: a new class of divisors, Semi- group Forum 54, 230–236 (1997)

V.H. Fernandes, Semigroups of order-preserving mappings on a finite chain: a new class of divisors, Semi- group Forum 54, 230–236 (1997)

work page 1997
[7]

Fernandes, Presentations for some monoids of partial transformations on a finite chain: a survey, Semigroups, Algorithms, Automata and Languages, eds

V.H. Fernandes, Presentations for some monoids of partial transformations on a finite chain: a survey, Semigroups, Algorithms, Automata and Languages, eds. G.M.S. Gomes & J.-E. Pin & P.V. Silva, World Scientific, (2002), 363–378. 17

work page 2002
[8]

Fernandes, Oriented transformations on a finite chain: another description, Commun

V.H. Fernandes, Oriented transformations on a finite chain: another description, Commun. Korean Math. Soc. 38, No. 3, 725–731 (2023)

work page 2023
[9]

Fernandes, G.M.S

V.H. Fernandes, G.M.S. Gomes and M.M. Jesus, Congruences on monoids of transformations preserving the orientation on a finite chain, J. Algebra 321, 743–757 (2009)

work page 2009
[10]

Fernandes, M.M

V.H. Fernandes, M.M. Jesus, V. Maltcev and J.D. Mitchell, Endomorphisms of the semigroup of order- preserving mappings, Semigroup Forum 81, 277–285 (2010)

work page 2010
[11]

Fernandes and A

V.H. Fernandes and A. Vernitski, Groups of permutations that are even on subsets of a fixed size, and related monoids, Internat. J. Algebra Comput. 36, No. 01, 1–15 (2026)

work page 2026
[12]

Fernandes and M.V

V.H. Fernandes and M.V. Volkov, On divisors of semigroups of order-preserving mappings of a finite chain, Semigroup Forum 81, 551–554 (2010)

work page 2010
[13]

Gomes and J.M

G.M.S. Gomes and J.M. Howie, On the ranks of certain semigroups of order-preserving transformations, Semigroup Forum 45, 272–282 (1992)

work page 1992
[14]

Higgins, Divisors of semigroups of order-preserving mappings on a finite chain, Internat

P.M. Higgins, Divisors of semigroups of order-preserving mappings on a finite chain, Internat. J. Algebra Comput. 5, 725–742 (1995)

work page 1995
[15]

Higgins and A

P.M. Higgins and A. Vernitski, Orientation-preserving and orientation-reversing mappings: a new descrip- tion, Semigroup Forum 104, No. 2, 509–514 (2022)

work page 2022
[16]

Howie, Product of idempotents in certain semigroups of transformations, Proc

J.M. Howie, Product of idempotents in certain semigroups of transformations, Proc. Edinburgh Math. Soc. 17, 223–236 (1971)

work page 1971
[17]

Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford (1995)

J.M. Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford (1995)

work page 1995
[18]

Howie and R.B

J.M. Howie and R.B. McFadden, Idempotent rank in finite full transformation semigroups, Proc. R. Soc. Edinb., Sect. A 114, No. 3–4, 161–167 (1990)

work page 1990
[19]

Laradji and A

A. Laradji and A. Umar, Combinatorial results for semigroups of order-preserving full transformations, Semigroup Forum 72, 51–62 (2006)

work page 2006
[20]

McAlister, Semigroups generated by a group and an idempotent, Comm

D. McAlister, Semigroups generated by a group and an idempotent, Comm. Algebra 26, 515–547 (1998)

work page 1998
[21]

Tanimoto, Combinatorics of the group of parity alternating permutations, Adv

S. Tanimoto, Combinatorics of the group of parity alternating permutations, Adv. Appl. Math. 44, No. 3, 225–230 (2010)

work page 2010
[22]

Tanimoto, Parity alternating permutations and signed Eulerian numbers, Ann

S. Tanimoto, Parity alternating permutations and signed Eulerian numbers, Ann. Comb. 14, No. 3, 355–366 (2010)

work page 2010
[23]

The GAP Group. (2025). GAP - Groups, Algorithms, and Programming, Version 4.15.1. https://www.gap- system.org

work page 2025
[24]

Vernitskii and M.V

A. Vernitskii and M.V. Volkov, A proof and a generalisation of Higgins’ division theorem for semigroups of order preserving mappings, Izv. Vyssh. Uchebn. Zaved. Mat 1, 38–44 (1995). 18

work page 1995