arxiv: 2604.26661 · v1 · submitted 2026-04-29 · 🧮 math.GR

Recognition: unknown

Fixed points of orientation-preserving full transformation

Wen Ting Zhang, Yang An, Yi He

Pith reviewed 2026-05-07 11:33 UTC · model grok-4.3

classification 🧮 math.GR

keywords orientation-preserving transformationsfixed pointstransformation monoidsbinomial coefficientsprobability distributionexpectationcombinatorial enumerationfull transformations

0 comments

The pith

The number of orientation-preserving full transformations on n elements with exactly m fixed points equals binom(2n, n-m) for 2 ≤ m ≤ n.

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

The paper counts the fixed points of elements in the monoid OP_n of all orientation-preserving full transformations on the ordered set X_n = {1, ..., n}. It proves that the number F(n, m) of such transformations with precisely m fixed points is the binomial coefficient binom(2n, n-m) in the stated range. This explicit count is then used to derive the expectation of the size of the fixed-point set and the full probability distribution of that size when an element is chosen uniformly at random from OP_n. A reader would care because these statistics give concrete information about the structure and typical behavior of maps inside this combinatorial monoid. The result directly answers Umar's question on the values of F(n, m).

Core claim

For the monoid OP_n of orientation-preserving full transformations on X_n = {1, ..., n} with the natural order, the number F(n, m) of elements α with |F(α)| = m satisfies F(n, m) = binom(2n, n-m) whenever 2 ≤ m ≤ n. The same enumeration supplies closed-form expressions for the expectation and the probability distribution of the random variable |F(α)| over uniform choice of α in OP_n.

What carries the argument

The enumeration function F(n, m) that partitions OP_n according to the exact number of fixed points of each transformation, shown to coincide with the binomial coefficient binom(2n, n-m).

If this is right

The expected number of fixed points for a uniform random element of OP_n is obtained by summing m times F(n, m) over m and dividing by the order of OP_n.
The probability that a random element has exactly m fixed points is F(n, m) divided by the total size of OP_n, for each m from 2 to n.
The binomial expression supplies the dominant terms in any complete enumeration or generating function for the monoid OP_n.
Asymptotic concentration or limit laws for the number of fixed points follow from the explicit distribution when n grows.

Where Pith is reading between the lines

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

The same binomial may count fixed-point statistics in other families of order-related maps once the preservation condition is relaxed or strengthened.
The formula for m ≥ 2 leaves open whether a uniform expression continues to hold for m = 0 or m = 1, which could be checked by direct computation for small n.
Probabilistic statements about random elements of OP_n become elementary once the distribution is known, allowing questions about typical cycle structure or image size to be posed in the same setting.

Load-bearing premise

The definition of an orientation-preserving full transformation on the ordered set X_n with its natural order must be fixed in a way that makes the fixed-point count reduce exactly to the binomial formula.

What would settle it

Explicit enumeration of all elements of OP_3 and direct count of how many have exactly two fixed points; the formula predicts binom(6, 1) = 6 such elements.

Figures

Figures reproduced from arXiv: 2604.26661 by Wen Ting Zhang, Yang An, Yi He.

**Figure 1.** Figure 1: is the digraph of α = view at source ↗

**Figure 2.** Figure 2: Digraphs of α ∈ OPn with 2 fixed points For example, the left side in view at source ↗

read the original abstract

Let $\mathcal{OP}_n$ be the monoid of all orientation-preserving full transformations on $X_n=\{1,\dots, n\}$ with the natural order. For $\alpha \in \mathcal{OP}_n$, let $F(\alpha)=\{y\in X_n: y\alpha=y\}$ and $F(n,m)=|\{\alpha:|F(\alpha)|=m\}|$. Umar posed the question about the number $F(n,m)$ of elements of $\mathcal{OP}_n$ with $m$ fixed points. In this paper, we show that the number $F(n,m)$ of $\mathcal{OP}_n$ is $\binom{2n}{n-m}$ for $2\leqslant m\leqslant n$ and get the expectation and probability distribution of the cardinality of fixed-point set $F(\alpha)$ for $\alpha\in\mathcal{OP}_n$.

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

The paper settles Umar's counting question with an explicit binomial for fixed points in OP_n and adds the expectation plus distribution.

read the letter

The core contribution is a closed-form answer to the open question: F(n,m) equals binom(2n, n-m) for 2 ≤ m ≤ n, together with the expectation and probability distribution of the fixed-point count. That is useful concrete data for anyone enumerating elements inside this particular transformation monoid. The authors also keep the argument combinatorial rather than asymptotic, which fits the style of the literature on finite semigroups. If the bijection or recurrence they use really matches the orientation-preserving condition, the formula is clean and immediately applicable. The extra moments and distribution are a nice bonus that makes the result more self-contained. The main soft spot is the lower bound m ≥ 2. The paper must show explicitly why m = 0 and m = 1 fall outside the binomial pattern and that this follows directly from the definition of orientation-preserving maps on the chain; otherwise the claim looks incomplete. A second minor point is that the precise combinatorial correspondence between the maps and the (n-m)-subsets of a 2n-set needs to be written out plainly so readers can check it against the standard definition of OP_n. This work is aimed at specialists in transformation monoids and combinatorial semigroup theory who need exact counts rather than general bounds. A reader already working on fixed-point statistics or enumeration in these monoids will find the formulas immediately usable. It deserves a serious referee because it resolves an explicit open question with a verifiable closed form; the details are checkable by people who know the monoid.

