A universal characterization of the shifted plactic monoid

Oliver Pechenik; Santiago Estupi\~n\'an-Salamanca

REVIEW 3 major objections 5 minor 17 references

A universal characterization of the shifted plactic monoid

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The shifted plactic monoid is the initial object of the category SPlac(A): four axioms force Serrano's eight shifted Knuth relations, so the monoid is characterized intrinsically, without mixed insertion.

desk verdict A genuinely new universal characterization of the shifted plactic monoid, proved by a sound though not fully self-contained case analysis. read the letter →

arxiv 2411.17619 v1 pith:5SUD2WCT submitted 2024-11-26 math.CO math.GR

Santiago Estupiñán-Salamanca , Oliver Pechenik This is my paper · ORCID

classification math.COmath.GR MSC 05E0505E10

keywords shiftedplacticmonoiduniversalpropertyinitialobjectKnuthrelationsSchurP-functionprojectiverepresentationtheoryisotropicGrassmannian

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper gives a universal, self-contained characterization of Serrano's shifted plactic monoid, the monoid that encodes shifted tableaux and governs projective representations of symmetric groups and the cohomology of isotropic Grassmannians. It proves that the shifted plactic monoid is the initial object of a category SPlac(A) whose objects are monoids sitting between the free monoid on a totally ordered alphabet A and the ordinary plactic monoid, subject to four algebraic axioms. This means the eight shifted Knuth relations of Serrano are forced by the axioms; they are consequences rather than input. The proof avoids shifted jeu de taquin and Haiman's mixed insertion, and only needs the two smallest shifted free Schur functions. The paper also re-proves, in categorical language, the analogous Lascoux–Schützenberger characterization of the ordinary plactic monoid.

What carries the argument

The machinery is the category SPlac(A). An object is a monoid M with φ:F(A)→M and ψ:M→P(A) such that (SPlac.1) ψ∘φ equals the plactic projection κ; (SPlac.2) the images in M of the shifted free Schur functions $\hat P_{(2,1)}$ and $\hat P_{(1)}$ commute; (SPlac.3) φ respects ordered alphabet morphisms between finite subalphabets; and (SPlac.4) whenever φ identifies two words, the plactic images of their restrictions to any interval are identified in P(A). The proof's engine is the commuting product $\hat P_{(1)} \hat P_{(2,1)}$, whose degree-4 monomials are listed in Table 2; for each shifted Knuth relation, the word on one side must equal one of these monomials in M, and repeated restriction to intervals, together with the plactic facts that distinct letters never commute and $\kappa(xxy)=\kappa(xyx)$ only for $x\ge y$, eliminates every candidate except the desired partner.

What would settle it

Find a totally ordered alphabet with letters x<y such that the plactic monoid identifies xxy with xyx (or identifies xy with yx). The paper's case analysis in the proof of (SP.1) explicitly rules out v=adca by asserting κ(aac)≠κ(aca) for a<c, so any violation of that plactic inequality would make a forbidden monomial admissible and the initial-object proof would no longer force the shifted Knuth relations.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.3: for any totally ordered alphabet A, the shifted plactic monoid S(A), together with its projection σ from the free monoid F(A) and its projection π to the plactic monoid P(A), is the initial object of the category SPlac(A). Concretely, every monoid M equipped with a surjection φ:F(A)→M and a map ψ:M→P(A) satisfying (SPlac.1)–(SPlac.4) receives a unique monoid homomorphism from S(A) making the diagram commute. Since S(A) maps to every such M, the shifted plactic monoid is the most general monoid satisfying the axioms, and the initial-object proof shows that the eight shifted Knuth relations (SP.1)–(SP.8) hold in every object of SPlac(A), so they are consequences of the axioms alone.

Load-bearing premise

The proof takes as given two standard facts about the plactic monoid on arbitrary totally ordered alphabets: distinct letters never commute in it, and the relation κ(xxy)=κ(xyx) holds only when x≥y; these facts are imported from the literature rather than proved here.

Editorial extensions

If this is right

