{"id":"13c4bc24-6406-40cd-a8de-875ef554298d","arxiv_id":"2412.10112","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"One-character extension characters of tensor products of small CFTs organize into compact S-invariant polynomial bases, yielding closed forms up to central charge 128 and conjectured new one-character CFTs.","lead":"This paper computes candidate one-character CFTs built by tensoring copies of smaller CFTs, expressing every extension character as a compact polynomial in special S-invariant bases. It derives the monster CFT character as an explicit degree-48 polynomial of Ising characters and conjectures new one-character CFTs beyond central charge 24.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The Diophantine shortcut assumes the discovered {P1,P2,P3} generate the full commensurate S-invariant subring; this is asserted from finite-N data rather than proved, so the closure of the tables and the 'every extension character' claim rest on an unverified premise.","rationale":"The reader's verdict was CONDITIONAL, with two related concerns: the polynomial-identity versus q-series formulation of S-invariance, and the unproven claim that the discovered P_i form a generating basis. I focus on the basis-generation gap because it is the premise of the Diophantine shortcut, which is the paper's most reusable and strongest claim: the claim that every extension character can be read off from a small degree equation is false if a new commensurate S-invariant appears at higher degree. The q-series concern is real and deserves separate testing, but the basis question is the one whose answer directly controls whether Tables 4-14 and the infinite-series conjectures are complete. The proposed test is algebraic and finite: for the Ising seed, solving the same linear system one step beyond the reported range and comparing solution dimensions with the monomial count settles whether the fixed basis is complete at that degree. This does not overturn the paper's honesty, its reproducible character-level results for the checked N, or its external agreements with the Schellekens list; it identifies precisely why the strongest formulation of the central claim is not yet established. Hence the verdict should remain CONDITIONAL rather than ACCEPT, and no change from the reader's verdict is needed.","tokens_in":75676,"tokens_out":16126,"duration_ms":191369,"concrete_test":"Take the Ising seed M(4,3), where Table 9 stops at N=96. Set N=112 (k=7). Enumerate all triples (d0,d1,d2) with d0+d1+d2=112 and d1/16+d2/2 a nonnegative integer, form the ansatz (10), and solve the linear system (18) with the S-matrix (98) directly, without substituting any P_i. Count the dimension of the solution space. Compare this dimension with the number of nonnegative solutions to 16a+24b+8c=112, i.e. to 2a+3b+c=14. If the dimensions differ, the P_i are not a basis and the shortcut fails; if they match, repeat the comparison at N=128 to increase confidence. A single mismatch at any N would settle the concern against the paper's central claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reusable engine of the paper is the shortcut by which all extension characters for a seed are obtained as monomials in a fixed small set of S-invariant polynomials, e.g. 8a+6b=N for A1,1 in eq. (40), and the analogous Diophantine equations (107), (121), (133), (145), (157), (165) for the other seeds. This shortcut is valid only if the discovered P_i generate the graded subalgebra of S-invariant polynomials built from identity-commensurate monomials. The text says 'We find a S-invariant basis' but offers no invariant-theoretic proof; the evidence is that the pattern matched the finite set of N reported in Tables 4-14. The gap is not cosmetic: for A1,1, P2 itself contains non-commensurate monomials (b=1,5), so the object that actually appears in extension characters is P2^4, and the commensurate invariant subring of the S-matrix is a nontrivial graded ring. For the infinite classes D_{r,1} and B_{r,1}, the r-independent answers in Tables 10-14 are presented for all r using this same unproved generation. If a new commensurate S-invariant appears at some higher N, or if one of the listed P_i is not actually a generator while another is missing, the tables omit valid characters and the conjectured six-plus-four infinite series and the non-existence rulings at large central charge are not supported. The paper's explicit first-wave caveat protects the step from admissible characters to genuine CFTs, but it does not protect the completeness of the character-level enumeration, which is exactly what the basis-generation claim would establish.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops an algebraic method for obtaining the characters of one-character (holomorphic) CFTs as one-character extensions of tensor products C^⊗N of a fixed seed theory C. For seeds that are [2,0] WZW theories (A1,1, A2,1, G2,1, D4,1 and their coset partners E7,1, E6,1, F4,1), the Ising model M(4,3), A4,1, and the infinite classes D_{r,1} and B_{r,1}, the authors build an ansatz as a homogeneous polynomial in the characters with integer conformal dimension, impose the T-transformation and S-invariance as a polynomial identity (eq. (18)), solve the resulting overdetermined linear system, and reorganize all answers in terms of a small set of S-invariant polynomials {P1, P2, P3}. This yields a Diophantine shortcut (e.g., 8a + 6b = N for A1,1, eq. (40)) that reproduces the direct computation, giving compact closed forms up to c = 128 for A1,1 and A2,1 and uniform r-independent formulas for all D_{r,1} and B_{r,1}. Flagship results include the monster character written as P1^3 − 744 in Ising characters (eq. (106)), agreement with the Schellekens list at c = 24, non-existence rulings at selected large central charges for G2,1 and F4,1, and conjectured six-plus-four infinite families of one-character extensions. The paper is explicit that it works at the level of admissible characters (the 'first wave') and does not claim a proof of existence of the corresponding CFTs for c > 24.","tokens_in":75961,"tokens_out":29906,"duration_ms":315599,"significance":"If the completeness of the enumeration is granted, this is a substantial and useful technical contribution. The linear-algebra core is transparent and reproducible from the published q-series data, and the spot checks are clean (e.g., eq. (22) evaluates to j^{1/3} with leading coefficient 1 + 248q, and the c = 24 outputs match the relevant Schellekens entries). The paper is honest about its main caveat, and the Schellekens list is used only as external calibration, so the c = 24 agreement is a genuine check rather than a circular fit. The derivation that the ansatz monomial set is r-independent for the D_{r,1} and B_{r,1} families (Section 4.3) is a genuine proof, and the quotient-ring observation about constant S-invariant polynomials (Section 5) is conceptually nice, connecting to known identities such as the Rogers-Ramanujan relations. The non-existence rulings and the infinite-family conjectures are falsifiable predictions for future classification work. The main caveat to the significance is that the completeness claims ('every k', 'all r', and the non-existence rulings) rest on an unproved generation statement for the S-invariant bases, as detailed in the major comments.","major_comments":[{"comment":"The central organizational claim is that every one-character extension character of C^⊗N is a polynomial in a fixed small set of S-invariant polynomials {P1, P2, P3}, so that the full enumeration reduces to a Diophantine degree equation such as 8a + 6b = N for A1,1 (eq. (40)). The evidence offered is the match between this shortcut and the direct linear-system computation for k ≤ 16 (tables 4–7) and s ≤ 6 (tables 10–14); the text states 'we find a S-invariant basis' (Introduction; Section 3.1) but gives no invariant-theoretic proof that the discovered polynomials generate the graded subring of S-invariant polynomials whose monomials have integer conformal dimensions. The generation claim is nontrivial: for A1,1 the full invariant ring of the S-action has Hilbert series 1/((1−t)(1−t^2)) (generator degrees 1 and 2 over the splitting field), while the commensurate subring relevant to extension characters contains ℚ[P1, P2^4] with Hilbert series 1/((1−t^8)(1−t^24)); P2 itself (eq. (31)) is not commensurate, and only powers P2^{4j} appear in table 4. The paper provides no computation showing that the commensurate invariant subring equals ℚ[P1, P2^4]. Because the universal statements ('every k', 'all r'), the conjectured six-plus-four infinite series, and especially the non-existence rulings for G2,1 and F4,1 at c = 224, 280, 392, 448 and 416, 520, 728, 832 (Section 3.3) test only the handful of candidates from eq. (58), a missing generator at some higher N would invalidate the closure of the tables and those conclusions. The directly computed cases (e.g., N = 20, 40 for G2,1 and F4,1) are solid; the risk is concentrated in the shortcut-based cases. The first-wave caveat of the Introduction properly protects the step from admissible characters to genuine CFTs, but it does not protect the completeness of the character-level enumeration. The fix is concrete: compute the Hilbert series of the commensurate S-invariant subring (a finite-group invariant ring, so a Molien-series computation) and verify degree by degree that it matches the monomial count from the Diophantine equations; alternatively, restrict all completeness and non-existence claims to the range of N that was computed directly.","section":"§3.1–3.4, §4.2–4.4; eqs. (40), (58), (107), (121), (133), (145), (157), (165)"},{"comment":"The paper imposes S-invariance as an equality of homogeneous polynomials (eq. (18)) and solves the resulting linear system, but the physical condition on the extension character is equality of the resulting q-series. When the seed characters satisfy polynomial relations that hold only at the level of q-series, as the paper itself shows with P2 = 2 for A1,1 (eq. (34)), P3 = 0 and P2 = 1 for the Ising model (Section 4.2), and the constant values in eqs. (119), (131), (143), (155) and (166), the polynomial-level condition is strictly stronger than the q-series-level condition, so the solution space of eq. (18) can be a proper subset of the space of q-series-S-invariant polynomials in the ansatz class. Concretely, a polynomial P in the ansatz space with P(Sχ) − P(χ) lying in the nonzero relation ideal generated by such constant relations would pass the q-series test while failing eq. (18), and the paper does not show that no such P exists in the claimed ranges. The parameter counts in the computed range match the admissible characters of appendix A (e.g., [k/3] free parameters for A1,1), which is reassuring evidence, but the enumeration is extended to all k and all r without proving that the ansatz space intersects the relation ideal trivially in the relevant degrees. Relatedly, Section 5 claims that extension characters are 'properly' elements of the quotient ring generated by the ideal of constant S-invariant polynomials; that description also requires the exhibited relations to generate the full relation ideal of the character ring, which is not proved. The authors should either prove these equivalences (by computing the relation ideal and its intersection with the ansatz space) or state the completeness claims at the q-series level as an additional assumption.","section":"§2, eq. (18); §5; eqs. (34), (103), (166)"}],"minor_comments":[{"comment":"'In anycase' should read 'in any case'.","section":"§2 (after eq. (18))"},{"comment":"The printed entries are heavily abbreviated, with many q-series coefficients shown only as '...'; the authors should state whether the full polynomials and q-series are available in ancillary files, so that an independent reader can reproduce the admissibility inequalities.","section":"Tables 4–14"},{"comment":"The external corroboration of the G2,1/F4,1 non-existence claims, received from B. Rayhaun and referencing [28,29], plays a substantive role in the conclusions and should be moved into the main text rather than left in a footnote.","section":"§3.3, footnote 11"},{"comment":"The Rogers-Ramanujan discussion would benefit from defining G(q) and H(q) and citing the classical identities, since the connection is otherwise undecidable for a reader who does not already know the Lee-Yang character identities.","section":"§5, eq. (167)"},{"comment":"The notation P^{C}_{c(1)=8k} overloads the symbol C (the seed theory) with the superscript label, which makes passages such as 'for every two-character CFT that we perform in section 2, we find two S-invariant polynomial basis' (Introduction) unnecessarily hard to parse; a consistent notation for the seed and for the extension character would help.","section":"§3.1–3.3"},{"comment":"The argument that the number of S-invariant polynomials equals the number of seed characters 'because any two sets of bases should have the same cardinality' is explicitly speculative (the text says 'perhaps'), and since this is exactly the unproved generation step flagged in the major comments, the sentence should be removed or replaced by a reference to a proof.","section":"§3.4, closing paragraph"}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern lands. The algebraic core of the paper is sound and the honest first-wave caveat is to its credit, but the completeness of the enumeration, for all k, all r, and for the non-existence rulings, depends on two unproved claims: generation of the commensurate S-invariant subring by the discovered P_i, and equivalence of polynomial-level and q-series-level S-invariance on the ansatz space. Both are likely fixable within the paper's scope by finite-group invariant-ring computations (Hilbert/Molien series for the subring, and the intersection of the ansatz space with the relation ideal); if those computations fail, the claims should be restricted to the computed range. I therefore recommend major revision rather than rejection. The external corroboration in footnote 11 should be promoted to the main text, since it is doing real work for the non-existence conclusions."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know: this is a first-wave, character-level study of one-character extensions of tensor products. It does not prove the existence of any new CFT. What it does deliver is a clean algebraic reorganization that lets you write candidate one-character characters in compact closed form up to surprisingly high central charge (c=128 for A1,1), plus the nice explicit identity for the monster character as P1^3 - 744 in Ising characters.\n\nThe algebraic core is transparent and checkable. I spot-checked eq. (22): it evaluates to j^{1/3} with leading coefficient 1 + 248q, as expected. More importantly, all c=24 outputs reproduce the Schellekens list exactly, which is a strong external benchmark. The paper is also honest about its own status: the first-wave caveat is prominent in the introduction, and footnote 11 reports an external result that kills the G2,1/F4,1 admissible characters as CFTs. That is the right level of self-awareness.\n\nThere are two real soft spots. First, the claimed \"S-invariant basis\" is asserted from finite-N data, not proved to generate the full commensurate S-invariant subring. The Diophantine shortcut (8a+6b=N for A1,1, and analogues for the other seeds) is valid only if the discovered P_i generate that ring. For A1,1, P2 itself contains non-commensurate monomials; the object that actually appears in extension characters is P2^4, so the commensurate invariant subring is nontrivial. If a new commensurate S-invariant appears at some higher N, the tables omit valid characters. The paper's caveat protects the step from admissible characters to genuine CFTs, but it does not protect completeness of the character-level enumeration. Second, S-invariance is imposed as a polynomial identity, not as equality of q-series. Once the characters satisfy polynomial relations (P2=2 for A1,1, P3=0 for the Ising model), the polynomial-level condition is strictly stronger, so again the enumeration may be incomplete. Both issues are addressable (a Groebner basis or invariant-theoretic generation proof would settle them), and neither is fatal for the paper's main service.\n\nWho should read this? People working on meromorphic CFTs at c>24, MLDE classifications, or modular constraints on characters. They will find a reusable computational pattern and a set of concrete conjectures. The conjectured infinite series still need CFT-level evidence, but they are the first organized family of candidate characters in a regime with no classification.\n\nMy recommendation: send it to a serious referee. It deserves referee time, though I would expect the referee to ask for a sharper statement—or a proof—about the basis-generation claim before acceptance.","headline":"First-wave but genuinely useful: S-invariant polynomial bases give closed-form candidate characters for one-character extensions at c>24, with the basis-generation claim unproved and the enumeration possibly incomplete.","tokens_in":76641,"tokens_out":2441,"would_cite":true,"duration_ms":26091,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81T40"],"pacs":["11.25.Hf"],"model":"deepseek-v4-flash","headline":"One-character CFT extensions reduce to a small S-invariant basis.","keywords":["one-character CFTs","tensor products","S-invariant polynomials","modular invariance","WZW models","Ising CFT","admissible characters","extension CFTs"],"falsifier":"For $A_{1,1}$ at $c=24$, solve the S-invariance condition directly on the $q$-series of the ansatz; if any S-invariant character with non-negative integer $q$-series coefficients does not match $P_1^3+(-42+p)P_2^4$ for integer $p$, the polynomial basis method is incomplete.","tokens_in":1931,"feed_emoji":"🧮","tokens_out":3998,"duration_ms":140112,"temperature":0.7,"pith_summary":"The paper claims that for tensor powers of certain two- and three-character CFTs, every one-character extension character is a polynomial in a fixed small set of S-invariant polynomials $P_1,P_2,P_3$, and that the possible terms are found by solving a linear Diophantine equation like $8a+6b=N$. This turns the search for one-character CFTs into elementary polynomial algebra and yields closed-form characters at high central charge, including the monster CFT character written as $P_1^3-744$ with $P_1$ built from Ising CFT characters. It also shows that polynomial relations among seed characters make the extension characters elements of a quotient ring, and it uses admissibility to rule out some extension central charges. If correct, the method provides a constructive route to one-character theories beyond $c=24$.","feed_headline":"One-character CFT extensions reduce to a few invariant polynomials","feed_subtitle":"A fixed S-invariant basis computes extension characters at arbitrarily high central charge.","key_machinery":"The machinery is an S-invariant basis: a small set of S-invariant homogeneous polynomials $P_i$ in the seed characters. Because S-invariance is imposed as a polynomial identity, once the characters are expressed in this basis the condition is automatic, and the problem reduces to solving the linear Diophantine equation that matches the degree of a monomial in the $P_i$ with the tensor power $N$. Constant S-invariant polynomials (like $P_2=2$ for $A_{1,1}$) generate the quotient ideal, which is why the final answers are far more compact than the original degree-$N$ polynomials.","core_discovery":"For each seed CFT studied (the [2,0] WZW theories $A_{1,1}$, $A_{2,1}$, $G_{2,1}$, $D_{4,1}$, $F_{4,1}$, $E_{6,1}$, $E_{7,1}$, the Ising model $M(4,3)$, and the infinite classes $D_{r,1}$ and $B_{r,1}$), the paper discovers a basis of S-invariant homogeneous polynomials $P_i$ in the seed characters. Every one-character extension character of $C^{\\otimes N}$ is then a polynomial in these $P_i$, and the allowed monomials are exactly the non-negative integer solutions of a degree equation such as $8a+6b=N$ for $A_{1,1}$. The constant S-invariant polynomials generate the ideal of relations, so the extension characters belong to the quotient ring of the character ring. As examples, the character of the monster CFT is $P_1^3 - 744$ where $P_1$ is the degree-16 S-invariant polynomial of Ising characters, and the paper reproduces all 28 entries of Schellekens' list that are tensor-product extensions. It also rules out extension characters at several low central charges for $G_{2,1}$ and $F_{4,1}$, and conjectures six infinite series of new one-character extension CFTs.","pith_inferences":["The polynomial-level S-invariance condition is stronger than equality of $q$-series when the seed characters obey polynomial relations, so the enumeration of admissible extension characters may be incomplete.","The same basis construction should work for other seed CFTs with rational characters, giving a general algebraic recipe for one-character extensions.","The constant S-invariant polynomials are analogues of classical polynomial relations among modular characters, suggesting hidden character-ring relations for other rational CFTs.","If the conjectured infinite series correspond to genuine CFTs, they would supply infinitely many one-character theories at $c>24$; checking the full CFT data beyond characters is the next step."],"forward_implications":["For each studied seed, one-character extension characters can be written in closed form as polynomials in the $P_i$ at arbitrarily high central charge.","The monster CFT character is explicitly $P_1^3-744$ with $P_1$ a degree-16 S-invariant polynomial of Ising characters.","The method reproduces the known $c=24$ one-character CFTs that arise as tensor-product extensions, validating the approach at the classified central charge.","For $G_{2,1}$ and $F_{4,1}$, several low central charges admit no admissible extension character, so those extensions are ruled out.","The conjectured six and four infinite series of one-character extensions provide testable targets for future CFT classification at $c>24$."],"supporting_citations":[{"why":"Supplies the list of 71 $c=24$ CFTs used to identify which admissible characters correspond to genuine CFTs.","marker":"[19]"},{"why":"Provides the classification of two-character admissible characters that defines the two-character WZW seeds.","marker":"[9]"},{"why":"Completes the two-character classification, giving the comparison between admissible characters and actual CFTs.","marker":"[10]"},{"why":"Classifies the three-character admissible characters used as seeds.","marker":"[22]"},{"why":"Contributes to the classification of three-character admissible characters used in the paper.","marker":"[23]"},{"why":"Provides the theta-function $q$-series of $D_{r,1}$ and $B_{r,1}$ characters used in the infinite-class computations.","marker":"[3]"},{"why":"Identifies $D_{r,1}$ and $B_{r,1}$ as three-character CFTs, making them valid seeds.","marker":"[27]"},{"why":"Reports that no meromorphic extension of $G_{2,1}$ or $F_{4,1}$ tensor powers exists, which the paper uses to interpret its exclusion results.","marker":"[28]"}],"fun_headline_variants":["S-invariant bases simplify tensor product CFT extensions","Monster CFT character from Ising invariant polynomial","Quotient ring method yields new one-character CFT series","28 Schellekens tensor-product CFTs from one invariant basis","Six new infinite series of one-character CFTs conjectured"],"cache_read_input_tokens":78464,"weakest_assumption_plain":"The enumeration assumes that imposing S-invariance as a polynomial identity in the character ring is equivalent to imposing it on the $q$-series, which is only true when the character ring has no polynomial relations; if relations exist, the polynomial condition is stronger and may miss valid extension characters.","fun_headline_variants_meta":{"raw":{"variants":["S-invariant bases simplify tensor product CFT extensions","Monster CFT character from Ising invariant polynomial","Quotient ring method yields new one-character CFT series","28 Schellekens tensor-product CFTs from one invariant basis","Six new infinite series of one-character CFTs conjectured"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00122,"raw_usage":{"total_tokens":5128,"prompt_tokens":1163,"completion_tokens":3965,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":779,"completion_tokens_details":{"reasoning_tokens":3881}},"tokens_in":779,"tokens_out":3965,"duration_ms":35326,"temperature":1.0,"reasoning_tokens":3881,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T16:21:55.010446+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $A_{1,1}$ at $c=24$, solve the S-invariance condition directly on the $q$-series of the ansatz; if any S-invariant character with non-negative integer $q$-series coefficients does not match $P_1^3+(-42+p)P_2^4$ for integer $p$, the polynomial basis method is incomplete.","supporting_citations":[{"cited_title":"On the Classification of Rational Conformal Field Theories,","cited_arxiv_id":null,"evidence_quote":"Provides the classification of two-character admissible characters that defines the two-character WZW seeds."},{"cited_title":"Reconstruction of Conformal Field Theories From Modular Geometry on the Torus,","cited_arxiv_id":null,"evidence_quote":"Completes the two-character classification, giving the comparison between admissible characters and actual CFTs."},{"cited_title":"Conformal Field Theory,","cited_arxiv_id":null,"evidence_quote":"Provides the theta-function $q$-series of $D_{r,1}$ and $B_{r,1}$ characters used in the infinite-class computations."},{"cited_title":"Commutative algebras in Fibonacci categories,","cited_arxiv_id":null,"evidence_quote":"Reports that no meromorphic extension of $G_{2,1}$ or $F_{4,1}$ tensor powers exists, which the paper uses to interpret its exclusion results."}],"review_version":1}