{"id":"fc3b00c5-bb84-432c-85d4-4fb66dc2d2a7","arxiv_id":"2505.24072","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For every even n, the code-based construction yields explicit [3,1]-avoiders in F_2^n of at least roughly 2^{n/12}/sqrt(n) different sizes.","lead":"This paper constructs explicit sets of points in binary affine space that avoid containing exactly one point on any three-dimensional flat, and shows these sets come in exponentially many sizes. It links the construction to weight enumerators of binary linear codes and proves an upper bound that limits this method's reach.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the free-generation step (Proposition 5.6) and the counting argument in Theorem 1.6 are internally consistent.","rationale":"The reader accepted with high confidence, and our independent pass agrees. We stress-tested the stated weakest link, Proposition 5.6, and re-derived the transformation recurrences from Lemma 5.2. The size computation in Theorem 1.5 is exact: each signature preimage has (2^{k-1}-1)^{ell-w} elements, and the avoider property follows from decomposition into unions of symmetric differences of (n-k+1)-flats. The free-generation proof satisfies the ping-pong lemma, and the case analysis in Theorem 1.6 validly converts distinct matrices into at least T^{1/3} distinct weight-enumerator values; the diophantine injectivity in Case 2b is correct because the difference between any two solutions changes gamma + delta by a nonzero integer multiple of (alpha+beta)/g. The upper-bound remarks are not needed for the main claim. Thus the central theorem is internally consistent, and no change to the reader's verdict is warranted.","tokens_in":842,"tokens_out":803,"duration_ms":197088,"concrete_test":"Run an exact-arithmetic script that enumerates all words f in {a,b}^r for r up to 10, computes M_f, and checks that all 2^r matrices are distinct and satisfy the two ping-pong inclusions of Proposition 5.6. Then verify that for each fixed (alpha, beta, D) arising among the T matrices of Theorem 1.6, the solutions (gamma, delta) in Z_{≥ 0}^2 of alpha*delta - beta*gamma = D have distinct values of gamma + delta. If every assertion holds for r = 10, the load-bearing step is confirmed; if any fails, the free-generation or counting argument in Theorem 1.6 must be repaired.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After a full check, no load-bearing flaw was found. The claim that most needs to be true is Proposition 5.6, namely that M_a = diag(9,1) and M_b = [[10,6],[6,10]] generate a free group; if this failed, the Theorem 1.6 counting argument would collapse. The ping-pong verification is sound: for r = |y/x|, M_a^n sends r in (1/3,3) to (0,1/3) for n >= 1 and to (3,infinity) for n <= -1, while M_b^n sends r outside [1/3,3] into (1/3,3) in absolute value (with negative sign for negative n). The pigeonhole cases in the proof of Theorem 1.6 were also checked, including Case 2b: for fixed alpha, beta, the equation alpha*delta - beta*gamma = D has gamma + delta injective because all solutions differ by t*(alpha/g, beta/g), changing gamma + delta by t*(alpha+beta)/g, which is nonzero for distinct t. No internal inconsistency or unsupported step was found in the size formula, the avoider property, or the exponential lower bound.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies [k,1]-avoiders in binary affine spaces AG(n,2), i.e., subsets S such that no k-dimensional affine flat contains exactly one point of S. The main contribution is a code-based construction (Construction 4.1) that, given any binary linear code C of length ℓ and any fixed k ≥ 3, produces a [k,1]-avoider in F_2^{ℓ(k−1)} of size 2^n − W_C(1, 2^{k−1}−1), where W_C is the weight enumerator of C (Theorem 1.5). The paper then specializes to k=3 and, using two transformations a and b that increase code length by two, proves (Theorem 1.6) that for every even n ≥ 4 the construction yields at least binom(floor((n−4)/4), floor((n−4)/8))^{1/3} ≥ c·2^{n/12}/sqrt(n) distinct sizes of [3,1]-avoiders. The proof of the exponential lower bound uses the ping-pong lemma to show that the two matrices M_a=diag(9,1) and M_b=[[10,6],[6,10]] generate a free group of rank two, and then counts how many distinct first entries of M_f(1,1)^T arise as f ranges over words in {a,b}. The paper also gives an upper bound, via the MacWilliams identity, showing that the code-based construction cannot produce o(2^n) distinct sizes, so it does not contradict the authors' earlier density conjecture.","tokens_in":13345,"tokens_out":17542,"duration_ms":144610,"significance":"The result is a significant step on the smallest open case (k,t)=(3,1) of the Kovács–Nagy conjecture: it provides an explicit, deterministic family of [3,1]-avoiders with exponentially many different sizes, complementing earlier probabilistic evasive-set constructions. The code-based construction is elegant and reduces a geometric problem to weight-enumerator evaluations of binary linear codes, which is a new and potentially fruitful connection. The proof of Theorem 1.5 is self-contained and the size formula is exact; the free-group argument in Proposition 5.6 is correctly executed and constitutes the core of the exponential lower bound. The paper also correctly identifies a limitation of the method (Corollary 4.7), so the chief new result, Theorem 1.6, is appropriately placed as a lower bound rather than as a disproof of the conjecture.","major_comments":[],"minor_comments":[{"comment":"The displayed equation '|SC(k)| = sum_{c∈C} (2^{k−1}−1)^{ℓ−w(c)} = ... = W_C(1,2^{k−1}−1)' is not quite correct: SC(k) is defined as the set of x with s(x)∉C, so the sum gives the size of the complement {x : s(x)∈C}. The final equality |SC(k)| = 2^n − W_C(1,2^{k−1}−1) is correct, but the intermediate equation should be written as |{x : s(x)∈C}| = W_C(1,2^{k−1}−1).","section":"Section 4, proof of Theorem 1.5"},{"comment":"In the verification of the second ping-pong condition, for n≤−1 the ratio y′/x′ is stated to lie between −3 and −1/3, while X2 is defined using |y|/|x|. The claim is correct because |y′|/|x′| then lies in (1/3,3), but the wording should explicitly mention absolute values to match the definition of X2 and avoid confusion.","section":"Proposition 5.6, condition (2)"},{"comment":"In the ab<0 case, the expression for the upper bound is typeset as 2 \\binom{|a|+|b|}{g}^ℓ + 1; it should read 2 · ((|a|+|b|)/g)^ℓ + 1. The surrounding text already explains the correct meaning, but the displayed formula as written is ambiguous.","section":"Proposition 4.5"},{"comment":"The caption could be more precise by stating that the figure displays generator matrices for C, a(C), and b(C); currently it says 'generating matrices' without identifying the correspondence between the three matrices and the three codes.","section":"Figure 1"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is well within the scope of math.CO. I have no concerns about the citation pattern or novelty. The only issues I found are presentation-level, and the misstated equation in the proof of Theorem 1.5 should be corrected before publication, although the final formula is correct."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing to know: this is a solid, incremental paper that gives the first explicit construction of [3,1]-avoiders in binary affine spaces, with an exact size formula in terms of weight enumerators. Second: the proof that these constructions yield exponentially many distinct sizes is correct, but the exponent is small, so it is progress on, not a resolution of, the Kovács–Nagy conjecture.\n\nWhat is good. Construction 4.1 is clean. Given a code C you define n = ℓ(k−1), take ℓ flats that cut the space into blocks of k−1 coordinates, and build a set S from the signatures of points relative to C. The size computation is exact, and the avoider property follows because S is a union of symmetric differences of (n−k+1)-flats. The upper bound via the MacWilliams identity (Corollary 4.7) is a nice addition, showing the method cannot disprove the conjecture. The highlight is Proposition 5.6, where the ping-pong lemma is applied to show that diag(9,1) and [[10,6],[6,10]] generate a free group. I traced the ratio estimates myself; they work. The subsequent pigeonhole argument over the free group is a bit cumbersome but internally consistent.\n\nSoft spots. The result is clearly an extension of the author's own program; the probabilistic existence result already gave exponentially many sizes, and this paper makes them explicit. The lower bound ~2^{n/12}/sqrt(n) is far from the ~1.732^n upper bound for the same method, so the technique is not yet optimal. One minor presentational issue: in the proof of Proposition 5.6, part (2) writes “1/3 < y'/x' < 3” without absolute values; the intended statement involves |y'/x'| (with sign for negative n). This is sloppy but not wrong, and should be fixed. Self-citation is fine here because the cited work genuinely provides the problem context.\n\nWho should read it: people working on flat-intersection problems, cap-set generalizations, or weight-enumerator techniques. The paper is honest, self-contained, and the mathematics is checkable. I would send it to a serious referee with confidence.","headline":"A sound, incremental construction of [3,1]-avoiders with an exact size formula and an exponentially weak lower bound; the hard parts are correct.","tokens_in":13872,"tokens_out":2922,"would_cite":true,"duration_ms":30373,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05B25","94B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that every binary linear code builds an explicit set avoiding k-flats that meet it in one point, and that for k=3 these sets achieve exponentially many distinct sizes.","keywords":["affine space","binary linear code","weight enumerator","flat avoider","free group","ping-pong lemma","spectrum density","unavoidable intersections"],"falsifier":"Compute, for all reduced words $w$ in the letters $a,b$ up to some length (say 12), the integer matrix product $M_w$, and look for a nontrivial $w$ with $M_w=I$; equivalently, test the ping-pong cone conditions of Proposition 5.6 by sampling vectors with $1/3<|y/x|<3$ and checking that $M_a^n v$ and $M_b^n v$ fall into the stated cones for all nonzero $n$. The first failure would dissolve the free-group claim and with it Theorem 1.6.","tokens_in":12925,"feed_emoji":"🧮","tokens_out":14540,"duration_ms":108669,"temperature":0.7,"pith_summary":"For a set in the binary affine space $\\mathbb{F}_2^n$, a $[3,1]$-flat is a 3-dimensional affine subspace meeting the set in exactly one point; the paper studies for which sizes $m$ every $m$-point set must force such a flat. It takes on the smallest open case of a conjecture that the density of such forced sizes tends to 1, and constructs explicit sets that avoid $[3,1]$-flats. The construction starts from any binary linear code $C$: for $n=\\ell(k-1)$ it builds a $[k,1]$-avoider of size $2^n - W_C(1, 2^{k-1}-1)$, where $W_C$ is the weight enumerator of $C$. For even $n$, a family of codes built by two simple coordinate transformations yields at least about $2^{n/12}/\\sqrt{n}$ distinct sizes of $[3,1]$-avoiders. These sizes are explicit witnesses against completeness of the spectrum, while a coding-theoretic upper bound shows the construction alone cannot refute the density conjecture.","feed_headline":"Binary codes yield flat-avoiding sets of exponentially many sizes","feed_subtitle":"A code-based construction hands explicit sets that dodge 3-flats meeting them once, in exponentially many sizes.","key_machinery":"The load-bearing mechanism is the code-based construction: split coordinates into $\\ell$ blocks of length $k-1$, map each affine point to its block-signature $s(x)\\in\\mathbb{F}_2^\\ell$, and define $S_C=\\{x: s(x)\\notin C\\}$. Counting points by signature gives $|S_C|=W_C(1,2^{k-1}-1)$, and the parity-check equations of $C$ rewrite $S_C$ as a union of symmetric differences of $(n-k+1)$-flats, exactly the sets that Observation 3.3 shows are $[k,1]$-avoiders. The diversity result runs on two length-increasing transformations $a$ and $b$; on the pair $(W_C(1,3), W_C(3,1))$ they act as the matrices $M_a=\\mathrm{diag}(9,1)$ and $M_b=\\begin{pmatrix}10&6\\\\6&10\\end{pmatrix}$. The ping-pong lemma, applied to the cones $X_1=\\{v: |y/x|<1/3 \\text{ or } |y/x|>3\\}$ and $X_2=\\{v: 1/3<|y/x|<3\\}$ in $\\mathbb{Q}^2$, proves these matrices generate a free group, so distinct words give distinct matrices and hence many distinct first entries $\\alpha_f+\\beta_f$.","core_discovery":"The central claim is Theorem 1.5: fix $k\\ge 3$ and $\\ell\\ge 1$; for any binary linear code $C\\le \\mathbb{F}_2^\\ell$ and $n=\\ell(k-1)$, there is a $[k,1]$-avoider $S_C$ in $\\mathbb{F}_2^n$ with $|S_C|=2^n-W_C(1,2^{k-1}-1)$. The construction splits the coordinates into $\\ell$ blocks of length $k-1$, sends each point to its block-signature in $\\mathbb{F}_2^\\ell$, and lets $S_C$ be the set of points whose signature is not a codeword of $C$; the parity-check equations express $S_C$ as a union of symmetric differences of $(n-k+1)$-flats, which Observation 3.3 classifies as $[k,1]$-avoiders. For $k=3$, the paper introduces two transformations that lengthen a code by two coordinates, tracks the pair $(W_C(1,3), W_C(3,1))$, and shows the transformations act as the matrices $M_a=\\mathrm{diag}(9,1)$ and $M_b=\\begin{pmatrix}10&6\\\\6&10\\end{pmatrix}$. A ping-pong argument proves these matrices generate a free group of rank two, so the $2^r$ words of length $r$ give $2^r$ distinct matrices; a pigeonhole breakdown of the first entry of $M_f(1,1)^T$ then gives the lower bound of Theorem 1.6.","pith_inferences":["Editorial inference: If the author's Remark 5.7 is right, the first entries of $M_f(1,1)^T$ take nearly $2^r$ values, improving the lower bound to close to $2^{n/4}$ distinct sizes.","Editorial inference: The code-based trick is likely portable to other pairs $(k,t)$: any linear code family with many distinct weight-enumerator evaluations at the right inputs would give many avoider sizes, making Problems 4.3 and 4.4 the key quantity to study.","Editorial inference: A cheap numerical probe of the conjectured $(2-o(1))^r$ behavior is to sample random long words in $a,b$ and count distinct first entries; early saturation would indicate the free-group orbit separates values less strongly than hoped.","Editorial inference: Feeding known codes with structured weight enumerators into Theorem 1.5 could produce explicit, highly symmetric flat-avoiders of prescribed sizes, connecting the construction to classical code families."],"forward_implications":["Every binary linear code $C$ yields an explicit $[k,1]$-avoider whose size is the single evaluation $W_C(1,2^{k-1}-1)$, so new families of codes immediately produce new flat-avoiding sets.","For even $n$, the construction produces at least about $2^{n/12}/\\sqrt{n}$ distinct sizes of $[3,1]$-avoiders, so the set of sizes that force a $[3,1]$-flat is missing at least exponentially many values, even though its density still tends to 1.","By Corollary 4.7, the code-based construction can produce at most $O(n c_k^n)$ distinct sizes for a constant $c_k<2$, so this method alone cannot refute Conjecture 1.1.","Since every $[3,1]$-avoider is also a $[k,1]$-avoider for $k\\ge 4$ by partitioning flats, the same explicit sets work for higher-dimensional flats."],"supporting_citations":[{"why":"Defines the spectrum and density problem, states the conjecture that density tends to 1, and identifies (3,1) as the smallest open case that this paper targets.","marker":"[10]"},{"why":"Supplies the ping-pong lemma used to prove that the two weight-enumerator update matrices generate a free group, the step that yields exponentially many distinct sizes.","marker":"[6]"},{"why":"Provides the MacWilliams identity and coding-theory background; the identity is used in Proposition 4.6 to bound the number of sizes the construction can distinguish.","marker":"[12]"}],"fun_headline_variants":["Binary codes build flat-avoiding sets in exponentially many sizes","Exponentially many flat-avoiding set sizes from binary codes","Code-based construction yields exponentially many flat-avoiding sizes","Binary linear codes hand flat-avoiders with many possible sizes","Exponential size variety for flat-avoiding sets via codes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof's lower bound rests on the assumption that the two numerical rules for updating a code's weight count are independent in the strong sense that no sequence of them cancels out; if two different sequences gave the same result, the exponential count of distinct sizes would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Binary codes build flat-avoiding sets in exponentially many sizes","Exponentially many flat-avoiding set sizes from binary codes","Code-based construction yields exponentially many flat-avoiding sizes","Binary linear codes hand flat-avoiders with many possible sizes","Exponential size variety for flat-avoiding sets via codes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000566,"raw_usage":{"total_tokens":2762,"prompt_tokens":1106,"completion_tokens":1656,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":722,"completion_tokens_details":{"reasoning_tokens":1570}},"tokens_in":722,"tokens_out":1656,"duration_ms":12538,"temperature":1.0,"reasoning_tokens":1570,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:37:04.050929+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for all reduced words $w$ in the letters $a,b$ up to some length (say 12), the integer matrix product $M_w$, and look for a nontrivial $w$ with $M_w=I$; equivalently, test the ping-pong cone conditions of Proposition 5.6 by sampling vectors with $1/3<|y/x|<3$ and checking that $M_a^n v$ and $M_b^n v$ fall into the stated cones for all nonzero $n$. The first failure would dissolve the free-group claim and with it Theorem 1.6.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the spectrum and density problem, states the conjecture that density tends to 1, and identifies (3,1) as the smallest open case that this paper targets."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the ping-pong lemma used to prove that the two weight-enumerator update matrices generate a free group, the step that yields exponentially many distinct sizes."},{"cited_title":"J., & Sloane, N","cited_arxiv_id":null,"evidence_quote":"Provides the MacWilliams identity and coding-theory background; the identity is used in Proposition 4.6 to bound the number of sizes the construction can distinguish."}],"review_version":1}