The shifted plactic monoid can now be defined by four axioms instead of by a list of eight degree-4 relations; the relations are theorems about the axioms.
Any future monoid constructed with a map to the plactic monoid and satisfying the same four properties is automatically a quotient of the shifted plactic monoid, which gives a quick identification test.
The universal characterization avoids mixed insertion and shifted jeu de taquin, so the shifted plactic structure can be developed from free Schur functions alone.
The proof of Theorem 1.2 fills an acknowledged gap by giving a complete proof of the Lascoux–Schützenberger universal property for the ordinary plactic monoid.
Because only the smallest shifted free Schur functions are used, the entire shifted plactic theory is pinned down by very low-degree data.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The categorical template should transfer to other members of the plactic family: replace the target monoid P(A) and choose the appropriate free Schur functions, and the same initial-object argument may axiomatize hypoplactic, sylvester, or Baxter monoids.
The appearance of κ in (SPlac.4), where one might expect φ, suggests a general design principle: the universal monoid is determined by how its quotient relations interact with interval restrictions after mapping to a known target; testing that principle on another target quotient would be a direct experiment.
Since the proof shows the eight relations are forced by degree-4 monomials, one can test whether the axioms restricted to alphabets with four letters already imply the full shifted plactic monoid; if so, the universal property is a finite local check.
The paper's avoidance of mixed insertion leaves open whether the axioms also characterize the monoid of mixed-insertion tableaux directly; verifying that the quotient by mixed-insertion equivalence lies in SPlac(A) would connect the universal property back to representation theory.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The punchline: this is a solid, worthwhile paper. It provides the first universal characterization of the shifted plactic monoid, Theorem 1.3, and proves it by deriving the shifted Knuth relations directly from four axioms, without invoking Haiman's mixed insertion. That is genuinely new. The paper also restates the Lascoux–Schützenberger characterization of the ordinary plactic monoid as an initial-object theorem and supplies a complete proof, explicitly repairing gaps in the original. That alone is a useful service to the community.

The good: shifted free Schur functions defined via hook subwords are natural and new, and Section 5's comparison of alternative axiom sets is a helpful sanity check. The proof strategy is honest—show that every object of SPlac satisfies Serrano's relations, then initiality follows—and the categorical framing is appropriate. I found no hidden circularity: the shifted relations are derived, not assumed.

The soft spots are real but minor. Section 4's elimination arguments rely on several facts about the ordinary plactic monoid that are stated but not proved or cited: no two distinct letters commute, κ(xxy)=κ(xyx) only when x≥y, and assorted non-equivalences like κ(acdb)≠κ(cdab). These are standard, so the proof is not in danger, but the paper is not self-contained at that point. A reader who wants the full story needs to go to Lothaire or elsewhere. Similarly, the verification that (S,σ,π) is an object of SPlac is dismissed as 'straightforward'; given that axiom (SPlac.4) involves a nontrivial interval-restriction property, a few lines of justification would be welcome. There are also typos (e.g., 'φ(aada)' where the word is aadc), and the case analyses become progressively more compressed, as the authors concede.

Who is this for: algebraic combinatorialians working on plactic-type monoids, universal properties, or tableau-free treatments of Schur functions. It will be a standard reference for the shifted plactic monoid. It deserves peer review and, with minor revisions, publication. My own verdict is accept; the minor self-containedness issues are worth fixing but do not threaten the main result.

Referee Report

3 major / 5 minor

Summary. The paper gives a universal characterization of Serrano's shifted plactic monoid, parallel to the Lascoux-Schützenberger characterization of the ordinary plactic monoid. It defines a category SPlac(A) whose objects are monoids M equipped with a surjection φ:F(A)→M and a map ψ:M→P(A) satisfying four axioms: compatibility with the abelianization/plactic projection, commutativity of the images of two small shifted free Schur functions, compatibility with ordered morphisms, and compatibility with interval restrictions (with a plactic projection in the shifted version). The main theorem (Theorem 1.3) states that the shifted plactic monoid (S(A),σ,π) is the initial object of SPlac(A). The proof, carried out in Section 4, shows that every object of SPlac(A) satisfies the eight shifted Knuth relations by a case analysis that matches monomials in the product of shifted free Schur functions. The paper also reproves the analogous theorem for the ordinary plactic monoid (Theorem 1.2), repairs an incompleteness in the original Lascoux-Schützenberger argument, and discusses alternative axiomatizations in Section 5.

Significance. If the main theorem is correct, it provides a genuinely new intrinsic characterization of the shifted plactic monoid that avoids mixed insertion and shifted jeu de taquin, and it places Serrano's monoid in the same categorical framework as the classical plactic monoid. This is a natural and useful contribution to algebraic combinatorics, especially given the role of shifted plactic theory in projective representation theory and isotropic Schubert calculus. The categorical formulation is clean, the statement is parameter-free, and the proof is a transparent (if lengthy) case analysis rather than a black-box appeal to tableau algorithms. The paper also deserves credit for giving a complete proof of Theorem 1.2 and for explicitly flagging and repairing an incompleteness in [LS81]. The main weaknesses are presentational and concern missing support for several standard but load-bearing facts about the ordinary plactic monoid.

