Recognition: unknown
Dynamics, Random Products, and Ultrametric Geometry in Kiselman's Semigroup
Pith reviewed 2026-05-07 13:43 UTC · model grok-4.3
The pith
Every sequence of partial products in Kiselman's semigroup eventually stabilizes to a constant value.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that the level function L on Kiselman's semigroup K_n admits a simple description in terms of right multiplication by generators. This description is used to prove that every sequence of partial products is eventually constant. In the iid random setting with each generator chosen with positive probability, the hitting time to the eventual constant value is distributed as the sum of n independent geometric random variables. The same function induces a natural ultrametric on K_n, and some basic results are obtained for the metric balls and spheres.
What carries the argument
The level function L, which tracks progress through right multiplication by generators and carries both the stabilization argument and the ultrametric construction.
If this is right
- Every sequence of partial products in K_n becomes constant after finitely many steps.
- In the iid random case the hitting time to stabilization is exactly the sum of n independent geometric random variables.
- A natural ultrametric exists on K_n derived directly from the level function L.
- Basic structural facts hold for the balls and spheres in this ultrametric.
Where Pith is reading between the lines
- The decomposition of the hitting time into a sum of geometrics indicates that stabilization proceeds through n independent phases.
- The ultrametric may be used to quantify how quickly random products converge to their absorbing value.
- Similar level functions could be sought in other finitely generated semigroups to obtain comparable stabilization and metric results.
Load-bearing premise
The level function L admits a simple description in terms of right multiplication by the generators of the semigroup.
What would settle it
An explicit infinite sequence of generators such that the successive partial products in K_n never become constant would disprove the stabilization claim.
read the original abstract
We study certain dynamical and metric aspects of Kiselman's semigroup $K_n$. The level function $\mathcal{L}$ is introduced and shown to admit a simple description in terms of right multiplication by generators. We show that every sequence of partial products in $K_n$ is eventually constant. Using $\mathcal{L}$, we further study sequences of random partial products in $K_n$ and show that, in the independent and identically distributed setting where every generator is chosen with positive probability, the hitting time of the eventual constant value is distributed as a sum of $n$ independent geometric random variables. Finally, we define a natural ultrametric on $K_n$ arising from the level function and obtain some basic results on the associated metric balls and spheres.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a level function L on Kiselman's semigroup K_n with an explicit rule under right multiplication by generators (L(xs_i) equals L(x) or L(x)-1 depending on whether the generator has appeared). This is used to prove that every sequence of partial products eventually stabilizes. In the i.i.d. random-product model with positive probability on each generator, the hitting time to stabilization is distributed as the sum of n independent geometric random variables. An ultrametric is then defined directly from L, and basic properties of the resulting balls and spheres are derived.
Significance. If the claims hold, the explicit combinatorial rule for L supplies a direct, non-circular proof of stabilization and yields an exact probabilistic description of the random hitting time. The ultrametric construction furnishes a concrete metric geometry on K_n. These are substantive contributions to the dynamics of semigroups and random products, with the parameter-free nature of the level drops and the decomposition into geometrics constituting clear strengths.
minor comments (3)
- The abstract refers to 'some basic results' on balls and spheres; the introduction should list these results explicitly so readers can assess their scope without reading the full proofs.
- A brief computational example for n=2 (listing the elements, the values of L, a stabilizing sequence, and the ultrametric distances) would make the level-function rule and its consequences immediately verifiable.
- The statement that the ultrametric 'arises naturally' from L should be accompanied by a short verification that the triangle inequality holds, even if the argument is routine.
Simulated Author's Rebuttal
We thank the referee for their positive summary of the manuscript and for recommending minor revision. No specific major comments appear in the report, so there are no individual points requiring rebuttal. We will incorporate any minor suggestions in the revised version.
Circularity Check
No significant circularity
full rationale
The derivation begins by introducing the level function L on K_n and proving (via direct verification on generators) that it satisfies a simple rule under right multiplication: L(xs_i) equals L(x) or L(x)-1 according to whether the generator has appeared. This rule is then applied to show L is nonnegative and strictly decreases until zero, which forces every finite sequence of partial products to stabilize after finitely many steps. The iid random-product hitting time is obtained by decomposing the stabilization process into n successive level drops, each geometric with success probability equal to the remaining generators' total mass; this uses only the already-established stabilization and standard iid assumptions. The ultrametric is defined directly from the values of L. No step reduces to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation; the chain is self-contained against the semigroup axioms and the explicit rule for L.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Basic axioms and relations defining Kiselman's semigroup K_n as previously introduced in the literature.
- standard math Standard axioms of probability: independent identically distributed choices, definition of geometric random variables, and properties of their sums.
invented entities (2)
-
Level function L
no independent evidence
-
Ultrametric on K_n
no independent evidence
Reference graph
Works this paper leans on
-
[1]
Semigroup Forum (2025)
Andrenšek, L.: A complete classification of endomorphis ms of Kiselman’s semi- group. Semigroup Forum (2025)
2025
-
[2]
Zero Cancellation and Equation Structure in Kiselman's Semigroup
Andrenšek, L.: Zero cancellation and equation structur e in Kiselman’s semigroup. arXiv:2604.22007v1 (2026)
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[3]
Collina, E., D’Andrea, A.: A graph-dynamical interpret ation of Kiselman’s semigroups. J. Algebraic Combin. 41(4), 1115–1132 (2015)
2015
-
[4]
D’Andrea, A., Stella, S.: The cardinality of Kiselman’s semigroups grows double- exponentially. Bull. Belg. Math. Soc. Simon Stevin 30(5), 570–576 (2023)
2023
-
[5]
Kiselman, C.: A semigroup of operators in convexity theo ry. Trans. Amer. Math. Soc. 354(5), 2035–2053 (2002)
2035
-
[6]
Yokohama Math
Kudryavtseva, G., Mazorchuk, V.: On Kiselman’s semigro up. Yokohama Math. J. 55(1), 21–46 (2009) 22
2009
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.