{"id":"ba1277a1-330d-49fd-99e6-c76cfb7b873f","arxiv_id":"2607.12448","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"For k≥2, the semi-perimeter generating function of k-convex polyominoes is conjectured to be a difference of a rational part and a square-root part, with both expressed explicitly in Chebyshev polynomials.","lead":"This paper reports a conjectured formula for counting k-convex polyominoes, connected square shapes whose cells can be joined by internal paths with at most k bends, by semi-perimeter. The formula unifies previously known L-convex, Z-convex and fully convex cases and is obtained from computer-generated enumeration data.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 4-tuple state in the transfer-matrix algorithm is asserted sufficient without proof; if minimum-bend paths require keeping suboptimal crossing alternatives, the enumeration data and the conjectured Q_k are invalid.","rationale":"The reader's verdict of CONDITIONAL is appropriate. The paper is transparent in labeling the result a conjecture, and the internal checks (k=2..7 fits, k→∞ limit) are suggestive. However, the foundation is the enumeration data, and the transfer-matrix algorithm's correctness is asserted rather than proved. I identify the same weakest assumption as the reader: the sufficiency of the per-site tuple for determining k-convexity. My specific concern is that the algorithm stores only the best route to the boundary, not the Pareto frontier of (number of lines, crossing height); this could lead to overestimating or underestimating minimum bend counts for pairs of cells separated across multiple columns. The proposed brute-force check for small semi-perimeters would settle whether this flaw actually manifests in practice. Since no such verification is present in the paper, the conditional verdict stands: the k≥2 claim should be explicitly qualified, the k=1 exception acknowledged, and either a rigorous correctness argument for the algorithm or independent confirmation (including k=8 data) supplied before the conjecture can be promoted.","tokens_in":10285,"tokens_out":14715,"duration_ms":141138,"concrete_test":"Independently enumerate all convex polyominoes of semi-perimeter ≤ 12 by brute force; for each polyomino, compute the minimum number of bends between every pair of cells via a standard graph search (e.g., BFS on directed states representing direction and turn count), and compare the resulting k-convex counts for k=2..7 with the published transfer-matrix code. Any discrepancy in the counts would demonstrate that the 4-tuple state loses necessary information and would invalidate the conjectured generating function.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is a closed-form generating function for k-convex polyominoes, derived entirely from enumeration data produced by the transfer-matrix algorithm in Appendix A. The load-bearing premise is that this algorithm exactly computes the minimum number of bends between every pair of cells. Appendix A.3 stores for each site a single tuple (VN, VH, HN, HH), representing the best route to the vertical border to the right of the current column. However, the paper does not prove that one best route per starting orientation suffices. For a future column, the optimal route to a distant cell may require crossing the current border at a height that is not the one used by the minimum-bend route; a route with more bends now but a more favorable crossing height could be globally better. The dominance rule discards sites that are 'always harder', but it does not retain multiple non-dominated routes from the same site. The paper even notes that the dominance check is 'fiddly and error-prone' and that the implementation is not perfect, though it asserts this does not affect correctness. No formal verification or independent cross-check is provided. If the state is insufficient, the counts for every k are wrong, and the conjectured formula—whose p_k, q_k, and d_k were fitted to those counts—collapses. This is not a criticism of the conjecture itself, but of the evidence base supporting it.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper reports a conjectured closed-form generating function Q_k(x) = Q_{1,k}(x) - Q_{2,k}(x) for k-convex polyominoes counted by semi-perimeter. The authors first fit explicit generating functions to enumeration data for k = 3,...,7, then extrapolate recurrences for the polynomials d_k, r_k, p_k to all k and solve them in terms of Chebyshev polynomials. The k→∞ limit is reported to reproduce the known convex-polyomino generating function, and asymptotics for the coefficients are derived. The paper is explicitly computational and conjectural: no proof of the transfer-matrix algorithm or of the recurrences is offered.","tokens_in":10665,"tokens_out":17432,"duration_ms":159878,"significance":"If correct, this result would solve the semi-perimeter enumeration of all k-convex polyominoes and provide exact asymptotics, generalizing the known L-, Z-, and fully convex cases. The paper has several genuine strengths: explicit formulas for k = 3,...,7, internal checks from series coefficients beyond those used for fitting, a consistency check at k→∞, and a publicly available implementation. The main weakness is that the supporting enumeration data are produced by a dynamic-programming algorithm whose correctness is asserted rather than proved, so the empirical evidence is not yet conclusive.","major_comments":[{"comment":"The central evidence for the conjecture is the enumeration data, and the load-bearing assumption is that the per-site tuple (VN, VH, HN, HH) together with the dominance rule exactly captures the information needed to compute the minimum number of bends to every future cell. The manuscript asserts this but does not prove it. In particular, the update retains only one 'best route' per starting orientation; a route with more bends before crossing the current vertical border B may nevertheless lead to a smaller global minimum-bend path to a later column because it crosses at a more favorable height. Similarly, the claim that only the top cell of the new column needs to be checked when updating the global maximum is not justified. Since every fitted polynomial and recurrence is derived from these counts, an error here would invalidate the central conjecture. Please provide a formal invariant","section":"Appendix A.3, 'Full problem: k-convex polyominoes'"},{"comment":"The universal formulas are obtained by observing recurrences for k ≤ 7 and then solving them. Even though the paper carefully labels the result as conjectured, the claim for all k rests entirely on the assumption that these recurrences persist. The k→∞ check attributed to Rinaldi tests the limit of the closed form, not the recurrences at finite k. To make the conjecture robust, the authors should either (i) prove the recurrences from the combinatorial definition, (ii) check k = 8 and, if possible, k = 9 with a few more coefficients, or (iii) state precisely how many coefficients would be needed to determine p_k and q_k for general k. I would also ask for a quantitative statement of the 'extra terms confirm the result' claim: for each k = 3,...,7, how many coefficients are used to fit and how many are checked?","section":"§4.1, recurrences for d_k, r_k, p_k"},{"comment":"The final closed form is an interpolation of the fitted k = 3,...,7 cases; the structural decomposition Q = Q_1 - Q_2 and the square form of q_k are assumed rather than derived. This is acceptable if the paper is clearly a conjecture paper, but it should be made explicit what additional evidence would be needed to turn the conjecture into a theorem. In particular, the exact form of p_k and the squareness of q_k are empirical. A short derivation or a combinatorial interpretation of at least one of the recurrences would materially strengthen the paper.","section":"§4.2, Eq. for Q_k"}],"minor_comments":[{"comment":"There is a typographical error 'they don?t affect anything' where 'don't' is intended. Figure 1's caption also has 'polyonimo' instead of 'polyomino'.","section":"Appendix A.1"},{"comment":"The series coefficients are printed as one long parenthesized expression times x^2. A table listing the coefficients in increasing powers would be much easier to verify and would help readers compare the formulas with the data.","section":"§3.1–§3.5"},{"comment":"The k→∞ consistency check is attributed to 'Rinaldi S.: Private communication'. Since this check is used as evidence for the conjecture, including the short calculation as an appendix or as a cited published reference would make the paper self-contained.","section":"§4.2"}],"recommendation":"major_revision","confidential_remarks":"The fitted formulas appear internally consistent and match the known cases, so I see no obvious mathematical error in the conjectured generating function itself. The risk is the correctness of the enumeration data produced by the transfer-matrix algorithm. If the authors can supply a formal proof of state sufficiency or an independent verification of the counts, the paper would be a solid computational conjecture paper; without this, the central claim is not yet supported strongly enough for publication in a research journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing you should know: this paper is a conjecture, not a theorem, and it may well be right. The authors give a closed-form generating function, built from Chebyshev polynomials, for k-convex polyominoes by semi-perimeter for k≥2. Prior to this, only the k=2 and fully convex cases were known; k>2 was open. That makes this a real advance, even as a conjecture.\n\nThe paper is honest about its status. The solution is reverse-engineered from exact enumerations for k=3..7, with recurrences for the numerator and denominator polynomials extrapolated to all k. The recurrences are simple, the k→∞ limit recovers the known convex polyomino generating function (verified by Rinaldi), and the coefficient checks give resounding agreement. They ship the code on GitLab, which is good diligence.\n\nSoft spots, in proportion. The main one is the transfer-matrix algorithm in Appendix A. The state is a 4-tuple per site, and the paper asserts rather than proves that this captures all minimum-bend information. The dominance check is described as 'fiddly and error-prone' and the implementation is admitted to be imperfect. If the state space is insufficient, every count is wrong and the conjectured formula collapses. This is not a demonstrated flaw, but it is a load-bearing assumption in the evidence base. A referee should either prove the state sufficiency or cross-check against another method and provide k=8 data. Second, the paper sometimes says 'all k' but the formula clearly does not include k=1 (L-convex has a different structure); the k≥2 restriction needs to be explicit. Minor quibble: the asymptotics are stated with little derivation, but they follow from the generating function.\n\nFor a colleague working in polyomino enumeration, this is a worthwhile read and a plausible answer to an open problem. It deserves to go to peer review; the conjecture is specific, falsifiable, and the evidence is solid enough to merit referee time. I would encourage the referees to ask for a proof of the recurrences or at least a convincing heuristic, and for a formal or independent check of the enumeration algorithm. The k=1 wording should be fixed before publication.","headline":"A transparent, data-driven conjecture for the generating function of k-convex polyominoes (k≥2) that is worth a serious referee, but the enumeration data are not formally verified.","tokens_in":11120,"tokens_out":2656,"would_cite":true,"duration_ms":26101,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A15","05B50"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper conjectures a single closed-form generating function, built from Chebyshev polynomials, that gives the exact semi-perimeter counts of k-convex polyominoes for every k and reproduces all enumerated coefficients through k=7.","keywords":["k-convex polyominoes","semi-perimeter enumeration","generating function","Chebyshev polynomials","transfer matrix","convex polyominoes","asymptotic enumeration","conjectured closed form"],"falsifier":"Enumerate 8-convex polyominoes of semi-perimeter up to 25 by an independent algorithm—for example, exhaustive generation of convex polyominoes with a direct pairwise minimum-bend check—and compare with the coefficient series obtained by expanding Q_8(x) from the conjectured formula; the paper only provides data through k=7, so a mismatch at k=8 would falsify the conjecture, while a match would transfer the evidentiary weight to the extrapolation.","tokens_in":10143,"feed_emoji":"🧩","tokens_out":9670,"duration_ms":91340,"temperature":0.7,"pith_summary":"The paper tries to establish a complete semi-perimeter enumeration for k-convex polyominoes: it conjectures that the generating function for every k has one closed form Q_k(x)=Q_{1,k}(x)−Q_{2,k}(x), written entirely through Chebyshev polynomials. The form was found by feeding transfer-matrix counts for k=3,...,7 through a nonlinear change of variable and reading off rational functions; the known case of fully convex polyominoes is recovered as k→∞. The authors are explicit that this is a conjecture, not a proof: the enumeration algorithm's correctness is asserted rather than justified, and the closed form is checked against series rather than derived. If the conjecture is right, all k-convex polyomino counts are known exactly, and their large-n behaviour begins with 4^n[n(k−1)/(8(k+1)) − √n/(2√π(k+1))].","feed_headline":"One formula predicts all k-convex polyomino counts","feed_subtitle":"The exact semi-perimeter generating function is conjectured for every k and matches all data to 25 terms.","key_machinery":"The central object is the two-term ansatz Q_k=Q_{1,k}−Q_{2,k}, with both pieces sharing the denominator d_k(x)=x^k U_k((1−2x)/(2x)); Chebyshev polynomials of the second kind, U_k, arise from solving the recurrence d_k=(1−2x)d_{k−1}−x^2 d_{k−2}, while the first-kind polynomials T_k enter through the perfect-square numerator r_k(x)^2=[2x^{k/2}T_k(1/(2√x))]^2. The transfer-matrix algorithm supplies the coefficient data; the change of variable y=1−√(1−4x) turns the algebraic piece into a rational function, so the polynomial families can be identified by rational-function interpolation and then solved in closed form.","core_discovery":"For fixed k, the paper claims the semi-perimeter generating function is Q_k(x)=Q_{1,k}(x)−Q_{2,k}(x), where Q_{1,k} is a rational function with denominator (1−4x)^2 d_k(x) and Q_{2,k} carries the factor (1−4x)^{−3/2} d_k(x), with d_k(x)=x^k U_k((1−2x)/(2x)). The numerator of Q_{1,k} is expressed through U_k and U_{k−1}, while the numerator of Q_{2,k} is a perfect square whose root is expressed through T_k. The authors report that this formula reproduces all 25 coefficients for each k=3,...,7 and reduces to the known convex-polyomino generating function as k→∞. They label the result as conjectured and base it on data analysis.","pith_inferences":["The paper mentions area enumeration up to 65 cells but does not analyse it; a parallel closed form for area counts is the most obvious next target and would test the same ansatz in a different regime.","The conjectured asymptotic has the sub-leading √n term vanish as k→∞, whereas the exact convex-polyomino result retains it; this signals that the k→∞ and n→∞ limits do not commute and invites a matched-asymptotics analysis.","Because d_k, r_k, and p_k are each defined by three-term recurrences in k, the generating functions might satisfy recurrences in k as well as n; finding them could turn the data-supported conjecture into an inductive proof."],"forward_implications":["For each fixed k, the exact coefficient sequence for semi-perimeter n+2 can be computed from Q_k(x) to any order without further enumeration.","The leading asymptotics 4^n[n(k−1)/(8(k+1)) − √n/(2√π(k+1))] give a one-parameter family of growth rates interpolating between the known 2-convex rate n/24 and the fully convex rate n/8.","The k→∞ limit of the formula reproduces the known generating function for all convex polyominoes, providing an independent consistency check.","Existing exact results for 2-convex and fully convex polyominoes fit the same two-piece template, so the conjecture unifies the earlier semi-perimeter solutions."],"fun_headline_variants":["Conjecture unifies k-convex polyomino counts by semi-perimeter","Single formula proposed for all k-convex polyomino semi-perimeters","Data-surfaced conjecture: exact semi-perimeter generating function","Matching 25 terms per k, one formula conjectured for all k","Semi-perimeter generating function conjectured for every k"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing premise is that the transfer-matrix state—a tuple (VN,VH,HN,HH) for each tracked cell plus the dominance rule—stores exactly the minimum-bend information needed to certify k-convexity as columns are added; Appendix A asserts this but gives no proof, and a polyomino needing richer state would invalidate every inferred coefficient and the conjectured formula.","fun_headline_variants_meta":{"raw":{"variants":["Conjecture unifies k-convex polyomino counts by semi-perimeter","Single formula proposed for all k-convex polyomino semi-perimeters","Data-surfaced conjecture: exact semi-perimeter generating function","Matching 25 terms per k, one formula conjectured for all k","Semi-perimeter generating function conjectured for every k"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000184,"raw_usage":{"total_tokens":1075,"prompt_tokens":584,"completion_tokens":491,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":328,"completion_tokens_details":{"reasoning_tokens":397}},"tokens_in":328,"tokens_out":491,"duration_ms":5758,"temperature":1.0,"reasoning_tokens":397,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T06:32:21.846725+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate 8-convex polyominoes of semi-perimeter up to 25 by an independent algorithm—for example, exhaustive generation of convex polyominoes with a direct pairwise minimum-bend check—and compare with the coefficient series obtained by expanding Q_8(x) from the conjectured formula; the paper only provides data through k=7, so a mismatch at k=8 would falsify the conjecture, while a match would transfer the evidentiary weight to the extrapolation.","supporting_citations":[],"review_version":2}