major comments (3)

[Section 4, cases (SP.1)-(SP.8)] The elimination of candidate words repeatedly invokes unproved facts about the ordinary plactic monoid P(A): distinct letters never commute in P(A); κ(xxy)=κ(xyx) holds only for x≥y; and specific non-equivalences such as κ(acdb)≠κ(cdab), κ(bdb)≠κ(bbd), and κ(badb)≠κ(bdba). These facts are load-bearing: without them the contradictions that force each matching do not close. They are standard, so this is not an error in the mathematics, but the manuscript should state them in a preliminary lemma or cite them explicitly rather than using them as if they were evident.
[End of Section 4, paragraph beginning 'It is straightforward to see that (S,σ,π)∈SPlac'] The proof that the candidate object lies in SPlac is omitted. In particular, (SPlac.2) requires the two shifted free Schur functions to commute in ZS(A), and (SPlac.4) requires interval deletion followed by κ to be well defined on σ-classes; neither property follows immediately from the definition of S as the quotient by (SP.1)-(SP.8). Please supply a direct verification or a precise reference to Serrano's results establishing these properties.
[Section 4, passim] The argument assumes that from an equality of two sums of images of monomials in ZM one may match individual monomials with equal φ-image. This is true because the coefficients are +1 and φ-values with multiplicities must agree coefficientwise, but the principle is not stated. Since every case in the proof depends on this matching step, it should be made explicit early in Section 4 or in a short lemma.

minor comments (5)

[Section 4, final case of (SP.1)] The condition 'a=b=c≤d' should read 'a=b=c<d', since relation (SP.1) is stated for c<d; the analogous inequality checks in the remaining relations should be reviewed for the same issue.
[Section 5, Proposition 5.2] The statement says 'replacing φ( ˆS ) by φ( ˆS ) in (SPlac.2)', but in the shifted setting this should refer to φ( ˆP ); as written it appears to copy the unshifted statement.
[Section 4, (SP.3) and elsewhere] The word 'identity' is used where 'identify' is clearly intended (for example, in the first sentence of the (SP.3) case); please correct these typos.
[Section 2.3, Example 2.5] The hook word definition and Example 2.5 are easy to misread; a sentence explaining why, for three distinct letters, the hook words are exactly bdc and cdb would help the reader verify the table entries and the later case analysis.
[Table 2 and surrounding text] The table caption refers to 'mixed reading words', but this term is not defined in the paper; please add a definition or a reference for the reading word of a shifted tableau.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the shifted Knuth relations are derived from the SPlac axioms using independent facts about the ordinary plactic monoid.

full rationale

The paper does not define the shifted plactic monoid in terms of the axioms and then call that a prediction. Theorem 1.3 is proved by fixing an arbitrary object (M, phi, psi) of SPlac(A) and showing, from (SPlac.2), that the images of the monomials in the products of shifted free Schur functions must be matched in certain ways; each candidate match is eliminated using (SPlac.3)/(SPlac.4) together with standard facts about the ordinary plactic monoid P(A), such as distinct letters do not commute and kappa(xxy)=kappa(xyx) only for x>=y. These facts concern P(A), not the target monoid S(A), and they are not among the axioms defining SPlac(A); they are external benchmarks about a previously defined object. The claimed initial-object status of (S(A), sigma, pi) is not assumed in the axioms, and the eight shifted Knuth relations are consequences rather than inputs of the proof. Although the verification that (S, sigma, pi) is itself an object of SPlac is asserted as straightforward and the proof relies on some unproved plactic facts, those are self-containedness or correctness gaps rather than circularity. There are no load-bearing self-citations, no fitted parameters renamed as predictions, and no known result repackaged as new: Theorem 1.2 is explicitly credited to Lascoux and Schutzenberger and is given a proof, while Theorem 1.3 is a new characterization whose derivation does not start from the shifted Knuth relations.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters; this is a pure mathematics paper. The central theorem relies on known structural facts about the plactic monoid, on the standard basis property of monoid algebras, on the graded inverse limit for infinite alphabets, and on the choice of shifted free Schur functions defined in Section 2.3.

assumptions (4)

