REVIEW 2 major objections 6 minor 7 references
Some calculations of centralizer rings of a complex reflection group
T0 review · 2 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read For the complex reflection group $H_1$ of order 96, the paper determines the centralizer ring of the $k$-th tensor power of every faithful transitive permutation representation as an explicit direct sum of matrix algebras with closed-form…
desk verdict A workmanlike computational extension that closes the remaining cases for the centralizer rings of a 96-element reflection group; sound but externally dependent on a character table that the manuscript fails to include. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The carrying object is the $16\times 16$ character table $X$ of $H_1$, reproduced from the earlier paper, together with the matrix $A=X\,\mathrm{diag}(\theta(C_1),\dots,\theta(C_{16}))\,X^{-1}$ for a permutation character $\theta$. Because multiplication by a permutation character implements tensoring by the permutation module, the multiplicity vector of the $k$-th tensor power satisfies $\vec d^{(k)}=\vec d^{(k-1)}A$, and since $A$ is diagonalized by $X$, every coefficient is a linear combination of powers $\theta(C_j)^{k-1}$. The closed-form block sizes in Theorem 3 are the result of evaluating those combinations.
What would settle it
For $k=2$, reconstruct the five permutation actions from the listed subgroup generators, form the $96^2$-dimensional tensor matrices, and compute the full centralizer ring directly; Theorem 3 predicts, for $\theta_1$, simple blocks of sizes $96,192,288,384$ with multiplicities $4,6,4,2$, and any deviation disproves the paper. A cheaper independent check is to recompute the fixed-point counts in Proposition 1 from scratch and verify that they reproduce the character decompositions in Proposition 2.
Extended reading notes
Core claim
The central claim, stated as Theorem 3, is that each centralizer ring $A_{\theta_i}^{(k)}$ is isomorphic to a direct sum of matrix algebras whose multiplicities and block sizes are known closed-form sequences. For $\theta_1$ and $\theta_4$ the pattern is $4M_{a_k}\oplus 6M_{e_k}\oplus 4M_{l_k}\oplus 2M_{p_k}$, with $a_k=96^{k-1}$, $e_k=96^k/48$, $l_k=96^k/32$, $p_k=96^k/24$; for $\theta_3$ the ring splits into eight distinct block types; and for $\theta_8$ and $\theta_9$ the rings have the same five-block form. Corollary 4 turns these into dimension formulas, for instance $\dim A_{\theta_1}^{(k)}=96^{2k-1}$.
Load-bearing premise
The load-bearing premise is that the $16\times 16$ character table of $H_1$ reproduced from the earlier paper, and the computer subgroup enumeration behind the permutation character values, are both correct; if either is wrong, every multiplicity vector and block-size formula collapses.
Editorial extensions
If this is right
- For $\theta_1$ and $\theta_4$, every tensor centralizer ring has the same four-block pattern, so the level of complexity does not grow with $k$.
- For $\theta_8$ and $\theta_9$, the level-one permutation characters are multiplicity-free, hence all of their centralizer rings are commutative; the theorem gives their dimensions and block structure for all $k$.
- The dimension formulas in Corollary 4 are exact: $\dim A_{\theta_1}^{(k)}=96^{2k-1}$, $\dim A_{\theta_3}^{(k)}=(48^{2k-1}+8^{2k-1})/2$, $\dim A_{\theta_4}^{(k)}=32^{2k-1}/3+8^{2k}/12$, and $\dim A_{\theta_8}^{(k)}=\dim A_{\theta_9}^{(k)}=24^{2k-1}/4+3\cdot 4^{2k-2}$.
- The same character-table diagonalization supplies all five representations simultaneously, completing the classification of faithful transitive tensor centralizer rings for $H_1$.
Reading between the lines
- This suggests the same diagonalization method would work for any finite group whose character table and permutation character values are known, making the $H_1$ formulas a test case for a general algorithm.
- The shared block form of $\theta_8$ and $\theta_9$ hints that those two permutation modules may be related by a group automorphism or a character twist; checking that would go beyond the paper.
- One could verify the entire computation by generating the $k=2$ centralizer rings directly and comparing with the table, a check the paper does not perform.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper studies the complex reflection group H1 of order 96. For the five faithful transitive permutation representations with permutation characters θ1, θ3, θ4, θ8, and θ9, the authors determine the centralizer rings of all k-th tensor powers. The method is to decompose each permutation character into irreducible characters using the character table X of H1 from an earlier paper, then to compute the multiplicities d_i^(k) in the k-th tensor power via the recurrence d^(k) = d^(1) X diag(θ(C_i)^{k-1}) X^{-1}. The centralizer ring A^(k)_θ is then identified with a direct sum of matrix algebras over C whose block sizes are the d_i^(k). Explicit closed-form formulas for the block sizes are given for each θ_i, together with the resulting dimensions in Corollary 4 and a numerical table for k = 1,...,4.
Significance. If the stated formulas are correct, the paper completely describes the centralizer rings for all tensor powers of all faithful transitive permutation representations of H1, which is a useful complement to earlier work. The derivation is a clean application of standard character theory, and the paper contains an internal consistency check: the sum of squares of the computed multiplicities reproduces the stated dimensions in Corollary 4. The closed-form expressions are parameter-free in the sense that they depend only on the eigenvalues of the permutation characters. However, the verification is conditional on external data: the 16x16 character table X is claimed to be reproduced but is not present in the manuscript, and the permutation character values in Proposition 1 rest on a Magma enumeration whose generators are relegated to a personal website. Because every block-size formula is linear in the inverse character table, an error in X or in the conjugacy-class ordering would invalidate Theorem 3.
major comments (2)
- [Section 1 / end of paper] The paper states in Section 1 that the character table of H1 from [4] is reproduced at the end of the paper, but no such table appears in the manuscript. Since Proposition 2 and the recurrence d^(k) = d^(1) X diag(θ(C_i)^{k-1}) X^{-1} in Section 3 depend entirely on this 16x16 matrix X, the central block-size formulas in Theorem 3 and the dimensions in Corollary 4 cannot be checked by the reader. The authors must include the character table, together with the conjugacy-class ordering used in Proposition 1, or otherwise provide a way to verify X (for example, by giving the matrices for H1 and the irreducible characters).
- [Proposition 1] Proposition 1 depends on the complete list of conjugacy classes of subgroups of H1 ('24 subgroups up to conjugacy') and on the identification of the five subgroups giving faithful actions, but the manuscript does not specify which subgroups these are. The phrase 'faithful with respect to the numbers 1,3,4,8,9' is undefined, and the actual generators are deferred to the personal website [7], which is not a stable archival reference. Without this data, the permutation character values θ_i(C_j) cannot be independently reproduced, and because the recurrence multiplies by θ(C_i)^{k-1}, any misidentification would propagate into every block size. The authors should provide the subgroup generators (and ideally the Magma code used for the enumeration) in the paper or in a stable supplement.
minor comments (6)
- [Section 1] The word 'simpliticy' should be 'simplicity', and in Section 2 'identity them' should be 'identify them'.
- [Section 2] The sentence 'Then the action of H1 on θ gives a transitive permutation representation of H1' is unclear because θ is a character, not a set; it should say 'the action on the cosets of the subgroup'.
- [Section 2] The sentence 'We observe that T and D correspond to t and d' is unexplained; the symbols T, D, t, and d should be defined or a reference given.
- [Theorem 3] In the formulas for θ8 and θ9, the term 'M_{e_k} ⊕ 3M_{f_k} ⊕ 2M_{e_k}' should be simplified to '3M_{e_k} ⊕ 3M_{f_k}' to avoid redundancy; the current notation is confusing though not wrong.
- [Theorem 3] The paper does not state explicitly that the isomorphisms in Theorem 3 are over the complex numbers; since M_d was defined over C, this should be stated for clarity.
- [Theorem 3] A brief justification of the isomorphism A^(k)_θ ≅ ⊕_i M_{d_i^{(k)}}(C) would improve self-containedness; this is a standard result but should be cited or argued.
Circularity Check
No circular fit: the block-size formulas are derived by standard character-theoretic identities from an externally checkable character table; the only caveat is heavy reliance on the authors' earlier table and Magma data, which is a verification gap, not circularity.
full rationale
The derivation chain is linear and standard rather than circular. Proposition 2 computes each multiplicity vector as (theta(C_1),...,theta(C_16)) X^{-1}, where X is the 16-by-16 character table of H1. Those permutation character values come from Proposition 1, obtained by a Magma subgroup enumeration. The tensor-power multiplicities are then obtained by the exact identity d^(k) = d^(1) X diag(theta(C_i)^{k-1}) X^{-1}, which is the usual Fourier inversion formula for the k-th tensor power of a character. The block sizes in Theorem 3 are exactly the entries of d^(k), and the dimensions in Corollary 4 are sums of squares of those same multiplicities. Thus the asserted centralizer-ring structures are not used to define or fit the inputs; they are computed from the inputs. The manuscript does rely on the authors' own prior work for the character table [4] and for one permutation character [3], and the subgroup generator list is deferred to a personal website [7]; moreover, the character table is said to be reproduced at the end of the paper but is not present in the supplied text. These are reproducibility and verification concerns, not circularity: the character table is a published, externally falsifiable object, and no parameter is fitted to the target block sizes. I therefore find no significant circularity, with a score of 1 reflecting only the dependence on self-cited computational inputs.
Assumptions & free parameters
assumptions (5)
- domain assumption The character table of H1 as reproduced from [4] is correct.
- domain assumption The permutation character values listed in Proposition 1 are correct and complete for the five faithful transitive permutation representations.
- domain assumption The classification into faithful transitive permutation representations with labels 1,3,4,8,9 is complete.
- standard math The centralizer of a finite group representation over C is a direct sum of matrix algebras with block sizes equal to the irreducible multiplicities.
- standard math For a representation with character theta, the tensor product character is theta times the character, and multiplicities in tensor powers follow the recurrence d^(k)=d^(k-1)A with A = X diag(theta(C_i)) X^{-1}.
Cite this review
Pith. "Pith review of Some calculations of centralizer rings of a complex reflection group." pith.science (2026). https://pith.science/paper/5PJ5KSM7
@misc{pith2026250720521,
author = {Pith},
title = {Pith review of: Some calculations of centralizer rings of a complex reflection group},
year = {2026},
howpublished = {\url{https://pith.science/paper/5PJ5KSM7}},
note = {Machine review of arXiv:2507.20521}
}
read the original abstract
Let H1 be the complex reflection group of order 96. For the tensor products of faithful transitive permutation representations of H1, we determine the structures of the centralizer rings. This complements the work of Imamura-Kosuda-Oura.
Reference graph
Works this paper leans on
-
[4]
Kosuda, M., Oura, M., On the centralizer algebras of the primitive unitary reflection group of order 96, Tokyo J. Math. 39 (2016), no. 2, 469-482
work page 2016
-
[7]
https://sarbaini.carrd.co/#researches Faculty of Engineering, University of Yamanashi, 400-8511, Japan Email address: mkosuda@yamanashi.ac.jp Faculty of Mathematics and Physics, Institute of Science and Engineer- ing, Kanazawa University, Kakuma-machi, Ishikawa 920-1192, Japan Email address: oura@se.kanazawa-u.ac.jp Department of Mathematics, Universitas ...
-
[1]
Bosma, W., Cannon, J., Playoust, C., The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235-265
work page 1997
-
[2]
SageMath Software (version 9.3), 2024,http://www.sagemath.org
work page 2024
-
[3]
Imamura, H., Kosuda, M., Oura, M., Note on the permutation group associated to E-polynomials, J. Algebra Comb. Discrete Struct. Appl. 9 (2022), no. 1, 1-7. 8
work page 2022
-
[5]
Kosuda, M., Oura, M., Centralizer algebras of the group associated to Z4-codes, Discrete Math. 340 (2017), no. 10, 2437-2446
work page 2017
-
[6]
Kosuda, M., Oura, M., Sarbaini., Centralizer Algebras of Two Permutation Groups of Order 1344, preprint https://doi.org/10.48550/arXiv.2412.00001
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.