{"id":"258b4d93-0d9f-4ba8-b1e8-20512986dabd","arxiv_id":"2501.01294","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves alpha(2^d-m)=(2^{d+1}-m)/(d+1) for all d>=m>=1 and alpha(11)=53/10, determining minimum-degree thresholds in simplicial complexes for an entire natural regime.","lead":"This mathematics paper determines exactly how many building blocks a simplicial complex must contain before it is forced to have a low-degree vertex, for every threshold of the form 2^d minus m. It also proves the previously conjectured value alpha(11)=53/10 and introduces a new counting technique based on overlapping groups of vertices.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified. The central lower-bound engine appears internally consistent; the only flagged gaps are peripheral unproved claims (α(17), α(20)) and the overlap note.","rationale":"The reader's weakest_assumption was Claim 5.2, and I agree that this claim is load-bearing: it underpins the bound |F|≤d and every subsequent degree estimate. However, I do not find that Claim 5.2 is insecure; its proof is short and the counting argument is valid. My independent check of the surrounding chain (Fact 3.1, Lemma 4.1, Lemma 4.2, Claims 5.3–5.13, and Section 6) did not reveal a counterexample or a hidden assumption. The reason for keeping a conditional posture is not a flaw in the central argument but the presence of unsupported numerical claims in the introduction: α(17)=50/7 and α(20)=8 are stated as 'checked' without proof, and the overlap with arXiv:2406.18870 is not delimited. These are correctness and priority issues, not internal inconsistencies, and they do not change the verdict on Theorems 1.1 and 1.2. The most useful next step is independent verification of the delicate local deletion steps, since the proof is long and unformalized.","tokens_in":23674,"tokens_out":52916,"duration_ms":470974,"concrete_test":"Have an independent reader re-verify the two most delicate local transitions: (i) the deletion/addition step in Claim 6.2, checking specifically that every removed set containing z is additional to the 11 edges already forced by the two intersecting quadruples, so the degree condition at z survives; and (ii) the claim in Claim 5.8 that the bounds in (5.2) sum via Fact 3.3 to at least 2^{d+1}-m. If both pass, no change to the verdict is needed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I find no load-bearing flaw in the proof of the central claims. I checked the main dependencies: Claim 5.2 correctly forces at least three low-degree vertices in every inclusion-maximal B1-set; Claim 5.3 supplies the required pointwise estimates through Lemma 4.1 and Lemma 4.2; the conglomerate decomposition in Claims 5.5–5.13 is coherent, including the degree-preserving deletion/addition step in Claim 5.10 and the summation argument in Claim 5.13. The alpha(11) proof in Section 6 also holds together: Claim 6.2 preserves the hypothesis for the modified tuple, and Claims 6.3–6.4 give the stated averaging bounds. The proof is long and not machine-checked, so independent verification is advisable, but I did not locate a concrete mathematical error. The genuinely unsupported items are the introduction's assertions 'α(17)=50/7 and α(20)=8' and the unquantified overlap statement about [6]; these do not affect Theorem 1.1 or Theorem 1.2 but should be proved, referenced, or explicitly marked as conjectural.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the threshold function α(d), defined as the largest real constant such that every simplicial complex S with |S| ≤ α(d)|V(S)| has a vertex of degree at most d. The main theorem, Theorem 1.1, determines α(2^d − m) = (2^{d+1} − m)/(d + 1) for all integers d ≥ m ≥ 1, thereby resolving the entire block of arguments [2^d − d, 2^d]. The companion Theorem 1.2 proves α(11) = 53/10, confirming a conjecture of Frankl and Watanabe. Upper bounds are obtained from explicit simplicial complexes via Lemma 2.1; the lower-bound proof is organized around a more general statement for mountains, Theorem 5.1, and uses a weighted Kruskal–Katona lemma, local estimates in Lemmas 4.1–4.3, and a conglomerate decomposition. Section 6 adapts the same strategy to prove α(11).","tokens_in":23856,"tokens_out":35255,"duration_ms":306974,"significance":"If the proof is correct, the paper closes a natural block of previously open cases around powers of two and settles the α(11) conjecture. The upper-bound constructions are simple and transparent, and the lower-bound machinery is substantial and internally coherent: the dependency from Theorem 5.1 to Theorem 1.1 is clear, the small-case table matches known values, and the proof of Theorem 1.2 is a genuine extension beyond the m ≤ d regime. The proof is long and not machine-checked, so independent verification is advisable, but I found no load-bearing gap in the central chain. The main unsupported items are peripheral: the introduction asserts α(17) = 50/7 and α(20) = 8 without proof or reference, and the relation to the independent work of Li, Ma, and Rong is not made precise.","major_comments":[],"minor_comments":[{"comment":"The assertions α(17) = 50/7 and α(20) = 8 are presented as checked but are not proved or referenced; since these values do not follow from Theorems 1.1 or 1.2, they should be proved, referenced, or explicitly marked as conjectural.","section":"§1, after Theorem 1.2"},{"comment":"The statement that similar results were obtained independently by Li, Ma, and Rong [6] does not specify which cases overlap with Theorem 1.1 or Theorem 1.2; please state the precise overlap and, if applicable, the extent to which the proofs are independent.","section":"§1, abstract and introduction"},{"comment":"The verification that the modified tuples in the two cases of Claim 6.2 satisfy the hypothesis of Theorem 6.1 is quite compressed, especially the degree bookkeeping for the vertex z in the second case; adding a few sentences explaining the degree changes would improve readability.","section":"§6, proof of Claim 6.2"},{"comment":"The table of values for d ≤ 16 would benefit from a sentence explaining how each entry follows from Theorem 1.1, Theorem 1.2, and the previously known results cited in the introduction.","section":"§1, table of values"}],"recommendation":"minor_revision","confidential_remarks":"The paper is mathematically substantial and the central claims appear sound. Please ensure the authors address the unsupported peripheral values α(17) and α(20) and give a precise overlap statement with [6]; these are presentation and scholarly-completeness issues rather than correctness issues."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bottom line: this is a serious paper that deserves a real referee. The main theorems are Theorem 1.1 (alpha(2^d - m) = (2^{d+1} - m)/(d+1) for all d >= m >= 1) and Theorem 1.2 (alpha(11) = 53/10). What is genuinely new is the full range d >= m, not just the special cases in Frankl, Frankl-Watanabe, and Piga-Schulke. The proof machinery - mountains, conglomerates, and the weighted Kruskal-Katona lemma - is a real extension of the cluster method, and the upper bounds are clean explicit constructions. I agree with the reader's take that the central chain from Theorem 5.1 to the main theorems holds up. I checked the dependencies around Claim 5.2 and the conglomerate decomposition; no fatal gap jumps out. The proof is long and not machine-checked, so independent verification is advisable, but that's normal for this area.\n\nSoft spots, in proportion: the introduction asserts alpha(17) = 50/7 and alpha(20) = 8 with no proof, no reference, just \"we checked.\" That should be fixed before publication: prove them, cite a source, or explicitly mark them as conjectural. The overlap with independent work by Li, Ma, and Rong [6] is acknowledged but not delimited; the authors should state exactly which cases are covered there. These are editorial issues, not load-bearing flaws. One smaller thing: the table of values up to d=16 is convenient, but the provenance of each entry isn't fully cited; a reader has to infer which values come from earlier papers and which are new.\n\nWho is this for: researchers in extremal set theory and traces of families, and people working with Kruskal-Katona type inequalities. It's a subfield-level advance, not a revolution, but it closes a named conjecture and opens a method that may push past the natural barrier m = d. I'd send it to a competent referee. My own verdict on the main theorems is positive, conditional only on the peripheral claims being cleaned up. I think the reader's moderate confidence is a bit too cautious: the proof is detailed and internally consistent, and the stress-test found nothing. The conditional verdict is fair, but I'd raise the confidence to moderate-high. I'd cite this if I worked on traces.\n\nRecommendation: accept for peer review, with a request that the authors address the alpha(17)/alpha(20) claims and delimit the overlap with [6] before final acceptance.","headline":"Resolves a named conjecture and determines alpha on a full block; proof is long but sound, with only peripheral unsupported claims to clean up.","tokens_in":24422,"tokens_out":2086,"would_cite":true,"duration_ms":19070,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D05","05E45","55U10"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every $d\\ge m\\ge 1$, the paper proves $\\alpha(2^d-m)=\\frac{2^{d+1}-m}{d+1}$, and it also settles $\\alpha(11)=\\frac{53}{10}$.","keywords":["simplicial complexes","minimum degree","extremal set theory","traces of finite sets","Kruskal-Katona theorem","mountains","conglomerates","degree thresholds"],"falsifier":"Search exhaustively for a simplicial complex with minimum degree at least $13$ and $|S|/|V|\\le 28/5$; Theorem 1.1 with $d=4$, $m=4$ says no such complex exists, so a single example would refute the claimed threshold.","tokens_in":23445,"feed_emoji":"🧩","tokens_out":9517,"duration_ms":83948,"temperature":0.7,"pith_summary":"The paper determines the minimum-degree threshold for simplicial complexes in every degree just below a power of two: for integers $d\\ge m\\ge 1$, the largest constant $\\alpha(2^d-m)$ such that every simplicial complex whose edge count is at most that constant times its vertex count has a vertex of degree at most $2^d-m$ is exactly $\\frac{2^{d+1}-m}{d+1}$. This closes the whole parameter block from $2^d-d$ up to $2^d$, where previously only the first few cases and a restricted range of $m$ were known. A second theorem gives $\\alpha(11)=\\frac{53}{10}$, confirming a conjecture from the trace literature. The threshold matters because it turns a purely local condition\\u2014every vertex has degree above $d$\\u2014into a quantitative global guarantee on the number of edges.","feed_headline":"Minimum-degree threshold solved for all degrees below powers of two","feed_subtitle":"Exact thresholds now cover the whole block below each power of 2; the case 11 is settled as 53/10.","key_machinery":"The proof works with \\u201cmountains\\u201d, i.e., $N_{\\ge 2}$-complexes: set systems closed under taking subsets of size at least two. On a fixed vertex set, several mountains are considered together, and the key structural object is a \\u201cconglomerate\\u201d, a set $K$ of size $d+1$ whose subsets are almost all present in the first mountain. The load-bearing engine is Claim 5.2: every inclusion-maximal set $M$ of the first mountain contains at least three vertices whose degree inside that mountain is at most $2^d-m$. This assertion rules out sets larger than $d$, fixes the size of conglomerates, and drives all later degree estimates. Around it, a weighted version of the Kruskal-Katona theorem (Lemma 3.8) provides the local lower bounds comparing arbitrary mountains to initial segments of sets.","core_discovery":"The central claim is Theorem 1.1: for all $d\\ge m\\ge 1$, $\\alpha(2^d-m)=\\frac{2^{d+1}-m}{d+1}$, where $\\alpha(d)$ is the largest real number with the property that every simplicial complex $S$ satisfying $0<|S|\\le \\alpha(d)|V(S)|$ has some vertex of degree at most $d$. The companion Theorem 1.2 evaluates $\\alpha(11)=\\frac{53}{10}$. Upper bounds come from explicit constructions that delete a few large sets from a power set on $d+1$ vertices, while the lower bounds form the main body of the paper: if a complex has minimum degree greater than $2^d-m$, it must have more than $\\frac{2^{d+1}-m}{d+1}$ edges per vertex. The proof achieves this by weighting vertices, decomposing the complex into \\u201cconglomerates\\u201d, and applying a weighted form of the Kruskal-Katona theorem locally.","pith_inferences":["A stability version is plausible: complexes whose edge-to-vertex ratio is close to the threshold should be near the explicit \\u201cdeleted power set\\u201d construction, with most edges concentrated on a small number of conglomerates.","The weighted Katona lemma is a transferable tool: because it works for arbitrary monotone weights on order ideals, it may apply to other extremal problems on traces of set families.","A natural next step is to map the values of $\\alpha$ just above powers of two; the same mountain-and-conglomerate argument, with adjusted degree bounds, is the obvious tool to try."],"forward_implications":["For every $d$, the exact value of $\\alpha$ is now known throughout the interval $[2^d-d,\\,2^d]$.","Any simplicial complex with minimum degree at least $2^d-m+1$ must have more than $\\frac{2^{d+1}-m}{d+1}$ edges per vertex.","The value $\\alpha(11)=\\frac{53}{10}$ confirms the conjecture and completes the known table through $d=16$.","The formula genuinely stops at $m=d+1$: an explicit construction gives a smaller threshold just below the block, so the boundary is not an artifact of the method."],"supporting_citations":[{"why":"Supplies the original reduction from trace problems to minimum degree and the base case $m=1$.","marker":"[1]"},{"why":"Establishes the cases $m=2$ and $m=0$ and raises the conjecture settled by $\\alpha(11)$.","marker":"[2]"},{"why":"One of the two classical proofs of the Kruskal-Katona shadow theorem used in the local estimates.","marker":"[3]"},{"why":"Contains the weighted Katona result from which Lemma 3.8 is derived.","marker":"[4]"},{"why":"The other classical statement of the Kruskal-Katona theorem for shadows.","marker":"[5]"},{"why":"Introduces the cluster/conglomerate strategy and the previous parameter range that the new proof extends.","marker":"[7]"}],"fun_headline_variants":["All min-degree thresholds under powers of two, solved","Simplicial degree thresholds: every gap below 2^d filled","Exact alpha for all degrees just below powers of two","Minimum-degree barriers fall for entire blocks under 2^d","Near-power degrees fully classified for simplicial complexes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on Claim 5.2, the assertion that every inclusion-maximal set in the main mountain contains at least three vertices of degree at most $2^d-m$; if a boundary case allowed only two such vertices, the conglomerate decomposition and the lower bound would collapse.","fun_headline_variants_meta":{"raw":{"variants":["All min-degree thresholds under powers of two, solved","Simplicial degree thresholds: every gap below 2^d filled","Exact alpha for all degrees just below powers of two","Minimum-degree barriers fall for entire blocks under 2^d","Near-power degrees fully classified for simplicial complexes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000805,"raw_usage":{"total_tokens":3501,"prompt_tokens":876,"completion_tokens":2625,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":492,"completion_tokens_details":{"reasoning_tokens":2542}},"tokens_in":492,"tokens_out":2625,"duration_ms":18672,"temperature":1.0,"reasoning_tokens":2542,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:31:34.592048+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Search exhaustively for a simplicial complex with minimum degree at least $13$ and $|S|/|V|\\le 28/5$; Theorem 1.1 with $d=4$, $m=4$ says no such complex exists, so a single example would refute the claimed threshold.","supporting_citations":[{"cited_title":"Watanabe and P","cited_arxiv_id":null,"evidence_quote":"Establishes the cases $m=2$ and $m=0$ and raises the conjecture settled by $\\alpha(11)$."},{"cited_title":"Katona,A theorem of finite sets, Theory of graphs (Proc","cited_arxiv_id":null,"evidence_quote":"One of the two classical proofs of the Kruskal-Katona shadow theorem used in the local estimates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Contains the weighted Katona result from which Lemma 3.8 is derived."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The other classical statement of the Kruskal-Katona theorem for shadows."},{"cited_title":"Piga and B","cited_arxiv_id":null,"evidence_quote":"Introduces the cluster/conglomerate strategy and the previous parameter range that the new proof extends."}],"review_version":1}