domain assumption Distinct letters do not commute in the plactic monoid P(A), and κ(xxy)≠κ(xyx) for x<y.
Invoked in Section 4 to eliminate candidate monomials; standard consequences of Knuth relations, not proved here.
standard math In the monoid algebra ZM, elements of M form a Z-basis, so equality of two formal sums implies equal multisets of M-elements.
Used in the case analysis, for example the bijection of matched monomials in Section 4, SP.4.
domain assumption The graded inverse limit ZM (Remark 1.1) supports the infinite formal sums defining free Schur functions and the homomorphism φ.
Needed when A is infinite; the paper abandons the ordinary monoid algebra and assumes this inverse-limit algebra behaves as an algebra.
domain assumption The shifted free Schur functions \hat P_ν defined by hook subwords (Definition 2.4) are the correct shifted analogues and abelianize to P-Schur functions.
The commutation axiom (SPlac.2) is stated for these functions; if this definition were wrong, the category would characterize a different monoid.

how reviews work

0 comments

Cite this review

Pith. "Pith review of A universal characterization of the shifted plactic monoid." pith.science (2026). https://pith.science/paper/5SUD2WCT

@misc{pith2026241117619,
  author       = {Pith},
  title        = {Pith review of: A universal characterization of the shifted plactic monoid},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5SUD2WCT}},
  note         = {Machine review of arXiv:2411.17619}
}

abstract

The plactic monoid $\mathbf{P}$ of Lascoux and Sch\"{u}tzenberger (1981) plays an important role in proofs of the Littlewood-Richardson rule for computing multiplicities in the linear representation theory of the symmetric group $\mathfrak{S}_n$ and the cohomology of Grassmannians. Commonly, $\mathbf{P}$ is defined as a quotient of a free monoid by relations derived from a careful analysis of Schensted's insertion algorithm and the jeu de taquin algorithm on semistandard Young tableaux. However, Lascoux and Sch\"{u}tzenberger also gave an intrinsic characterization of $\mathbf{P}$ via a universal property. Serrano's (2010) shifted plactic monoid $\mathbf{S}$ is an analogue of $\mathbf{P}$ that governs instead the projective representation theory of $\mathfrak{S}_n$ and the cohomology of isotropic Grassmannians. We provide a universal property for $\mathbf{S}$, analogous to the Lascoux-Sch\"{u}tzenberger characterization of $\mathbf{P}$.

Figures

Figures reproduced from arXiv: 2411.17619 by the authors.

**Figure 1.** An example of the mixed insertion algorithm. The shown shifted tableaux illustrate the insertion of the element 2 to the shifted semistandard Young tableau at left to obtain the rightmost tableau above. Definition 2.8 ([Ser10]). The shifted plactic monoid S(A) is the quotient of F(A) by the shifted plactic relations: abdc ∼ adbc for all a ≤ b ≤ c < d;(SP.1) acdb ∼ acbd for all a ≤ b < c ≤ d;(SP.2) dacb ∼ adcb for al… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

[1]

193 (1998), no

Sergey Fomin and Curtis Greene, Noncommutative S chur functions and their applications , Discrete Math. 193 (1998), no. 1-3, 179--200, Selected papers in honor of Adriano Garsia (Taormina, 1994). 1661368

work page 1998
[2]

Women Math

Maria Gillespie, Variations on a theme of S chubert calculus , Recent trends in algebraic combinatorics, Assoc. Women Math. Ser., vol. 16, Springer, Cham, 2019, pp. 115--158. 3969573

work page 2019
[3]

14 (1974), 254--265

Curtis Greene, An extension of S chensted's theorem , Advances in Math. 14 (1974), 254--265

work page 1974
[4]

Haiman, On mixed insertion, symmetry, and shifted Y oung tableaux , J

Mark D. Haiman, On mixed insertion, symmetry, and shifted Y oung tableaux , J. Combin. Theory Ser. A 50 (1989), no. 2, 196--225

work page 1989
[5]

P. N. Hoffman and J. F. Humphreys, Projective representations of the symmetric groups: Q -functions and shifted tableaux , Oxford Mathematical Monographs, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1992

work page 1992
[6]

Knuth, Permutations, matrices, and generalized Y oung tableaux , Pacific J

Donald E. Knuth, Permutations, matrices, and generalized Y oung tableaux , Pacific J. Math. 34 (1970), 709--727

work page 1970
[7]

Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol

M. Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol. 90, Cambridge University Press, Cambridge, 2002, A collective work by Jean Berstel, Dominique Perrin, Patrice Seebold, Julien Cassaigne, Aldo De Luca, Steffano Varricchio, Alain Lascoux, Bernard Leclerc, Jean-Yves Thibon, Veronique Bruyere, Christiane Fro...

work page 2002
[8]

u tzenberger, Le mono\

Alain Lascoux and Marcel-Paul Sch\" u tzenberger, Le mono\" de plaxique , Noncommutative structures in algebra and geometric combinatorics ( N aples, 1978), Quad. ``Ricerca Sci.'', vol. 109, CNR, Rome, 1981, pp. 129--156

