Tensor powers of representations of (diagram) monoids

Daniel Tubbenhauer; David He

REVIEW 2 major objections 2 minor 1 cited by

Tensor powers of representations of (diagram) monoids

T0 review · 2 major / 2 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read The paper establishes that tensor powers of representations of the Temperley-Lieb, Motzkin, and Brauer monoids decompose in patterns that can be computed explicitly, revealing growth in composition length and number of indecomposable summan

desk verdict A potentially useful data paper on tensor powers of TL, Motzkin, and Brauer monoids, but the abstract leaves the semisimplicity assumptions unstated, and that is where the risk lives. read the letter →

arxiv 2508.04054 v1 pith:K5ODLS5R submitted 2025-08-06 math.RT math.CTmath.GR

David He , Daniel Tubbenhauer This is my paper · ORCID

classification math.RTmath.CTmath.GR MSC 20M3005E10

keywords tensorpowersdiagrammonoidsTemperley-LiebMotzkinBrauercompositionlengthindecomposablesummandscharactertables

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

This paper studies how tensor powers of representations of finite monoids decompose, focusing on the growth behavior of composition length and the number of indecomposable summands. It establishes that for the Temperley-Lieb, Motzkin, and Brauer monoids, this growth can be computed explicitly through character tables and decomposition data. The authors analyze patterns in these decompositions, providing a concrete base of examples for the representation theory of diagram monoids. A sympathetic reader would care because these monoids appear across mathematics and physics, and knowing the growth behavior gives structural insight into their representation categories.

What carries the argument

The key object is the tensor power $V^{\otimes n}$ of a representation $V$, equipped with the diagonal monoid action, together with the character table of the monoid algebra, which encodes composition lengths when the algebra is semisimple. For diagram monoids, the mechanism is the explicit combinatorial presentation of elements (diagrams) and the known classification of simple and indecomposable modules, which makes the tensor decomposition computable.

What would settle it

Pick a non-semisimple parameter value for the Temperley-Lieb algebra (e.g., a root-of-unity parameter) and compute the composition length of the second tensor power of a non-simple indecomposable module. If the result differs from the character-table prediction, then the paper's growth analysis is confined to the semisimple case.

Watch

Extended reading notes

Core claim

The paper's central claim is that the tensor powers of representations of the Temperley-Lieb, Motzkin, and Brauer monoids have decomposition patterns that can be made explicit, with both the composition length and the number of indecomposable summands exhibiting regular growth as the tensor power increases. It computes character tables and splitting data for these families, and analyzes the resulting patterns. In the semisimple range, the character tables determine the composition lengths, so the growth behavior is read off directly from the character theory.

Load-bearing premise

The analysis assumes the monoid algebras are semisimple at the chosen parameters, so that the character table determines the composition length; if a parameter value makes the algebra non-semisimple, the reported growth patterns may not hold without a Cartan-matrix correction.

Editorial extensions

If this is right

For the Temperley-Lieb, Motzkin, and Brauer monoids, the growth of composition length and summand counts in tensor powers is now tabulated, giving explicit reference data.
The computed character tables let one determine the composition length of any tensor power within the semisimple parameter regime without recomputing decomposition.
The observed patterns provide a benchmark against which conjectures about tensor behaving for other monoids or algebras can be tested.
The examples show how growth can shift between different behaviors (e.g., polynomial vs exponential) as the representation or the monoid changes.

Reading between the lines

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

A natural next step is to test whether the same growth patterns persist for non-semisimple parameter values; if they do not, the character-table method must be replaced by one using Cartan matrices, and the data in this paper would then mark the boundary of the semisimple regime.
The diagonal action is just one of several monoidal structures on the module category; considering twisted tensor products would likely change the growth behavior, and the techniques here could be adapted to compute those cases.
The same approach could be applied to other diagram monoids, such as the partition monoid or the rook monoid, whose combinatorial structure is similar.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

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

Quick context: I'm working from the abstract only—the full text wasn't available. So this is a provisional read, not a verdict.

What the paper does well, as far as I can tell: it picks a concrete, under-tabulated problem. Tensor-power growth of representations is a known lens, but explicit decomposition data for Temperley-Lieb, Motzkin, and Brauer monoids would be genuinely useful to people in low-dimensional topology, statistical mechanics, and diagram-algebra representation theory. The abstract also signals a sensible focus on both composition length and number of indecomposable summands—these can behave very differently, and tracking both is the right thing to do.

The soft spot is the one the stress test flags. Character tables determine composition factors in characteristic zero, but they do not determine the number of indecomposable summands in a non-semisimple algebra. The Temperley-Lieb algebra at roots of unity is the standard example where characters are not a complete invariant. If the paper computes counts of indecomposable summands from character tables alone, without either restricting to generic parameter values or running a separate decomposition algorithm, those numbers could be wrong. The abstract does not state the parameter regime, and it does not describe the computational method. That is a load-bearing omission, not a cosmetic one.

Also, because the abstract promises "explicit data," I hope the paper includes the full tables in a form readers can check. If the tables are there, that's a real plus for reproducibility. If they are only summarized patterns, the paper is weaker.

