Promotion, Tangled Labelings, and Sorting Generating Functions
Pith reviewed 2026-05-23 08:30 UTC · model grok-4.3
The pith
Tangled labelings of posets partition by the element labeled n-1 for certain families, and cumulative promotion counts on antichain sums are log-concave and refine the weak order.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The stronger conjecture partitioning tangled labelings by the element labeled n-1 holds for inflated rooted forest posets and shoelace posets. The cumulative generating function for the ordinal sum of antichains has log-concave coefficients and refines the weak order on the symmetric group.
What carries the argument
The promotion operator on arbitrary labelings of a poset, with tangled labelings defined as those requiring exactly n-1 iterations to reach a natural labeling.
If this is right
- The total number of tangled labelings is at most (n-1)! for the proved families.
- The distribution of promotion lengths is recorded by the new generating functions.
- Log-concavity of the cumulative coefficients gives inequalities among the numbers of labelings requiring each number of promotions.
- The construction yields a combinatorial refinement of the weak order on permutations when the poset is an ordinal sum of antichains.
Where Pith is reading between the lines
- If the partition conjecture holds for all posets it would immediately imply the original bound of (n-1)! tangled labelings.
- The same recursive techniques might be tested on other recursively defined poset families such as series-parallel posets.
- The log-concavity result suggests checking whether the generating functions remain log-concave under other poset operations such as direct sums.
- The refinement of the weak order could be compared with other known refinements such as those coming from reduced decompositions or tableau insertion.
Load-bearing premise
The recursive covering relations that define inflated rooted forests and shoelace posets are enough to control the promotion steps and verify the partitioned counts and generating-function identities.
What would settle it
An explicit inflated rooted forest or shoelace poset on n elements together with a count showing more than (n-2)! tangled labelings that place n-1 on one fixed element.
read the original abstract
We study Defant and Kravitz's generalization of Sch\"utzenberger's promotion operator to arbitrary labelings of finite posets in two directions. Defant and Kravitz showed that applying the promotion operator $n-1$ times to a labeling of a poset on $n$ elements always gives a natural labeling of the poset and called a labeling tangled if it requires the full $n-1$ promotions to reach a natural labeling. They also conjectured that there are at most $(n-1)!$ tangled labelings for any poset on $n$ elements. In the first direction, we propose a further strengthening of their conjecture by partitioning tangled labelings according to the element labeled $n-1$ and prove that this stronger conjecture holds for inflated rooted forest posets and a new class of posets called shoelace posets. In the second direction, we introduce sorting generating functions and cumulative generating functions for the number of labelings that require $k$ applications of the promotion operator to give a natural labeling. We prove that the coefficients of the cumulative generating function of the ordinal sum of antichains are log-concave and obtain a refinement of the weak order on the symmetric group.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the promotion operator on labelings of finite posets. It proposes and proves a strengthened conjecture partitioning tangled labelings by the element labeled n-1, establishing the bound for inflated rooted forest posets and a new class of shoelace posets. It also defines sorting and cumulative generating functions for the number of labelings requiring k promotions to reach a natural labeling, proving that the cumulative generating function for the ordinal sum of antichains has log-concave coefficients and refines the weak order on the symmetric group.
Significance. If the results hold, the explicit proofs for the partitioned conjecture on two poset families and the log-concavity plus weak-order refinement provide concrete combinatorial advances on promotion dynamics and new generating-function tools that connect to sorting phenomena, strengthening the link between poset labelings and permutation statistics without relying on fitted parameters or post-hoc selection.
minor comments (2)
- §2: the definition of shoelace posets could include an explicit small example diagram to clarify the covering relations used in the recursive proof.
- The notation for the cumulative generating function F_P(q) is introduced without an immediate comparison table to the ordinary generating function, which would aid readability.
Simulated Author's Rebuttal
We thank the referee for their positive summary, assessment of significance, and recommendation to accept the manuscript. There are no major comments to address.
Circularity Check
No circularity; results are direct combinatorial proofs from definitions
full rationale
The paper derives its results via explicit combinatorial arguments and generating-function identities applied to the definitions of the promotion operator, tangled labelings, inflated rooted forests, shoelace posets, and the ordinal sum of antichains. The strengthened conjecture is proved only for the two named poset families by direct verification of their recursive/covering relations; the log-concavity and weak-order refinement are proved only for the ordinal sum of antichains. No quantities are defined in terms of other quantities by construction, no parameters are fitted and then relabeled as predictions, and no load-bearing steps rely on self-citations or imported uniqueness theorems. The general conjecture is left open, confirming the derivations remain self-contained within the structures where the dynamics are explicitly controlled.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The promotion operator on labelings of a finite poset always reaches a natural labeling after at most n-1 steps (Defant-Kravitz).
- standard math Standard properties of ordinal sums, antichains, and the weak order on the symmetric group.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.