work page 1978

Show all 17 references

[9]

217 (2000), no

Jean-Christophe Novelli, On the hypoplactic monoid, Discrete Math. 217 (2000), no. 1-3, 315--336, Formal power series and algebraic combinatorics (Vienna, 1997)

2000
[10]

Dan Romik and Piotr \' S niady, Jeu de taquin dynamics on infinite Y oung tableaux and second class particles , Ann. Probab. 43 (2015), no. 2, 682--737. 3306003

2015
[11]

1, 171--182

, Limit shapes of bumping routes in the R obinson- S chensted correspondence , Random Structures Algorithms 48 (2016), no. 1, 171--182. 3432576

2016
[12]

Sagan, Shifted tableaux, S chur Q -functions, and a conjecture of R

Bruce E. Sagan, Shifted tableaux, S chur Q -functions, and a conjecture of R . S tanley , J. Combin. Theory Ser. A 45 (1987), no. 1, 62--103

1987
[13]

Schensted, Longest increasing and decreasing subsequences, Canadian J

C. Schensted, Longest increasing and decreasing subsequences, Canadian J. Math. 13 (1961), 179--191. 121305

1961
[14]

Sch\" u tzenberger, La correspondance de R obinson , Combinatoire et repr\' e sentation du groupe sym\' e trique ( A ctes T able R onde CNRS , U niv

M.-P. Sch\" u tzenberger, La correspondance de R obinson , Combinatoire et repr\' e sentation du groupe sym\' e trique ( A ctes T able R onde CNRS , U niv. L ouis- P asteur S trasbourg, S trasbourg, 1976), Lecture Notes in Math., Vol. 579, Springer, Berlin-New York, 1977, pp. 59--113

1976
[15]

u tzenberger, Pour le mono\

Marcel-Paul Sch\" u tzenberger, Pour le mono\" de plaxique , Math. Inform. Sci. Humaines (1997), no. 140, 5--10

1997
[16]

Luis Serrano, The shifted plactic monoid, Math. Z. 266 (2010), no. 2, 363--392

2010
[17]

Dale Raymond Worley, A theory of shifted Y oung tableaux , ProQuest LLC, Ann Arbor, MI, 1984, Thesis (Ph.D.)--Massachusetts Institute of Technology

1984

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [1]

193 (1998), no

Sergey Fomin and Curtis Greene, Noncommutative S chur functions and their applications , Discrete Math. 193 (1998), no. 1-3, 179--200, Selected papers in honor of Adriano Garsia (Taormina, 1994). 1661368

work page 1998

[2] [2]

Women Math

Maria Gillespie, Variations on a theme of S chubert calculus , Recent trends in algebraic combinatorics, Assoc. Women Math. Ser., vol. 16, Springer, Cham, 2019, pp. 115--158. 3969573

work page 2019

[3] [3]

14 (1974), 254--265

Curtis Greene, An extension of S chensted's theorem , Advances in Math. 14 (1974), 254--265

work page 1974

[4] [4]

Haiman, On mixed insertion, symmetry, and shifted Y oung tableaux , J

Mark D. Haiman, On mixed insertion, symmetry, and shifted Y oung tableaux , J. Combin. Theory Ser. A 50 (1989), no. 2, 196--225

work page 1989

[5] [5]

P. N. Hoffman and J. F. Humphreys, Projective representations of the symmetric groups: Q -functions and shifted tableaux , Oxford Mathematical Monographs, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1992

work page 1992

[6] [6]

Knuth, Permutations, matrices, and generalized Y oung tableaux , Pacific J

Donald E. Knuth, Permutations, matrices, and generalized Y oung tableaux , Pacific J. Math. 34 (1970), 709--727

work page 1970

[7] [7]

Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol

M. Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol. 90, Cambridge University Press, Cambridge, 2002, A collective work by Jean Berstel, Dominique Perrin, Patrice Seebold, Julien Cassaigne, Aldo De Luca, Steffano Varricchio, Alain Lascoux, Bernard Leclerc, Jean-Yves Thibon, Veronique Bruyere, Christiane Fro...

work page 2002

[8] [8]

u tzenberger, Le mono\

Alain Lascoux and Marcel-Paul Sch\" u tzenberger, Le mono\" de plaxique , Noncommutative structures in algebra and geometric combinatorics ( N aples, 1978), Quad. ``Ricerca Sci.'', vol. 109, CNR, Rome, 1981, pp. 129--156

work page 1978