{"id":"a669420b-586d-4112-a5f1-bac369d7b031","arxiv_id":"1908.03474","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The restriction to Z_{p-1} wreath S_w of any irreducible character of (Z_p semidirect Z_{p-1}) wreath S_w is decomposed into irreducible characters using Littlewood-Richardson coefficients.","lead":"This paper gives an explicit formula for how irreducible characters of a certain wreath product group split when restricted to a smaller wreath product subgroup, using Littlewood-Richardson coefficients. It completes the computation of the matrix that decomposes restrictions to p-regular elements of symmetric group characters in the p-basic set introduced by the authors' earlier work.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Only substantive risk is the unstated external [4, Prop 4.1] used in the final step of Theorem 5.1; the application looks standard, so the formula is probably sound, but this step should be independently checked.","rationale":"The stress-test pass confirms the reader's weakest assumption: the only unsupported step is the external [4, Prop 4.1]. I independently re-derived the surrounding argument, including Theorem 3.3, Lemmas 4.1 and 4.2, and Theorems 4.4 and 4.5, and found no internal error; the degree arguments and Mackey-theorem computations are correct. The [4] step is a standard wreath-product Littlewood-Richardson rule and the notation matches, so I see no actual flaw, but because the proposition is not stated and is load-bearing, a concrete computational check would fully close the gap. Since the paper's central theorem is otherwise rigorously derived from standard results, the reader's ACCEPT verdict should stand.","tokens_in":14841,"tokens_out":24138,"duration_ms":222399,"concrete_test":"Independently verify the needed case of [4, Prop 4.1] from first principles: for p=3, so G is is S_3 and r=2, take J=(1,1) with beta_1=beta_3=(1), and compute Ind_{G_1 times G_1}^{G_2}((psi_2 tensor phi_{(1)}) boxtimes (psi_2 tensor phi_{(1)})) by Mackey's formula; check it equals (~psi^2_2 tensor phi_{(2)}) plus (~psi^2_2 tensor phi_{(1,1)}), both iterated Littlewood-Richardson coefficients being 1. More generally, for arbitrary beta_i with small total size, compute the multiplicity of each ~psi^{|J|}_r tensor phi_{gamma_r} in the induced character via Frobenius reciprocity and confirm it equals the iterated Littlewood-Richardson coefficient c^{gamma_r}_{(beta_i)}. Matching coefficients in these finite computations would validate the use of the external proposition; a mismatch would require restating or replacing Theorem 5.1.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 5's derivation of Theorem 5.1 is sound except for one opaque step: the expansion of Ind_{G_J}^{G_{|J|}}(product over i in I of (~psi^{j_i}_r tensor phi_{beta_i})) as a sum over gamma_r of c^{gamma_r}_{(beta_i)} (~psi^{|J|}_r tensor phi_{gamma_r}) is taken from [4, Proposition 4.1]. The paper neither quotes the proposition's statement nor proves this special case. If Stein's result has different hypotheses, for instance if it only applies to N = S_m rather than N = Z_p semidirect Z_{p-1}, or if it gives different coefficients, then the formula for k_{alpha,gamma} in Theorem 5.1 is unsupported. All other steps, including Theorem 3.3, Lemma 4.2, Theorems 4.4 and 4.5, are proved in the text and check out; the only non-explicit input is this wreath-product Littlewood-Richardson rule.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper computes, for an odd prime p and w ≥ 0, the decomposition into irreducible characters of H_w = Z_{p-1} ≀ S_w of the restriction of every irreducible character of G_w = (Z_p ⋊ Z_{p-1}) ≀ S_w. The main result, Theorem 5.1, expresses the induced character Ind_{H_w}^{G_w}(ξ_α) as a sum over γ ⊢ w of k_{α,γ} χ_γ, where k_{α,γ} is a sum over partitions β_i of products of Littlewood-Richardson coefficients. Via equation (1), taken from Brunat-Gramain [1], this gives the matrix expressing restrictions to p-regular elements of symmetric group characters in the p-basic set of [1]. The proof proceeds by standard Mackey/Frobenius reciprocity and Littlewood-Richardson manipulations, with the internal lemmas proved in detail and the final step relying on an external wreath-product Littlewood-Richardson rule cited from Stein [4].","tokens_in":15096,"tokens_out":9989,"duration_ms":98233,"significance":"If the formula is correct, it completes the computation of the transition matrix N_B for the Brunat-Gramain p-basic set of S_n and gives an explicit, uniform, parameter-free description in terms of Littlewood-Richardson coefficients. The internal arguments are careful and essentially self-contained: Theorem 3.3 establishes the compatibility of the parametrizations, Lemma 4.2 and Theorems 4.4 and 4.5 prove the required induction formulas with LR multiplicities, and the reduction in Section 5 is transparent once the external rule is granted. The paper does not rely on its own earlier results for the main theorem; [1] is used for motivation and for equation (1) only. The main caveat is that the final step of Section 5 invokes [4, Proposition 4.1] without stating it or checking its hypotheses, so the central formula rests on an unverified external input.","major_comments":[{"comment":"The step Ind_{G_J}^{G_{|J|}}(∏_{i∈I}(~ψ^{j_i}_r⊗φ_{β_i})) = ∑_{γ_r⊢|J|} c^{γ_r}_{(β_i,i∈I)} (~ψ^{|J|}_r⊗φ_{γ_r}) is load-bearing for Theorem 5.1 and is justified only by 'iterating [4, Proposition 4.1]'. This proposition is neither stated nor proved, and the paper does not verify that its hypotheses apply to G = Z_p ⋊ Z_{p-1} rather than only to symmetric-group wreath products. Please state the proposition explicitly, define the iterated coefficient c^{γ_r}_{(β_i,i∈I)} precisely, and confirm that the hypotheses hold in this setting. If the theorem is available only under different hypotheses, the main formula is unsupported as written.","section":"Section 5, display before Theorem 5.1"}],"minor_comments":[{"comment":"The notation α−J = (α_1−j_1, ..., α_{r-1}−j_{r-1}, α_{r+1}−j_{r+1}, ..., α_p−j_p) is used as a subscript for G, but α_i is a partition and j_i is an integer; define G_{α−J} explicitly as ∏_{i∈I} G_{|α_i|−j_i}, and similarly for the corresponding Young subgroup.","section":"Section 5, notation before Theorem 5.1"},{"comment":"Theorem 4.5 is stated for k ≥ 1, but Section 5 applies it with |α_i| = 0. Please state the trivial k = 0 case or add a convention covering it.","section":"Theorem 4.5 and Section 5"},{"comment":"The symbol ⊠ is introduced only in the remark following Theorem 4.4, although it is used in the theorem statement; define it before or within the statement.","section":"Section 4, after Theorem 4.4"},{"comment":"In the proof, the equation involving Res^{H_k}_{H_j×H_{j−k}}(ζ_α) should read H_j×H_{k−j}; the current subscript is a typo.","section":"Proof of Theorem 4.4"},{"comment":"The assertion that there is a single (H_k, G_j×G_{k−j})-double coset is compressed; one sentence explaining that the double-coset representatives can be chosen inside S_k would improve readability.","section":"Proof of Theorem 4.4"},{"comment":"Equation (1) depends on the bijection λ ↦ ~λ and the signs ε(λ) from [1]; a one-sentence reminder of the normalization of these objects would make the paper more self-contained.","section":"Section 1"}],"recommendation":"major_revision","confidential_remarks":"The paper is mathematically sound as far as I can check, and the main formula is attractive and useful. The only substantive issue is the unstated external theorem [4, Proposition 4.1] used in the final step of Section 5. I would not reject on this basis, but I would require the authors to state the proposition and verify its hypotheses before publication. The remaining issues are notational and presentational."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Let me cut to the chase. This paper proves the explicit decomposition of induced characters from H_w = Z_{p-1} ≀ S_w to G_w = (Z_p ⋊ Z_{p-1}) ≀ S_w for any odd prime p and w > 0. That is Theorem 5.1, which expresses the multiplicities k_{α,γ} as sums over β_i of products of Littlewood–Richardson coefficients. This is a genuinely new result: the earlier paper [1] by Brunat and Gramain gives a p-basic set for S_n and reduces the computation of the basic-set matrix to exactly these decompositions, but does not compute them. This paper completes that program.\n\nThe proof is well structured and mostly self-contained. The parametrization compatibility in Theorem 3.3 is clean, the multiplicity computations in Section 4 are careful, and Theorem 4.5 is a useful induction formula in its own right. The final assembly in Section 5 is a straightforward, correct induction once the key expansion is accepted.\n\nThe one real soft spot is the use of [4, Proposition 4.1] in the last step of the derivation of Theorem 5.1. The paper does not state the proposition, nor does it prove the needed special case. This is a load-bearing step: it is what turns the induction from a product of G_{j_i} into a sum over γ_r with iterated LR coefficients. If Stein's result has different hypotheses, the main formula would be unsupported. I checked the application as best I can from the text: the characters being induced are the 'r-concentrated' irreducibles, and the induction over the wreath product reduces to ordinary LR induction over S_{|J|}, so I am fairly confident the citation works. But the authors should give a precise statement or a short proof; this is a minor-to-moderate gap, not a fatal one.\n\nOther minor issues: there are no worked examples, so the formula is a bit abstract; a small check (say p=3, w=2) would help. The notation for outer tensor products (⊠) is dense but consistent.\n\nThe citation pattern looks fine. Self-citation to [1] is appropriate as motivation, and the only external dependence is [4], which is a published paper.\n\nWho is this for? Researchers in modular representation theory of symmetric groups and wreath products. If you work on basic sets or decomposition numbers, this is directly useful. I would cite it.\n\nMy recommendation: deserves a serious referee. I would accept it after a minor revision that spells out Stein's proposition and verifies its applicability.","headline":"Explicit decomposition formula for restrictions in wreath products that completes the Brunat–Gramain basic set program; the proof is sound modulo one unquoted external LR rule.","tokens_in":15568,"tokens_out":4909,"would_cite":true,"duration_ms":49424,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20C30","20C15","20C20"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves an explicit formula for decomposing the restriction of any irreducible character of (Z_p ⋊ Z_{p-1}) ≀ S_w to Z_{p-1} ≀ S_w, with Littlewood-Richardson coefficients as the multiplicities.","keywords":["wreath products","restriction of characters","symmetric group","p-basic sets","p-regular elements","Littlewood-Richardson coefficients","Brauer characters","modular representation theory"],"falsifier":"Take $p=3$, so $G_w=(\\mathbb{Z}_3\\rtimes\\mathbb{Z}_2)\\wr\\mathfrak{S}_w$ and $H_w=\\mathbb{Z}_2\\wr\\mathfrak{S}_w$, choose $w=2$ and a concrete $\\alpha$ such as $\\alpha=(2,\\varnothing)$ or $\\alpha=(1,1)$, and compute the scalar product $\\langle\\operatorname{Ind}_{H_w}^{G_w}(\\xi_\\alpha),\\chi_\\gamma\\rangle_{G_w}$ directly from character values on conjugacy classes or via the double-coset formula; compare it with $k_{\\alpha,\\gamma}$ from Theorem 5.1 for every $\\gamma\\Vdash 2$. Any mismatch between the two numbers would refute the claimed formula.","tokens_in":14681,"feed_emoji":"🧮","tokens_out":10044,"duration_ms":89453,"temperature":0.7,"pith_summary":"The paper aims to make fully explicit how irreducible characters behave when they are restricted from the wreath product $G_w=(\\mathbb{Z}_p\\rtimes\\mathbb{Z}_{p-1})\\wr\\mathfrak{S}_w$ to its subgroup $H_w=\\mathbb{Z}_{p-1}\\wr\\mathfrak{S}_w$, for any odd prime $p$. Its main theorem gives the multiplicity of each irreducible character of $G_w$ in the induced character of any irreducible character of $H_w$ as a product of Littlewood-Richardson coefficients. This is not an isolated representation-theory computation: by the reduction established in [1], these restrictions are exactly the data needed to expand the restriction to $p$-regular elements of every irreducible character of the symmetric group $\\mathfrak{S}_n$ in the $p$-basic set constructed there. A reader should care because it replaces a previously abstract change-of-basis matrix for a fundamental family of finite groups with coefficients that can be read off from standard partition combinatorics.","feed_headline":"Explicit decomposition for restricted symmetric-group characters","feed_subtitle":"Littlewood-Richardson coefficients give every multiplicity in the p-regular restriction of S_n characters.","key_machinery":"The load-bearing device is the standard parametrisation of irreducible characters of a wreath product by tuples of partitions, together with the Littlewood-Richardson coefficients $c^\\lambda_{\\mu,\\nu}$ that count the multiplicities in induced symmetric-group characters. The proof starts from $\\xi_\\alpha=\\operatorname{Ind}_{H_\\alpha}^{H_w}(\\prod_{i\\in I}\\tilde\\theta_i^{|\\alpha_i|}\\otimes\\zeta_{\\alpha_i})$, induces instead through $G_\\alpha=\\prod_{i\\in I}G_{|\\alpha_i|}$, and uses Theorem 4.5 to expand each factor $\\operatorname{Ind}_{H_{|\\alpha_i|}}^{G_{|\\alpha_i|}}(\\tilde\\theta_i^{|\\alpha_i|}\\otimes\\zeta_{\\alpha_i})$ into induced characters involving $\\tilde\\psi_r$ and $\\tilde\\psi_i$. The remaining factors are then regrouped: an iterated Littlewood-Richardson expansion, taken from the proposition cited as [4, Proposition 4.1], turns $\\prod_{i\\in I}(\\tilde\\psi_r^{j_i}\\otimes\\phi_{\\beta_i})$ into a sum of $\\tilde\\psi_r^{|J|}\\otimes\\phi_{\\gamma_r}$, so that after inducing to $G_w$ one lands exactly on the irreducible characters $\\chi_\\gamma$. Frobenius reciprocity and the double-coset formula for induced characters certify that the internal scalar products collapse to the stated coefficients.","core_discovery":"On the paper's own terms, the central discovery is Theorem 5.1: for every $w>0$ and every $\\alpha=(\\alpha_1,\\ldots,\\alpha_{r-1},\\alpha_{r+1},\\ldots,\\alpha_p)\\Vdash w$, the induced character $\\operatorname{Ind}_{H_w}^{G_w}(\\xi_\\alpha)$ has the expansion\n$$\\operatorname{Ind}_{H_w}^{G_w}(\\xi_\\$\\alpha$)=\\sum_{\\gamma=(\\gamma_1,\\ldots,\\gamma_p)\\Vdash w} k_{\\$\\alpha$,\\gamma}\\,\\chi_\\gamma,$$\nwhere\n$$k_{\\$\\alpha$,\\gamma}=\\sum_{\\substack{\\beta_i\\vdash |\\alpha_i|-|\\gamma_i|\\\\(i\\in I)}}\\left(\\prod_{i\\in I} $c^{{\\alpha_i}}$_{\\beta_i,\\gamma_i}\\right)$c^{{\\gamma_r}}$_{(\\beta_i)_{i\\in I}},$$\nand $k_{\\alpha,\\gamma}=0$ unless $|\\gamma_i|\\le |\\alpha_i|$ for all $i\\in I$. Together with Theorem 3.3, which identifies the characters of $G_w$ with $\\gamma_r=\\emptyset$ with the irreducible characters of $H_w$, this gives the complete decomposition of every restriction $\\operatorname{Res}^{G_w}_{H_w}(\\chi_\\gamma)$, and through equation (1) it yields the coefficients expressing restrictions to $p$-regular elements of irreducible characters of $\\mathfrak{S}_n$ in the $p$-basic set of [1].","pith_inferences":["Because the multiplicities vanish in a triangular pattern, the matrix $N_B$ is likely invertible over $\\mathbb{Z}$ with an inverse computable by the same Littlewood-Richardson data; the paper itself does not discuss inversion, but triangularity would make it routine.","The same induction-through-$G_\\alpha$ strategy may adapt to restrictions between wreath products built from other pairs of groups $(N_1,N_2)$ with compatible character parametrizations, not just cyclic groups; the paper confines itself to the $\\mathbb{Z}_p\\rtimes\\mathbb{Z}_{p-1}$ case.","If the cited iterated Littlewood-Richardson expansion were supplied with a constructive proof, the formula could be implemented as an algorithm for producing the basic-set transition matrix for all $n$ up to a given bound; the paper stops at the closed form."],"forward_implications":["The transition matrix $N_B$ that expresses restrictions to $p$-regular elements of $\\mathfrak{S}_n$-characters in the $p$-basic set of [1] is now given by closed-form Littlewood-Richardson products, so the coefficients can be computed directly rather than block-by-block.","The special case $\\gamma_r=\\emptyset$ recovers Theorem 3.3: characters of $G_w$ labelled by $(\\alpha_1,\\ldots,\\alpha_{r-1},\\emptyset,\\alpha_{r+1},\\ldots,\\alpha_p)$ restrict to exactly the irreducible characters $\\xi_\\alpha$ of $H_w$.","Because $k_{\\alpha,\\gamma}=0$ unless $|\\gamma_i|\\le|\\alpha_i|$ for every $i\\in I$, the restriction matrix is triangular with respect to the total sizes of the parts, which organises the decomposition of the basic-set basis.","For any $n$ with $p$-weight $w$, all scalar products appearing in equation (1) reduce to the same type of iterated Littlewood-Richardson sums, so the method applies uniformly to every $p$-block of $\\mathfrak{S}_n$."],"supporting_citations":[{"why":"Supplies the $p$-basic set for $\\mathfrak{S}_n$ whose transition matrix the paper computes, and the reduction in equation (1) that transfers restrictions to p-regular elements into wreath-product scalar products.","marker":"[1]"},{"why":"Provides the double-coset formula for induced characters used to evaluate the scalar products that identify the coefficients as Littlewood-Richardson numbers.","marker":"[2]"},{"why":"Gives the parametrization of wreath-product conjugacy classes and irreducible characters by tuples of partitions, and the Littlewood-Richardson rule used throughout.","marker":"[3]"},{"why":"Gives the iterated Littlewood-Richardson expansion for induced wreath-product characters that is the final step of Theorem 5.1.","marker":"[4]"}],"fun_headline_variants":["Explicit restriction decomposition for symmetric groups","p-regular restrictions via Littlewood-Richardson","Closed form for S_n restrictions to p-basic set","Restrictions to p-regular characters made explicit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument rests on [4, Proposition 4.1], a cited result stating that certain induced characters of wreath products expand into characters $\\tilde\\psi_r^{|J|}\\otimes\\phi_{\\gamma_r}$ with iterated Littlewood-Richardson coefficients; the paper uses this result without proving it or checking its compatibility, and if that expansion is wrong the main formula loses its support.","fun_headline_variants_meta":{"raw":{"variants":["Explicit restriction decomposition for symmetric groups","p-regular restrictions via Littlewood-Richardson","Closed form for S_n restrictions to p-basic set","Restrictions to p-regular characters made explicit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000481,"raw_usage":{"total_tokens":2419,"prompt_tokens":1029,"completion_tokens":1390,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":645,"completion_tokens_details":{"reasoning_tokens":1329}},"tokens_in":645,"tokens_out":1390,"duration_ms":12870,"temperature":1.0,"reasoning_tokens":1329,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:12:02.458612+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $p=3$, so $G_w=(\\mathbb{Z}_3\\rtimes\\mathbb{Z}_2)\\wr\\mathfrak{S}_w$ and $H_w=\\mathbb{Z}_2\\wr\\mathfrak{S}_w$, choose $w=2$ and a concrete $\\alpha$ such as $\\alpha=(2,\\varnothing)$ or $\\alpha=(1,1)$, and compute the scalar product $\\langle\\operatorname{Ind}_{H_w}^{G_w}(\\xi_\\alpha),\\chi_\\gamma\\rangle_{G_w}$ directly from character values on conjugacy classes or via the double-coset formula; compare it with $k_{\\alpha,\\gamma}$ from Theorem 5.1 for every $\\gamma\\Vdash 2$. Any mismatch between the two numbers would refute the claimed formula.","supporting_citations":[{"cited_title":"Brunat and J","cited_arxiv_id":null,"evidence_quote":"Supplies the $p$-basic set for $\\mathfrak{S}_n$ whose transition matrix the paper computes, and the reduction in equation (1) that transfers restrictions to p-regular elements into wreath-product scalar products."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the double-coset formula for induced characters used to evaluate the scalar products that identify the coefficients as Littlewood-Richardson numbers."},{"cited_title":"James and A","cited_arxiv_id":null,"evidence_quote":"Gives the parametrization of wreath-product conjugacy classes and irreducible characters by tuples of partitions, and the Littlewood-Richardson rule used throughout."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the iterated Littlewood-Richardson expansion for induced wreath-product characters that is the final step of Theorem 5.1."}],"review_version":1}