{"id":"b32955d7-2873-4904-b0e1-56c39525412b","arxiv_id":"2411.15890","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Mates in near-factorizations are unique and explicitly computable, and nontrivial near-factorizations are shown not to exist in noncyclic abelian groups below order 200.","lead":"This paper proves that in a near-factorization of a finite group, once one factor A is fixed, the other factor B is uniquely determined and can be computed from a simple matrix formula. It uses this to push exhaustive nonexistence evidence for near-factorizations in noncyclic abelian groups from order 100 to 200, and to give a short new proof of a known result about circular difference families.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Table omissions at orders 64 and 100 are covered by Theorems 3.3-3.5; the real load-bearing concern is that several nonexistence claims rest on undocumented exhaustive computer searches whose correctness cannot be checked.","rationale":"The paper has two headline results: (1) uniqueness of mates via matrix inversion, and (2) nonexistence of nontrivial near-factorizations in all noncyclic abelian groups of order < 200. Result (1) is proved cleanly. Theorem 1.4 derives Y = (1/r)J - X^{-1} from XJ = rJ and invertibility of X, which follows from XY = J - I because det(J - I) is nonzero. Algorithm 2's linear system correctly recovers the first column of M(B), and the SCEDF application is correct after accounting for inverses of the difference-family identity. Result (2) is where the risk lies. I checked the reader's flagged missing groups and found no actual gap: Z8 x (Z2)^3 has quotient (Z2)^4, so Theorem 3.3 forces |A| >= 15, impossible for (7,9); (Z4)^2 x (Z2)^2 is covered by Theorem 3.4; and Z4 x (Z5)^2 has quotient (Z5)^2, so Theorem 3.5 requires |A|^4 == 1 mod 25, which fails for both 9 and 11. Hence the table omissions are cosmetic, not mathematical. However, the paper marks more than a dozen (n, G, r, s) cases as exhaustive computer search without shipping code, search scripts, or even aggregate counts. Since the claimed theorem is a universal negative over these groups, a single bug in enumeration or a missing automorphism orbit could break it. This is a standard reproducibility condition for computational nonexistence claims, so I retain the CONDITIONAL verdict. The concrete test above would settle it by independent reimplementation or by requiring the authors to provide machine-checkable artifacts.","tokens_in":17537,"tokens_out":21345,"duration_ms":165649,"concrete_test":"Request the authors' search code and run logs for the exhaustive cases, or independently re-implement the search for one representative case, e.g., G = Z47 x (Z2)^2, n = 188. Using Section 2.2, candidate B must have sizes (3,3,3,2) in the four cosets of Z47; enumerate all such symmetric B with GL(2,2) orbit reduction and run Algorithm 2 on each to check for a mate A. If the independent run finds no near-factorization for this case and for Z17 x (Z3)^2 (n = 153, r = 8), the computational claim is supported; if it finds one, the headline conclusion is false.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The mathematical core (Theorem 1.5, Algorithm 2, SCEDF proof) is sound. The reader's weakest assumption, the incomplete Table 1, is factual but not fatal: the missing groups Z8 x (Z2)^3 and (Z4)^2 x (Z2)^2 of order 64 are ruled out by quotient H = (Z2)^4 via Theorem 3.3 and by Theorem 3.4 respectively, and Z4 x (Z5)^2 of order 100 is ruled out by Theorem 3.5 with p = 5, m = 2 (9^4 mod 25 = 11, 11^4 mod 25 = 16). The genuinely load-bearing gap is the reproducibility of the exhaustive searches reported for n = 116, 136, 148, 153, 156, 171, 172, 175, 176, 188, and 196. The paper gives Algorithm 2 but no code, no search counts, no logs, and only partial orbit analyses; for groups such as Z17 x (Z3)^2 (n = 153), the Section 2.2 structural reduction does not even apply. A single overlooked orbit or pruning error would invalidate the 'no nontrivial near-factorization below 200' headline. Thus the central nonexistence claim is conditional on the correctness of unspecified computer runs.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies near-factorizations (A,B) of finite groups, where AB = G \\ {e} and |A||B| = |G|-1. Its main theoretical result is Theorem 1.5: the mate B of a given set A is unique; this follows from the matrix formula M(B) = (1/r)J - M(A)^{-1} (Theorem 1.4). The authors use this to give Algorithm 2, which computes a mate by solving one sparse linear system instead of searching over all candidates B. They then give an alternative proof of a theorem of Wu, Yang and Feng that strong circular external difference families cannot have more than two sets, by applying the uniqueness theorem. They prove structural constraints on near-factorizations in groups of the form Z_t × (Z2)^2, and they report a complete case analysis for all noncyclic abelian groups of order less than 200, claiming that no nontrivial near-factorization exists in any of them, using a combination of earlier theorems and exhaustive computer searches. Finally, they exhibit several index-2 near-factorizations in noncyclic abelian groups.","tokens_in":17791,"tokens_out":7355,"duration_ms":59116,"significance":"If correct, this is a useful contribution to the study of near-factorizations. The uniqueness theorem (Theorem 1.5) and the explicit formula (Theorem 1.4) are clean and conceptually important, because they turn a combinatorial search for a mate into a single matrix inversion or sparse linear solve; this is a genuinely valuable algorithmic observation. The alternate proof of the SCEDF nonexistence theorem is elegant and more direct than the group-ring proof in the literature. The structural analysis for Z_t × (Z2)^2 and the systematic table of nonexistence results for all noncyclic abelian groups below order 200, if fully verified, substantially extend the known nonexistence range from order 100 to order 200. However, a significant part of the central nonexistence claim rests on computer searches whose details are not given, so the paper's contribution is stronger as a theoretical/methodological one than as a fully checkable computational result.","major_comments":[{"comment":"The authority 'exhaustive computer search' is the sole basis for ruling out the parameter sets listed for n = 116, 136 (two rows), 148, 153, 156, 171, 172, 175, 176, 188, and 196 (two rows). The manuscript gives no code, no scripts, no search counts, no orbit representatives, and no description of the pruning rules beyond the partial analysis in Sections 2.1 and 2.2. For example, the n = 153 row (G = Z17 × (Z3)^2, (r,s) = (8,19)) is not covered by the structural reduction of Section 2.2, so it is not clear how the search space was reduced to a verifiable size. Since these searches are load-bearing for the headline claim that no nontrivial near-factorization exists in any noncyclic abelian group of order less than 200, the paper should supply a complete, reproducible description of each search: the exact enumeration strategy, the number of candidate A-sets (or orbit representatives) tested, and the verification procedure. Without this, the central computational conclusion cannot be independently checked.","section":"Section 3, Table 1"}],"minor_comments":[{"comment":"The sentence 'All the noncyclic abelian groups of order at most 200 are listed in Table 1' is not accurate as printed: the table omits Z8 × (Z2)^3 and (Z4)^2 × (Z2)^2 of order 64 and Z4 × (Z5)^2 of order 100. These groups are in fact covered by the cited theorems (Theorem 3.3 for Z8 × (Z2)^3, Theorem 3.4 for (Z4)^2 × (Z2)^2, and Theorem 3.5 for Z4 × (Z5)^2), so the nonexistence conclusion is not affected, but the table's completeness statement and the table itself need to be corrected.","section":"Section 3, Table 1"},{"comment":"The assertion near equations (5)-(8) that these equations are satisfied 'if and only if' the exceptional index for which a_{i,j} = (r+3)/4 coincides with the exceptional index for which b_{i,j} = (s-3)/4 is stated without proof; since this fact is used to accelerate the search in Example 2.1, a short verification should be supplied.","section":"Section 2.2"},{"comment":"The sentence 'we have not found any (r,s,2)-near-factorizations in noncyclic abelian groups of even order' is imprecise: the paper should state the exact groups and parameter ranges that were searched and whether those searches were exhaustive, so the reader can interpret this observation correctly.","section":"Section 5"},{"comment":"The section heading contains a typo: 'Discusion' should be 'Discussion'.","section":"Section 6"}],"recommendation":"major_revision","confidential_remarks":"The theoretical core of the paper is sound and genuinely useful, and the nonexistence result below order 200 is plausible. My main concern is the reproducibility of the exhaustive computer searches that support a large portion of Table 1. If the authors can provide code or a detailed audit trail, I would be willing to accept the paper; as it stands, however, the central computational claim is not fully verifiable from the manuscript. The other issues are minor and local."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Kreher, Martin, and Stinson give a clean linear-algebra characterization of near-factorizations: if X=M(A), then any mate satisfies M(B)=(1/r)J - X^{-1}. So a mate is unique, and you can compute it by inverting one sparse matrix. They are upfront (Remark 1.1) that uniqueness follows from de Caen et al.'s proof; the contribution is the explicit formula and the resulting algorithm. That is the genuinely new and useful part.\n\nThe paper also does several things well. Algorithm 2 turns the mate search into solving a sparse linear system, a real speedup over brute-force search for B. The alternate proof of the SCEDF nonexistence result is short and transparent. The structural analysis for Z_t × (Z2)^2 is a nice reduction, and the index-2 examples in Table 3 are concrete and checkable.\n\nThe soft spots are mostly about reproducibility. The headline claim—no nontrivial near-factorization in a noncyclic abelian group of order < 200—leans on several exhaustive computer searches (n = 116, 136, 148, 153, 156, 171, 172, 175, 176, 188, 196). The paper gives Algorithm 2 and some orbit reductions, but no code, no search counts, no logs. For some of those groups, e.g. Z17 × (Z3)^2, the structural reduction of Section 2.2 doesn't apply, so the search is essentially brute force over symmetric A. That is a real gap: a single pruning mistake would invalidate the headline. The authors should provide code or at least detailed search statistics.\n\nThe reader's worry about Table 1 omitting groups of orders 64 and 100 is less serious than it looks. The omitted groups are covered by the stated theorems: Z8 × (Z2)^3 and (Z4)^2 × (Z2)^2 are ruled out via quotient (Z2)^4/Theorem 3.3 or Theorem 3.4, and Z4 × (Z5)^2 is ruled out by Theorem 3.5 with p=5, m=2. So that is a minor presentational issue, not a flaw.\n\nThe math that is actually written down is correct and clearly derived. The paper deserves a serious referee. I would send it out, but ask the authors to make the computational part verifiable—code or logs—before accepting.","headline":"Clean, honest paper: the unique-mate formula and the sparse-system algorithm are real contributions; the sub-200 nonexistence claim rests on computer searches that need documentation before the full claim is checkable.","tokens_in":18369,"tokens_out":3928,"would_cite":true,"duration_ms":32984,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05B10"],"pacs":[],"model":"deepseek-v4-flash","headline":"In a near-factorization of a finite group, the mate of a set is unique and can be computed directly from a matrix formula.","keywords":["near-factorization","mate uniqueness","noncyclic abelian groups","incidence matrix","strong circular external difference families","exhaustive computer search","index lambda near-factorization"],"falsifier":"Apply Algorithm 2 to the three groups absent from Table 1, namely Z8×(Z2)^3, (Z4)^2×(Z2)^2, and Z4×(Z5)^2. If any symmetric candidate set A yields a 0-1 solution z to M(A)z=(0,1,...,1)^T with |A| times the Hamming weight of z equal to |G|-1, then a nontrivial near-factorization exists and the paper's exhaustive nonexistence claim for order below 200 fails.","tokens_in":17297,"feed_emoji":"🧮","tokens_out":7996,"duration_ms":65601,"temperature":0.7,"pith_summary":"The paper establishes that, in a near-factorization of a finite group, a given subset can have at most one 'mate,' and that the mate, when it exists, can be read off directly from a formula rather than found by search. A near-factorization is a pair of subsets (A,B) whose pairwise products cover every nonidentity group element exactly once. Writing M(A) for the |G|×|G| incidence matrix of A, the paper shows the mate's incidence matrix must equal (1/|A|)J - M(A)^{-1}, where J is the all-ones matrix; this identity both proves uniqueness and makes the mate computable by one matrix inversion or one sparse linear solve. The authors then use this machinery to rule out nontrivial near-factorizations in every noncyclic abelian group of order below 200, to give a short proof that a strong circular external difference family (a collection of disjoint subsets with prescribed differences between consecutive sets) has at most two sets, and to exhibit index-2 near-factorizations in some noncyclic abelian groups.","feed_headline":"Mates in near-factorizations are unique","feed_subtitle":"A direct matrix formula computes the mate; exhaustive searches up to order 199 find no nontrivial counterexamples.","key_machinery":"The load-bearing object is the incidence matrix M(H) defined by M(H)_{i,j}=1 when $g_i^{{-1}}$g_j is in H. The key identity is the characterization M(A)M(B)=J-I for near-factorizations, which the paper combines with the row-sum identity M(A)J=|A|J to force the unique formula M(B)=(1/|A|)J-M(A)^{-1}. All later results, including the nonexistence of strong circular external difference families with more than two sets and the exhaustive nonexistence searches, hang on this matrix identity.","core_discovery":"For a finite group G with identity e, subsets A and B form a near-factorization when |A||B|=|G|-1 and the products ab with a in A and b in B are exactly G\\{e}. The central discovery is that the mate is unique: if M(A)M(B)=J-I encodes the near-factorization condition, then invertibility of M(A), which has constant row sum |A|, forces M(B)=(1/|A|)J-M(A)^{-1}. The paper presents two algorithms based on this identity: one computes the explicit inverse, and the other solves the sparse linear system M(A)z=(0,1,...,1)^T and recovers B from the positions where z has a 1. Using these algorithms together with structural reductions, all noncyclic abelian groups of order less than 200 are checked for nontrivial near-factorizations, and none is found.","pith_inferences":["If Table 1 is truly exhaustive, the natural conjecture is that nontrivial near-factorizations do not exist in noncyclic abelian groups; the index-2 examples show the analogous statement for lambda>1 is false.","The same matrix formula likely extends to index lambda>1, giving M(B)=(lambda/|A|)J-M(A)^{-1} whenever M(A) is invertible, which would make systematic searches for higher-index examples inexpensive.","The three group orders missing from the printed Table 1 are the first thing to check before relying on the 'all order below 200' conclusion; if any of those groups admits a near-factorization, the exhaustive claim is incomplete."],"forward_implications":["If a set A has a mate in a near-factorization, that mate is unique; no second set can realize the same A.","Computing the mate becomes a direct algebraic computation rather than a search over all possible subsets B of the right size.","The uniqueness statement yields a short proof that a strong circular external difference family cannot contain more than two sets.","No noncyclic abelian group of order less than 200 admits a nontrivial near-factorization, according to the paper's theoretical and computer-assisted enumeration.","Noncyclic abelian groups do admit near-factorizations with index lambda=2, with several explicit examples of the form (4,s) listed in the paper."],"supporting_citations":[{"why":"Gives the matrix characterization M(A)M(B)=J-I and many of the nonexistence results that the paper extends.","marker":"[3]"},{"why":"Supplies earlier exhaustive and theoretical nonexistence results for specific abelian groups that Table 1 builds on.","marker":"[10]"},{"why":"Provides the strong circular external difference family nonexistence theorem, for more than two sets, that the paper reproves using the uniqueness formula.","marker":"[14]"},{"why":"Supplies the quadratic-residue construction that yields near-factorizations of index lambda>1 in elementary abelian groups.","marker":"[6]"}],"fun_headline_variants":["Unique mate in near-factorizations: explicit formula","Near-factorization mates: uniqueness and fast computation","Explicit mate formula proves uniqueness in near-factorizations","Mates in near-factorizations are unique and computable","No nontrivial near-factorizations in noncyclic abelian groups under 200"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The exhaustive claim that no noncyclic abelian group of order below 200 has a nontrivial near-factorization rests on the completeness of Table 1; as printed, that table omits the order-64 groups Z8×(Z2)^3 and (Z4)^2×(Z2)^2 and the order-100 group Z4×(Z5)^2, so the conclusion only holds if those groups are covered by cited theorems or performed searches.","fun_headline_variants_meta":{"raw":{"variants":["Unique mate in near-factorizations: explicit formula","Near-factorization mates: uniqueness and fast computation","Explicit mate formula proves uniqueness in near-factorizations","Mates in near-factorizations are unique and computable","No nontrivial near-factorizations in noncyclic abelian groups under 200"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001102,"raw_usage":{"total_tokens":4582,"prompt_tokens":913,"completion_tokens":3669,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":529,"completion_tokens_details":{"reasoning_tokens":3588}},"tokens_in":529,"tokens_out":3669,"duration_ms":23950,"temperature":1.0,"reasoning_tokens":3588,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:48:08.683926+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Apply Algorithm 2 to the three groups absent from Table 1, namely Z8×(Z2)^3, (Z4)^2×(Z2)^2, and Z4×(Z5)^2. If any symmetric candidate set A yields a 0-1 solution z to M(A)z=(0,1,...,1)^T with |A| times the Hamming weight of z equal to |G|-1, then a nontrivial near-factorization exists and the paper's exhaustive nonexistence claim for order below 200 fails.","supporting_citations":[{"cited_title":"de Caen, D.A","cited_arxiv_id":null,"evidence_quote":"Gives the matrix characterization M(A)M(B)=J-I and many of the nonexistence results that the paper extends."},{"cited_title":"Pˆ echer","cited_arxiv_id":null,"evidence_quote":"Supplies earlier exhaustive and theoretical nonexistence results for specific abelian groups that Table 1 builds on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the strong circular external difference family nonexistence theorem, for more than two sets, that the paper reproves using the uniqueness formula."},{"cited_title":"Huczynska and M.B","cited_arxiv_id":null,"evidence_quote":"Supplies the quadratic-residue construction that yields near-factorizations of index lambda>1 in elementary abelian groups."}],"review_version":1}