I would not desk-reject this. The topic is legitimate, the authors are known in the area (Tubbenhauer's prior work on diagram monoids is relevant), and the possible flaw is checkable by a knowledgeable referee. Send it out, and ask the referee specifically to verify whether the tensor-power decompositions are computed in a fixed semisimple regime or whether non-semisimple corrections are handled. If the answer is clean, this is a solid data contribution; if not, it needs major revision.

For my own work: I probably won't cite it in the next year, but if I were working on diagram monoid tensor powers, I'd want this data. Reading group: maybe—it could generate a useful discussion about characters versus indecomposable summands, but the abstract alone isn't enough to justify a slot.

Referee Report

2 major / 2 minor

Summary. The paper studies tensor powers of representations of finite monoids, focusing on the growth behavior of composition length and the number of indecomposable summands. Special attention is given to diagram monoids: Temperley-Lieb, Motzkin, and Brauer. The authors compute explicit data, including some character tables, and analyze patterns in the decomposition of tensor powers. This is an abstract-only review; the full text is not available.

Significance. If correct, this work would provide the first systematic tabulation of tensor-power decompositions and their growth for these diagram monoids, connecting representation theory of finite monoids with diagram algebras. The focus on both composition length and number of indecomposable summands is potentially valuable, especially if the data reveal uniform patterns across families. However, since the full text is unavailable and the abstract does not specify parameter regimes or methods, the significance cannot be fully assessed from the abstract alone.

major comments (2)

[Abstract] The claim to compute 'the number of indecomposable summands' is load-bearing, but the abstract also highlights 'some character tables'. For non-semisimple algebras, characters do not determine the number of indecomposable summands: non-isomorphic modules can have identical characters while having different direct-sum decompositions. Temperley-Lieb, Motzkin, and Brauer algebras are non-semisimple at special parameter values. The abstract does not state whether the paper restricts to semisimple parameters (e.g., generic δ) or uses an explicit decomposition algorithm beyond character data. This missing condition is essential for the correctness of the claimed growth data.
[Abstract] The growth behavior of composition length and number of indecomposable summands in tensor powers depends on the choice of parameter regime (generic vs. specialized) for the diagram monoids. The abstract does not specify the base field or the parameter δ for Temperley-Lieb/Motzkin/Brauer, nor whether semisimple/semisimple-correction assumptions are made. Without this information, the reported patterns may be either restricted to a special case or require a non-semisimple analysis that is not described.

minor comments (2)

[Abstract] The phrase 'including some character tables' is vague; please specify for which monoids and parameter values these tables are computed.
[Abstract] The term 'tensor powers' for monoid representations conventionally means the diagonal action on the tensor product, but this is not stated. If a different monoidal structure is used, the growth behavior could differ.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity detectable from the abstract alone; no derivation chain is visible.

full rationale

This is an abstract-only review. The abstract announces a study of tensor powers of representations of finite monoids, with focus on growth of composition length and number of indecomposable summands, and explicit data for Temperley-Lieb, Motzkin, and Brauer monoids, including some character tables. No equations, no claimed derivations, and no fitted parameters are presented in the abstract. There is no basis to assert that any result is defined in terms of another, that a fitted input is called a prediction, or that a load-bearing step reduces to a self-citation. The possible technical concern that character tables alone may not determine indecomposable summand counts in non-semisimple regimes is a correctness/validity issue, not a circularity issue: it does not make the computation equivalent to its inputs by construction. Without the full text, no specific circular step can be exhibited, and the hard rules forbid speculation. Therefore the only honest finding is no significant circularity, score 0.

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

Abstract-only review, so the ledger is necessarily partial. No free parameters or invented entities are visible; the axioms listed are the minimal standard background plus the semisimplicity-adjacent assumption that character tables can govern composition-length data. The count of free parameters could grow once the full text reveals how parameters such as the Temperley-Lieb loop value are chosen.

assumptions (4)

standard math Tensor powers of M-modules are M-modules via the diagonal action m.(v1⊗...⊗vk) = (m.v1)⊗...⊗(m.vk).
Makes 'tensor powers of representations' well defined for an arbitrary finite monoid M with no coproduct; invoked implicitly by the abstract's central object.
domain assumption Known cellular structure and simple-module classification for Temperley-Lieb, Motzkin, and Brauer monoids are taken as input.
The abstract says the paper computes character tables, which presupposes the prior classification of simple modules for these diagram monoids.
domain assumption The chosen parameters make the diagram monoid algebras semisimple (or the paper provides an explicit non-semisimple correction), so that composition lengths of tensor powers can be read from character-theoretic data.
The abstract frames character tables as the basis for decomposition analysis; composition length equals the number of simple constituents only in (or with explicit control of) the semisimple case.
standard math The monoid algebras are finite dimensional over the chosen field, so composition length and indecomposable summand counts are finite.
Background fact guaranteeing the invariants studied are well defined.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Tensor powers of representations of (diagram) monoids." pith.science (2026). https://pith.science/paper/K5ODLS5R

@misc{pith2026250804054,
  author       = {Pith},
  title        = {Pith review of: Tensor powers of representations of (diagram) monoids},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/K5ODLS5R}},
  note         = {Machine review of arXiv:2508.04054}
}

read the original abstract

We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb, Motzkin, and Brauer monoids. For these examples, we compute explicit data, including some character tables, and analyze patterns in the decomposition of their tensor powers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Growth in affine Hecke categories
math.RT 2026-08 accept novelty 7.0 of 10

In affine Hecke categories, high tensor powers of a fixed object have a number of indecomposable summands of order n^{-|Phi^+|/2} times an exponential; proved in type A1, and for longest elements in type A2, with coar...

Pith tools

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