{"id":"b11e387e-5830-4cf9-bfcd-7ef618c97173","arxiv_id":"2412.03863","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves that if a union-closed family has second-most-frequent element frequency at most 1/3, then it must have between 81 and 113 sets and all its minimal 2-good sets have size 4.","lead":"This paper narrows the range where a strengthened version of Frankl's union-closed sets conjecture might fail, from families of size 45 to 113 down to sizes 81 to 113. It also shows that any potential counterexample must have a uniform structure, with all minimal 2-good sets of size 4.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Numerical LP bounds in Figure 1 and Lemma 2.2 are asserted without derivations; Theorem 1.3's case elimination depends entirely on them.","rationale":"The central claim requires eliminating all minimal 2-good set sizes except 4 in any hypothetical counterexample. The paper does this by solving linear programs whose constraints are derived in Lemmas 2.2-2.4 and whose outputs are summarized in Figure 1. I checked the combinatorial lemmas: the incidence comparison between S and S+x-b in Lemma 2.4 is valid, the case analysis on the minimum intersection size covers the required counts, and Lemma 2.3's inclusion-exclusion count checks out. The weak point is that every row of Figure 1, plus the auxiliary m>=129 bound inside Lemma 2.2, is asserted as a solver result without a dual certificate, exact rational solution, or in-text derivation. Since Theorem 1.3's dichotomy collapses if any of these bounds is wrong, this is load-bearing. The companion repository is a plausible remedy, but the paper as written does not present enough to verify the LP layer from the text. This is the same concern the reader identified, so the verdict should remain conditional pending verification.","tokens_in":7286,"tokens_out":25945,"duration_ms":242802,"concrete_test":"Independently re-solve the LPs behind Figure 1 with a different solver, starting from the companion repository's constraint formulation, and require dual or Farkas certificates for every entry, especially the infeasible cell (s=4,|C|>=3) and the m>=129 bound used inside Lemma 2.2. If all certificates verify, the central argument is supported; if any bound changes, the case elimination fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 1.3 reduces every potential counterexample to a small set of cases and then eliminates all but s=4 with |C|<=1 using the numerical LP table in Figure 1. That table is the load-bearing step, but none of its entries is derived in the text: statements such as 'Solving L0 with ... gives m>=81/114/...' and 'infeasible' are presented as outputs of a companion repository. This includes a numerical claim inside the proof of Lemma 2.2: in the |S|=5 case, the argument that any two elements b,c in C would force m>=129 invokes 'the LP L0 along with q_b+q_c+q_bc+28-3 <= m/3' to conclude m>=129, again without a derivation. If any one of these LP bounds is wrong, the dichotomy that leaves only the 81<=m<=113, size-4-minimal-set case collapses. The combinatorial lemmas themselves appear internally coherent, but the proof as written is not self-contained precisely where correctness matters most.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies Nagel's k=2 conjecture for union-closed families when the second frequency f2(F) is at most 1/3. Following the Das-Wu theorem, which leaves only the range 45 <= |F| <= 113 open, the author defines a linear program L0 whose variables count how many sets of F intersect a fixed minimal 2-good set S in each subset T of S. Three lemmas, based on choices of an x-flexible element and covered elements, add extra constraints to L0. Solving the strengthened LPs for |S|=4 and |S|=5 yields lower bounds on |F| and an infeasibility. The main theorem concludes that any non-near-2-cube family with f2(F) <= 1/3 must have 81 <= |F| <= 113 and every minimal 2-good set of size 4. The combinatorial lemmas are expository and mostly coherent, but the numerical bounds that eliminate all cases are asserted without derivations or certificates in the text.","tokens_in":7482,"tokens_out":26142,"duration_ms":240453,"significance":"If the theorem is correct, it is a useful finite reduction for the k=2 case of Nagel's conjecture: any potential counterexample outside the near-cube case would have size in [81,113] and all minimal 2-good sets of size 4. The LP-plus-lemmas strategy is natural and the three lemmas are, in the main, carefully argued. However, the load-bearing numerical claims are outsourced to a companion repository: every cell of Figure 1 and the m>=129 bound inside Lemma 2.2 are stated as outputs of solving LPs without presenting dual certificates, primal solutions, or solver transcripts. Since an error in any one of these LP computations would invalidate Theorem 1.3, the manuscript as submitted is not self-contained at exactly the point where correctness matters most.","major_comments":[{"comment":"The bounds m>=81, m>=114, m>=118.5, m>=115.5, m>=122, the infeasibility for s=4, |C|>=3, and the similar bound m>=129 used inside the proof of Lemma 2.2 are asserted as results of solving L0 with additional constraints, but no derivation, dual certificate, or solver output is included in the manuscript. The companion GitHub repository is cited, but the submitted text contains none of the actual LP solutions or certificates. Because Theorem 1.3 depends on these numerical bounds to eliminate every case, the proof is not verifiable as written. Please include, for each cell of Figure 1, an exact LP solution or a dual certificate, or append the complete solver input and output, and do the same for the m>=129 claim in Lemma 2.2.","section":"Figure 1 and Sections 4-5"},{"comment":"In the |S|=4 subcase, the proof dismisses the possibility that S+x-b-c is 2-good with the sentence 'then it means that there is a 2-good set with size 3, which implies f2(F)>1/3.' No proof or reference is given for this implication. In the |S|=5 subcase, the proof states that 'Consider the LP L0 along with qb+qc+qbc+28-3 <= m/3, we get m >= 129' with no derivation. Both statements are load-bearing: they are used to show that S+x-b-c is not 2-good for any b,c in C, which is an essential step in Lemma 2.2. Please supply a proof or citation for the size-3 claim and a certificate for the LP bound.","section":"Section 3, proof of Lemma 2.2"},{"comment":"The proof of Lemma 2.4 assumes that S is a minimal 2-good set maximizing incidence among all minimal 2-good s-sets of F, and this assumption is then used in Corollaries 4.1 and 5.1. The assumption is introduced only in the heuristic section and is not stated in Theorem 1.3 or in the formal setup of Sections 4 and 5. The proof should state explicitly that, for each s in {4,5}, the argument fixes a minimal 2-good s-set S of maximum incidence, and that this choice entails no loss of generality because if any minimal 2-good s-set exists, a maximum-incidence one exists. As written, the reader cannot immediately see that the contradiction obtained for the chosen S rules out all minimal 2-good s-sets.","section":"Section 3, Lemma 2.4 and its use in Sections 4.2 and 5.2"}],"minor_comments":[{"comment":"The notation for the second frequency is inconsistent: the introduction uses F2(F), while Theorem 1.3 and the rest of the paper use f2(F). Please unify the notation.","section":"Throughout"},{"comment":"The formula '(2s - 2s-1-|C|)' has lost its superscripts and should read '2^s - 2^{s-1-|C|}'. Similar superscript problems appear elsewhere in the typeset text.","section":"Lemma 2.3 statement"},{"comment":"The sentence 'Now we assume that S = {a,b,c,d} and x, ax in F S+x' is garbled and should be rewritten as a proper statement that x and a∪{x} are elements of the ground set or that certain sets are in F.","section":"Section 4, first line"},{"comment":"The claims 'sum_{a in S} q_a >= 40 for |S|=5' and 'q_y >= 8 for each y in S, |S|=4' are stated as immediate consequences of the constraints of L0. A short derivation, or a reference to a prior lemma proving these LP bounds, would greatly improve readability.","section":"Section 3, proof of Lemma 3.1"},{"comment":"The companion GitHub repository is a useful supplement, but a URL is not a substitute for a permanent archival record. If the journal permits, please include the LP solver input/output or certificates as supplementary material, and consider archiving the repository in a stable venue.","section":"Reproducibility"}],"recommendation":"major_revision","confidential_remarks":"This paper is a companion to arXiv:2412.03862 by Das and Wu, and it relies on that paper's theorem for the reduction to the range 45 <= m <= 113 and for the assertion that relevant minimal 2-good sets have size 4 or 5. The editor may wish to ensure that the companion paper is available or accepted before this manuscript is finalized. The main issue is the centrality of unverified LP computations; if the author can supply exact certificates or complete reproducible code, the proof would be substantially stronger. I would not recommend rejection, since the combinatorial framework appears coherent and the missing pieces are local and fixable, but the numerical bounds must be made verifiable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a genuine advance on Nagel's k=2 conjecture. The main theorem narrows the counterexample range from [45,113] to [81,113] and forces minimal 2-good sets to have size 4, assuming the numerical bounds hold. The combinatorial lemmas are coherent and the LP setup is plausible, but the proof leans on a table of LP results that are reported without derivation. That is a fixable problem, but it is the whole ballgame.\n\nWhat's new: the flexible/covered element lemmas (2.2–2.4) and the LP formulation that yields the improved bounds. Lemma 2.4's incidence argument is subtle and looks correct. The separate minimal-cover theorem (6.2) is a nice observation, though it sits apart from the main argument.\n\nWhere it is soft: every entry in Figure 1, and the m >= 129 claim inside Lemma 2.2, is presented as output of 'solving L0' with no dual certificate, no variable values, and no derivation. The proof of Lemma 2.2 also asserts that a 3-element 2-good set forces f2 > 1/3 without proof. The companion repository helps, but the paper should include the exact constraints and enough computational evidence, such as LP duals or explicit solutions, for a referee to check without trusting the code. The minimal-cover section feels like a standalone note rather than part of the main proof.\n\nIs this a dealbreaker? Not based on what I see. The lemmas are coherent, the LP constraints are natural, and the gaps are verification gaps rather than obvious contradictions. If the LP bounds check out, Theorem 1.3 is a real result that narrows a known open case. If they don't, the paper collapses. So the right move is to send it to a referee who can verify the computations and require the author to supply certificates or a detailed LP appendix before acceptance.\n\nFor whom: anyone working on Frankl's or Nagel's union-closed set conjectures. Worth a serious referee, but the author should expect to add verifiable computational details.","headline":"Real progress on Nagel's k=2 conjecture, but the proof's load-bearing LP bounds are asserted rather than verified.","tokens_in":7984,"tokens_out":3411,"would_cite":true,"duration_ms":36113,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D05","05C65"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that a union-closed family whose second-most frequent element appears in at most one third of the sets, and which is not a near-2-cube, must have between 81 and 113 sets and all minimal 2-good sets of size 4.","keywords":["union-closed sets conjecture","second frequency","2-good sets","linear programming","near-2-cube","shattering method","minimal covers","extremal set theory"],"falsifier":"Exhibit a union-closed family $\\mathcal{F}$ with $45\\le |\\mathcal{F}|\\le 80$ that is not a near-2-cube and whose second-most frequent element appears in at most one third of the sets; such a family would disprove part (i) of Theorem 1.3. Alternatively, produce a feasible solution to the paper's stated linear program for $|S|=4$, $|C|\\ge 3$ with $m<81$, which would contradict the claimed infeasibility.","tokens_in":1695,"feed_emoji":"🧮","tokens_out":1657,"duration_ms":117355,"temperature":0.7,"pith_summary":"The union-closed sets conjecture asks whether every finite union-closed family contains an element that appears in at least half of its sets. A stronger conjecture asks for $k$ elements each appearing in at least $1/(2^{k-1}+1)$ of the sets, which for $k=2$ means two elements each appearing in at least one third of the sets. An earlier companion paper verified the $k=2$ case except for families of size $45$ through $113$, leaving open the possibility of a counterexample in that interval. This paper proves that any non-near-cube family in that interval with second frequency $f_2(\\mathcal{F})\\le 1/3$ must actually have $81\\le |\\mathcal{F}|\\le 113$ and must have all minimal 2-good sets of size $4$. The interest is that any counterexample, if it exists, is now confined to a narrow and highly structured window.","feed_headline":"Low second frequency forces union-closed exceptions into 81–113 sets","feed_subtitle":"A linear-programming analysis shrinks the only open family-size window for the k=2 second-frequency conjecture.","key_machinery":"The linear program $L_0$ built from a minimal 2-good set $S$ is the carrying device. For each $T\\subseteq S$, the variable $q_T$ counts the sets of $\\mathcal{F}$ whose intersection with $S$ is exactly $T$. The constraints are $q_\\emptyset\\le 2$ (only $\\emptyset$ and $\\{1\\}$ can miss $S$), $q_T\\ge 1$ for every $T$ (from minimality), $\\sum_{T\\subseteq S}q_T=m$, and $\\sum_{T\\ni y}q_T\\le m/3$ for each $y\\in S$ (from the second-frequency bound). Solving $L_0$ gives $m\\ge 45$ for $|S|=4$ and $m\\ge 70.5$ for $|S|=5$. An element $y$ of $S$ is covered by an element $x$ if every witness set $F_y$ with $F_y\\cap S=\\{y\\}$ contains $x$, and flexible if a witness can be chosen with or without $x$. The three lemmas about flexible and covered elements add inequalities to $L_0$, and each subcase is settled by solving the augmented program; the quoted optima are the outputs of these computations.","core_discovery":"The central claim is Theorem 1.3: if $\\mathcal{F}$ is union-closed, $|\\bigcup\\mathcal{F}|\\ge 2$, $\\mathcal{F}$ is not a near-2-cube, and $f_2(\\mathcal{F})\\le 1/3$, then $81\\le |\\mathcal{F}|\\le 113$ and every minimal 2-good set of $\\mathcal{F}$ has size $4$. The proof analyzes a minimal 2-good set $S$ and splits into the cases $|S|=4$ and $|S|=5$. It records, for each $T\\subseteq S$, the number $q_T$ of sets in $\\mathcal{F}$ meeting $S$ exactly in $T$, and it shows that 2-goodness and the frequency bound force certain linear inequalities on the $q_T$ and $m=|\\mathcal{F}|$. Additional lemmas, using an element $x$ outside $S\\cup\\{1\\}$ that can be chosen flexibly, add more inequalities depending on how many elements of $S$ are covered by $x$. Solving the resulting linear programs gives $m\\ge 81$ in the surviving cases, $m\\ge 114$ in others, and infeasibility when $|S|=4$ and at least three elements are covered; the case $|S|=5$ is ruled out entirely. The conclusion is that the open interval $[45,113]$ shrinks to $[81,113]$, and the minimal 2-good sets of any possible counterexample are uniform of size $4$.","pith_inferences":["The theorem does not settle whether a family in $[81,113]$ with uniform minimal 2-good sets actually exists; settling that existence is the natural next step.","Because the numeric bounds come from computer-assisted linear programming, a machine-checkable certificate for each linear program would make the conclusion verifiable without trusting an external script.","The same $q_T$ linear-programming method may extend to higher $k$, where the threshold is $1/(2^{k-1}+1)$, to shrink the remaining intervals for the multielement frequency conjecture as well."],"forward_implications":["Every non-near-cube union-closed family with $45\\le |\\mathcal{F}|\\le 80$ has $f_2(\\mathcal{F})>1/3$, so the $k=2$ second-frequency conjecture holds throughout that lower range.","Any potential non-near-cube counterexample must have between 81 and 113 sets and every minimal 2-good set of size 4; no such counterexample can have a minimal 2-good set of size 5.","The search range for counterexamples is cut from $45$–$113$ down to $81$–$113$, and the remaining candidates must satisfy a strong uniformity condition.","Combined with the earlier result, the $k=2$ second-frequency bound $f_2(\\mathcal{F})\\ge 1/3$ holds for all non-near-cube families with $|\\mathcal{F}|\\le 80$ or $|\\mathcal{F}|\\ge 114$."],"supporting_citations":[{"why":"Supplies the 2-good-set machinery, the previous k=2 range m≤44 or m≥114, and the shattering framework that the new linear-programming bounds extend.","marker":"[1]"},{"why":"Posits the k-element second-frequency conjecture whose k=2 case this paper constrains further.","marker":"[2]"}],"fun_headline_variants":["LP proof shrinks union-closed counterexample window to 81–113","Nagel's k=2 conjecture: counterexamples only between 81 and 113 sets","Second-frequency analysis pins possible exceptions to set sizes 81–113","Linear programming tightens open range for union-closed families","Union-closed exception bound refined: 81–113, minimal sets size 4"],"cache_read_input_tokens":10240,"weakest_assumption_plain":"The numerical bounds and the infeasibility of some cases come from linear programs whose specifications and solutions are not derived in the paper; if those computations are wrong, the theorem's claimed range could change.","fun_headline_variants_meta":{"raw":{"variants":["LP proof shrinks union-closed counterexample window to 81–113","Nagel's k=2 conjecture: counterexamples only between 81 and 113 sets","Second-frequency analysis pins possible exceptions to set sizes 81–113","Linear programming tightens open range for union-closed families","Union-closed exception bound refined: 81–113, minimal sets size 4"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000969,"raw_usage":{"total_tokens":4164,"prompt_tokens":1033,"completion_tokens":3131,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":649,"completion_tokens_details":{"reasoning_tokens":3031}},"tokens_in":649,"tokens_out":3131,"duration_ms":20620,"temperature":1.0,"reasoning_tokens":3031,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T21:59:17.713102+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhibit a union-closed family $\\mathcal{F}$ with $45\\le |\\mathcal{F}|\\le 80$ that is not a near-2-cube and whose second-most frequent element appears in at most one third of the sets; such a family would disprove part (i) of Theorem 1.3. Alternatively, produce a feasible solution to the paper's stated linear program for $|S|=4$, $|C|\\ge 3$ with $m<81$, which would contradict the claimed infeasibility.","supporting_citations":[],"review_version":1}