{"id":"3158a2d8-5d33-4263-a48c-6fd51918ecca","arxiv_id":"2607.14848","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"In symmetric association schemes, matrix-product factorizations A_S A_T = A_U are characterized by spectral subset-sum conditions; rigidity forces the universal pentagon case to be the 5-cycle, and Hamming schemes admit no nontrivial factorization of the studied form.","lead":"This paper studies when the product of two 0-1 adjacency matrices inside a symmetric association scheme is again a 0-1 adjacency matrix, giving spectral and rank tests and classifying the possible cases in several standard families. It proves a pentagon rigidity theorem: a product equal to the complete graph without loops forces the scheme to be the 5-cycle.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Abstract's 'universal pentagon theorem' omits the S∪T={1..d} partition hypothesis; without it the claim is false (C17 cyclotomic MPF has A_S A_T=J-I on v=17).","rationale":"The reader's weakest_assumption (spectral criterion requires commutativity/semisimplicity) is not the load-bearing issue: symmetric association schemes satisfy it, and Section 5 explicitly treats noncommutative configurations separately. I also checked the proof of Theorem 8.1: given S∪T={1,...,d}, the derivation of A_S^2, the SRG parameter equation, and the conclusion v=5 are sound. The real problem is the gap between the abstract's 'universal pentagon theorem for A_S A_T=J-I' and the theorem's partition hypothesis. The paper itself contains a counterexample to the unqualified claim, so this is not a matter of consensus but of internal consistency of the advertised result. The body is salvageable with a corrected abstract and introduction, hence CONDITIONAL rather than REJECT.","tokens_in":14959,"tokens_out":34475,"duration_ms":268815,"concrete_test":"Use a CAS (or hand calculation in Z[C17]) to recompute the product in Example 4.3: let C0={1,4,16,13} and C1={2,8,15,9} as exponent sets for powers of a generator g of C17, and multiply the two group-ring elements. Check that each g^i (1≤i≤16) occurs exactly once and g^0 does not occur. If this confirms B0B1=J-I, the abstract's unqualified pentagon statement is false and the abstract/introduction must be revised to include the partition hypothesis S∩T=∅, S∪T={1,...,d}.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Location: Abstract and Theorem 8.1. The abstract promises 'a universal pentagon theorem for the case A_S A_T=J-I.' The theorem actually proved in Section 8 requires S∩T=∅ and S∪T={1,...,d}; this is what makes A_S+A_T=J-I and lets the two-class fusion argument go through. Without the partition hypothesis the claim is not just unproved but false. Example 4.3 already in the paper: in the symmetric cyclotomic fusion of C17 with classes C0={g,g^4,g^{-1},g^{-4}} and C1={g^2,g^8,g^{-2},g^{-8}}, the group-ring product C0*C1 equals Σ_{i=1}^{16} g^i. Therefore B0B1=J-I on v=17, while S={0}, T={1} do not partition the four nontrivial classes and v≠5. The theorem as stated in the body is correct; the soft spot is the advertised statement, which is materially overbroad and should be amended.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies exact matrix-product factorizations (MPFs) in symmetric association schemes: identities A_S A_T = A_U in which the ordinary product of two 0-1 unions of basic relations is again a 0-1 union. After giving structural and spectral criteria (Propositions 2.2 and 2.4), the authors derive valency and rank restrictions (Corollary 2.5, Theorems 6.1 and 6.2), classify MPFs in 2-class schemes (Theorem 3.1), in distance-regular/P-polynomial settings (Theorem 4.1), in Hamming schemes (Theorems 6.5 and 6.7), and in translation/cyclotomic schemes (Theorems 7.4 and 7.7). The centerpiece is Theorem 8.1, which shows that if the nonidentity relations are partitioned into two nonempty sets S,T and A_S A_T = J-I, then the scheme must be the 2-class scheme of the 5-cycle.","tokens_in":15243,"tokens_out":15401,"duration_ms":114520,"significance":"The paper's criteria are clean and useful: the spectral test reduces MPF existence to a subset-sum condition on the first eigenmatrix, and the valency/rank obstructions apply broadly. If the main results stand, the paper makes a solid contribution to algebraic combinatorics, with concrete consequences for strongly regular graphs, distance-regular graphs, and Hamming schemes. The proof of Theorem 8.1 is elegant and self-contained, and the Hamming classification is complete. The paper also gives several worked examples, though some are asserted rather than displayed. The central derivations are rigorous and the main theorems are correctly stated in the body; the main weakness is an overbroad claim in the abstract.","major_comments":[{"comment":"The abstract advertises 'a universal pentagon theorem for the case A_S A_T = J-I'. The theorem actually proved in Section 8 requires the additional hypotheses S∩T=∅ and S∪T={1,...,d}; without them the statement is false. Indeed, Example 4.3 already contains a counterexample: in the C17 cyclotomic fusion with four nontrivial classes, the product of two basic classes equals the sum of all four nonidentity classes, so A_S A_T=J-I on v=17 while v≠5. The theorem in the body is correct, but the advertised statement is materially overbroad. Please qualify the abstract by stating the partition hypothesis explicitly, and optionally add a remark noting that the hypothesis is necessary.","section":"Abstract and Theorem 8.1"}],"minor_comments":[{"comment":"The assertion that the L2(17) graph has the stated intersection array and satisfies A_1 A_5 = A_4+A_5+A_6 is not accompanied by a calculation or a precise reference to the table entry. Since the example is used to show that case (ii) of Theorem 4.1 occurs, please provide the intersection-array verification or a full reference to the Brouwer table.","section":"Section 4, Example 4.2"},{"comment":"The 'direct calculation in ZG' that C0 C1 = C0+C2+C5+C6 is not shown. Given that this example is a central illustration of the cyclotomic MPF phenomenon, please include the cyclotomic-number computation or a reference to a verifiable table/reproducible code.","section":"Section 7, Example 7.8"},{"comment":"The multiplication identities for the coherent configuration of Sym(4) on the cosets of a subgroup of order 2 (e.g., A2A3=A4+A5) are stated without verification. Please provide the double-coset multiplication table or an explicit description that allows the reader to check these products.","section":"Section 5, Example 5.2"},{"comment":"The definition allows U⊆{1,...,d}, and later the paper uses the empty sum A_∅=0. It would help to state explicitly that U may be empty and that the zero matrix is allowed as an MPF output, to avoid ambiguity in statements like '0<U' in Remark 2.6.","section":"Section 2, Definition 2.1"},{"comment":"There is a stray 'B' in the definition of cyclotomic numbers: '(a,b)_N B |(C_a+1)∩C_b|'. Please remove it.","section":"Notation 7.6"}],"recommendation":"minor_revision","confidential_remarks":"The paper is mathematically sound in its main theorems; my only substantive concern is the abstract's overstatement of Theorem 8.1, which is easily fixed by stating the partition hypothesis. The computational examples are not fully verified, but they are illustrative rather than load-bearing. I recommend minor revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take after reading it. The paper is a genuinely useful addition to the MPF literature. The main new contributions are the spectral criterion (Proposition 2.4) turning MPF existence into a subset-sum condition on the first eigenmatrix, the classification of 2-class schemes (only the 5-cycle gives a nontrivial loopless MPF), the DRG restrictions, the rank method leading to the bipartiteness result (Theorem 6.2), and the Hamming classifications. The proofs are careful and check out; the use of standard Bose-Mesner algebra is clean. I also appreciate the connection to cyclotomic schemes and near-factorizations—that gives real examples and context.\n\nThe one serious flaw is in the abstract, not the math. It advertises 'a universal pentagon theorem for the case A_S A_T = J-I.' Theorem 8.1 actually requires that S and T partition the nontrivial classes. That hypothesis is essential: Section 4's own Example 4.3 gives A_S A_T = J-I on 17 vertices from a cyclotomic fusion where S and T are two of four nontrivial classes, so v=5 is plainly false without the partition condition. The body's theorem is correct; the abstract just overstates it. That's a fixable problem, but an editor should catch it.\n\nMinor issues: the computational claims in Example 4.2 (the L2(17) DRG) and Example 7.8 (F29 cyclotomic) are asserted without code or displayed arithmetic. I'd ask the authors to either supply an appendix or a brief verification, or mark them as checked by hand. Also Section 5 on homogeneous coherent configurations is a bit of a side trip; it doesn't feed the main theorems, though the non-commutative examples are nice. The self-citations are not a problem—the proofs here are self-contained.\n\nOverall: this deserves serious peer review. A competent referee can clean up the abstract and verify the examples; the core results are solid. It's aimed at algebraic combinatorics people working on association schemes, distance-regular graphs, and graph factorizations. I'd bring it to reading group and cite it if I work in that area.","headline":"Solid and valuable paper on MPFs in association schemes; the body is rigorous, but the abstract's universal pentagon claim is false as stated and needs the partition hypothesis from Theorem 8.1.","tokens_in":15689,"tokens_out":2651,"would_cite":true,"duration_ms":21008,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E30","05C50"],"pacs":[],"model":"deepseek-v4-flash","headline":"A complementary product identity forces the 5-cycle scheme","keywords":["matrix product factorization","association schemes","Bose-Mesner algebra","strongly regular graphs","distance-regular graphs","Hamming schemes","pentagon theorem","rank bounds"],"falsifier":"Find a symmetric association scheme on v≥6 vertices with nonempty disjoint S,T, S∪T={1,...,d}, and A_S A_T = J-I. Theorem 8.1 asserts no such scheme exists; a single counterexample would falsify it. Alternatively, a 2-class scheme with parameters (v,k,λ,μ) satisfying the eigenvalue equations of the 5-cycle but with v>5 would falsify Theorem 3.1.","tokens_in":14870,"feed_emoji":"⭕","tokens_out":5266,"duration_ms":42491,"temperature":0.7,"pith_summary":"This paper studies matrix product factorizations (MPFs) in symmetric association schemes: identities where the product of two loopless unions of relations is again a 0-1 adjacency matrix. It provides two equivalent tests for when this happens, one in terms of intersection numbers and one in terms of the scheme's eigenmatrix. Using these tests, the authors show that in 2-class schemes the only nontrivial loopless MPF forces the scheme to be that of the 5-cycle. Their main rigidity result shows that if complementary nonempty relation sets multiply to J-I, then necessarily v=5 and the two factors are complementary 5-cycles. They also derive rank and valency bounds, and apply them to Hamming schemes, where almost no nontrivial MPFs occur.","feed_headline":"Complementary factors that multiply to J-I must be 5-cycles","feed_subtitle":"New criteria show the 5-cycle is the unique scheme where complementary relations multiply to J-I.","key_machinery":"The Bose-Mesner algebra of the scheme, with its basis of adjacency matrices A_0,...,A_d and primitive idempotents E_h, carries the argument. The spectral test turns an MPF into a subset-sum factorization on the columns of the first eigenmatrix P: the Hadamard product of the indicator vectors of S and T must be the indicator vector of U. Alongside this, the intersection-number coefficients c_k give a purely combinatorial criterion. The rank arguments rest on the elementary inequality Rank(ASAT) ≤ min(Rank(AS), Rank(AT)) and the trace identity trace(A_U^2)=v k(U) for a k(U)-regular graph, which yields the lower bound Rank(A_U) ≥ v/k(U).","core_discovery":"The paper establishes that, in a symmetric association scheme, a matrix product factorization A_S A_T = A_U is equivalent to the coefficient test c_k = sum_{i∈S,j∈T} p^k_{ij} ∈ {0,1} for all k≥1 with c_0=0, and equivalently to the eigenvalue identity λ_h(S)λ_h(T)=λ_h(U) for every primitive idempotent. The strongest structural consequence is Theorem 8.1: if S and T partition the nonidentity relations and A_S A_T = J-I, then the scheme has 5 vertices and A_S, A_T are the adjacency matrices of complementary 5-cycles. The paper also proves a rank bound showing that the extremal case Rank(A_U)=v/k(U) forces all nonzero eigenvalues of A_U to be ±k(U), hence the graph is bipartite. For Hamming sche","pith_inferences":["The eigenmatrix subset-sum characterization suggests that MPF existence can be studied as an additive combinatorics problem on the rows of P, potentially connecting to zero-sum or partition problems in abelian groups when the scheme is translation-based.","The pentagon theorem might have a directed analogue in homogeneous coherent configurations: the non-commutative examples in the paper show products can be 0-1 there, but the complementary J-I case may impose order-5 structures or other small parameters; this is a natural next question.","The rank lower bound Rank(A_S) ≥ v/k(U) could be sharpened for specific schemes; for instance, in cyclotomic schemes the rank of a union is related to character sums, so MPF obstructions could be translated into character-sum inequalities.","One could test whether the trivial MPF A_1 A_d = A_{d-1} in H(d,2) is the only MPF at all in binary Hamming schemes beyond the obvious valency-1 cases; the paper only classifies the A_1 A_T form."],"forward_implications":["For any symmetric association scheme, testing whether a product of two unions is an MPF reduces to checking the discrete subset-sum condition on the eigenmatrix, so MPF existence is decidable in finite time from the scheme's parameters.","The universal pentagon theorem means that the only way two complementary relation sets can multiply to the complete graph minus loops is the 5-cycle; no larger scheme exhibits this complementary factorization.","In distance-regular graphs, the three-term recurrence restricts A_1 A_i to a short list of possibilities; when the product is a single distance relation, valency 2 is forced, so the graph is a cycle.","The triviality of MPFs in Hamming schemes H(d,2) and their absence for q>2 imply that Hamming graphs cannot support nontrivial two-step uniqueness of the form A_1 A_T = A_U.","The rank extremality result shows that if an MPF output achieves the minimum possible rank v/k(U), the output graph is bipartite with all nonzero eigenvalues equal to ±k(U), linking MPFs to bipartite spectral structure."],"fun_headline_variants":["Complementary relations to J-I: only 5-cycles","Five-cycle scheme uniquely solves complementary MPF","Extremal rank in MPFs forces bipartite graphs","No nontrivial loopless MPFs in Hamming schemes","MPF equivalence: coefficient test and eigenvalues"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The spectral criterion that underpins the classification requires the Bose-Mesner algebra to be commutative and semisimple (true for symmetric association schemes); if the scheme is not symmetric, or the algebra fails semisimplicity, the eigenvalue test and the pentagon theorem no longer apply.","fun_headline_variants_meta":{"raw":{"variants":["Complementary relations to J-I: only 5-cycles","Five-cycle scheme uniquely solves complementary MPF","Extremal rank in MPFs forces bipartite graphs","No nontrivial loopless MPFs in Hamming schemes","MPF equivalence: coefficient test and eigenvalues"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000803,"raw_usage":{"total_tokens":3399,"prompt_tokens":809,"completion_tokens":2590,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":553,"completion_tokens_details":{"reasoning_tokens":2513}},"tokens_in":553,"tokens_out":2590,"duration_ms":17573,"temperature":1.0,"reasoning_tokens":2513,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T00:53:29.308327+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find a symmetric association scheme on v≥6 vertices with nonempty disjoint S,T, S∪T={1,...,d}, and A_S A_T = J-I. Theorem 8.1 asserts no such scheme exists; a single counterexample would falsify it. Alternatively, a 2-class scheme with parameters (v,k,λ,μ) satisfying the eigenvalue equations of the 5-cycle but with v>5 would falsify Theorem 3.1.","supporting_citations":[],"review_version":1}