Referee Report

0 major / 3 minor

Summary. The manuscript defines the monoid OP_n of orientation-preserving full transformations on the ordered set X_n = {1, ..., n}. It introduces F(n,m) as the number of elements with exactly m fixed points and establishes that F(n,m) equals binom(2n, n-m) for 2 ≤ m ≤ n. The paper additionally derives the expectation and the full probability distribution of the cardinality of the fixed-point set for a random element of OP_n.

Significance. If the central enumeration holds, the result supplies an explicit binomial formula for fixed-point counts in this transformation monoid, directly addressing Umar's question and indicating a combinatorial bijection with (n-m)-subsets of a 2n-set. The accompanying expectation and distribution results add probabilistic content of independent interest in combinatorial semigroup theory. The manuscript delivers a clean, closed-form statement together with the derived statistics.

minor comments (3)

The abstract asserts the binomial formula and the distribution results; a one-sentence indication of the proof technique (bijection, recurrence, or generating function) would improve readability without lengthening the abstract.
The precise definition of an orientation-preserving full transformation (including how the natural order on X_n is used) should be recalled or restated in the introduction or §2 to ensure the combinatorial argument is self-contained for readers unfamiliar with the literature on OP_n.
Verify that the cases m = 0 and m = 1 are either shown to be zero or explicitly computed, since the main formula begins at m = 2; this would complete the probability distribution statement.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful review and for recommending minor revision. The referee's summary accurately captures the definition of OP_n, the enumeration F(n,m), and the derived expectation and distribution results.

Circularity Check

0 steps flagged

No significant circularity in the fixed-point count for OP_n

full rationale

The paper defines the monoid OP_n of orientation-preserving full transformations on the ordered set X_n and the counting function F(n,m). It then asserts that F(n,m) equals the binomial coefficient binom(2n, n-m) for 2 ≤ m ≤ n, presented as a direct combinatorial enumeration solving Umar's open question. No equations reduce the claimed count to a fitted parameter, self-referential definition, or load-bearing self-citation; the result follows from the order-preserving property under the natural order without circular reduction to its own inputs. The derivation is self-contained as a standard combinatorial argument.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on the combinatorial definition of the monoid OP_n and standard binomial identities; no free parameters or new entities are introduced in the abstract.

axioms (1)

standard math Binomial coefficients satisfy the usual identities and count lattice paths or subsets.
The claimed formula is expressed directly in binomial coefficients.

pith-pipeline@v0.9.0 · 5446 in / 1132 out tokens · 39337 ms · 2026-05-07T11:33:09.516003+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

12 extracted references

[1]

P. M. Higgins, Combinatorial results for semigroups of order-preserving mappings,Math. Proc. Camb. Philos. Soc.113(1993) 281–296

1993
[2]

Howie, Products of idempotents in certain semigroups of order- preserving transformations,Proc

J. Howie, Products of idempotents in certain semigroups of order- preserving transformations,Proc. Edinburgh Math. Soc.17(1971) 223– 236

1971
[3]

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

1992
[4]

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

1999
[5]

Laradji and A

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

2006
[6]

G. U. Garba, Nilpotents in semigroups of partial one-to-one order- preserving mappings,Semigroup Forum48(1994) 37–49

1994
[7]

Laradji and A

A. Laradji and A. Umar, Combinatorial results for semigroups of order- preserving or order-reversing subpermutations,J. Difference Equ. Appl. 21(2015) 269–283

2015
[8]

Umar, Some combinatorial problems in the theory of partial transfor- mation semigroups,Algebra Discrete Math.17(2014) 110–134

A. Umar, Some combinatorial problems in the theory of partial transfor- mation semigroups,Algebra Discrete Math.17(2014) 110–134

2014
[9]

Laradji, Fixed points of order-preserving transformations,J

A. Laradji, Fixed points of order-preserving transformations,J. Algebra Appl.21(2022) 2250082

2022
[10]

Howie, Fundamentals of Semigroup Theory, Oxford University Press, Oxford, 1995

J. Howie, Fundamentals of Semigroup Theory, Oxford University Press, Oxford, 1995. 12

1995
[11]

Riordan, Combinatorial Identities, Wiley, New York, 1968

J. Riordan, Combinatorial Identities, Wiley, New York, 1968

1968
[12]

P. M. Higgins, Techniques of Semigroup Theory, Oxford University Press, Oxford, 1992. 13

1992