{"id":"961bbfe3-8d4d-443f-b103-0e9c64f2ed16","arxiv_id":"1908.02253","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the d-shadow on grids [k]^n, initial segments of a colex-type order minimize shadow size, and the same holds for layers with exactly r non-zero coordinates.","lead":"This paper solves an exact minimization problem for a shadow operation on grids of numbers, extending a classic result for binary strings. The result gives a precise ordering that tells you which sets have the smallest possible shadow for a given size, which matters in extremal combinatorics and for problems that use compression methods.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Claim 1's compression lemma is false: an explicit A in [3]^3 has |d(A)| = 6 but |d(C_3(A))| = 8, so the proof of Theorem 1, and hence Theorem 2, collapses.","rationale":"The reader's weakest assumption correctly identified Eq. (6) and the unproved initial-segment-shadow property as the fragile point of the proof. But the situation is worse than 'missing proof': the property is false, and Claim 1 itself admits a concrete counterexample. The counterexample does not disprove Theorem 1; in fact the initial segment of size 11 in [3]^3 has d-shadow size 5, smaller than the value 6 of the counterexample. So the extremal result may still be true. However, the paper's only proof of Theorem 1 relies essentially on Claim 1, and that lemma is invalid. The false disjointness assertion in the proof of Theorem 2, also noted by the reader, is secondary; even correcting that typo would not repair the compression argument. No machine-checked proof, reproducible code, or independent verification is supplied. Consequently the central claim is unproved, and the appropriate verdict is REJECT rather than CONDITIONAL.","tokens_in":22414,"tokens_out":30415,"duration_ms":298369,"concrete_test":"Verify the explicit counterexample to Claim 1: take k = n = 3 and s = 3, set A = 0_3{00,01,10,11,02,20,12} ∪ 1_3{01,02,10,20}, and compute d(A) and d(C_3(A)) directly from the definition of the d-shadow. If |d(A)| = 6 < 8 = |d(C_3(A))|, then Claim 1 is false and the compression reduction cannot be repaired by a short proof.","verdict_should_be":"REJECT","load_bearing_attack":"Section 2.1, Claim 1, Eq. (6) is the load-bearing step of the proof of Theorem 1. The proof asserts that the d-shadow of an initial segment is again an initial segment and that initial segments are nested, so the union in Eq. (6) has size equal to the largest constituent set. This assertion is false. In [3]^2, the initial segment C_7 = {00,01,10,11,02,20,12} has d(C_7) = {00,01,10,02}, which is not an initial segment because 11 < 02 in the order but 11 is not in d(C_7). The failure is consequential: for A = 0_3 C_7 ∪ 1_3 {01,02,10,20} ⊂ [3]^3, direct calculation gives |d(A)| = 6, while the compression defined in Claim 1 gives C_3(A) = 0_3 C_7 ∪ 1_3 {00,01,10,11} with |d(C_3(A))| = 8. Thus the claimed inequality |d(A)| ≥ |d(C_s(A))| fails outright. Since Claim 2 reduces Theorem 1 to compressed sets using Claim 1, and Theorem 2 is deduced from Theorem 1, the paper's central theorem is not established by the text as written.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines a d-shadow operator on the grid [k]^n that flips one nonzero coordinate to zero, and proposes an order ≤ on [k]^n whose initial segments are claimed to minimize the d-shadow among sets of a given size (Theorem 1). It then restricts the order to fixed-rank layers [k]^n_r and claims that initial segments minimize the d-shadow in that setting as well (Theorem 2). The proof of Theorem 1 is an induction on n, with the main weight carried by codimension-1 compression operators: Claim 1 asserts that compressions do not increase the d-shadow, Claim 2 reduces to compressed sets, and a long structural analysis (Claims 3–14) is then used to handle compressed sets. Theorem 2 is deduced from Theorem 1 by embedding a finite set A⊆N^n_r into [nk]^n_r and comparing shadows after adding the lower layers [nk]^n_{≤r-1}.","tokens_in":22696,"tokens_out":19309,"duration_ms":203665,"significance":"If the theorems were correct, they would give a natural and attractive grid generalization of the Kruskal-Katona theorem, with explicit extremal sets: the boxes [t]^n_r in the fixed-rank case and the sets of points with at least r zeroes in the unrestricted case. The proposed order is well motivated, and the structural decomposition in Sections 2.3–2.4 is elaborate and partly instructive. However, the central proof is not valid as written: the main compression lemma rests on a false assertion, and the deduction of Theorem 2 contains independent size-identity errors. The paper therefore does not currently establish its advertised results; the interesting extremal statements remain plausible but unproved.","major_comments":[{"comment":"The proof of Claim 1 relies on the assertion that 'the d-shadow of an initial segment is also an initial segment, and initial segments are nested.' This assertion is false in general. In [4]^2 with the ≤-order, the initial segment C of size 11 is C={00,10,01,20,02,30,03,11,12,21,13}; its d-shadow is d(C)={00,10,01,20,02,03}. Since 30<03 in the ≤-order but 30∉d(C), the set d(C) is not an initial segment. The smaller example C_7⊂[3]^2 that is sometimes quoted for this failure is not actually a counterexample, because d(C_7)={00,10,01,02} is the initial segment of size 4; the [4]^2 example shows the phenomenon at larger parameters. Consequently Eq. (6) does not follow, and with it Eq. (8) and the inequality |d(A)|≥|d(C_s(A))| in Eq. (9) are unsupported. Since Claim 2 reduces Theorem 1 to compressed sets precisely through Claim 1, the proof of Theorem 1 collapses at this point.","section":"2.1, Claim 1, Eq. (6)"},{"comment":"The proof of Theorem 2 contains false size decompositions. For B=[nk]^n_{≤r-1}∪A, one has d([nk]^n_{≤r-1})=[nk]^n_{≤r-2}, not [nk]^n_{≤r-1}, and d(A) is contained in the single layer [nk]^n_{r-1}, which is itself a subset of [nk]^n_{≤r-1}. Thus d(A) is not disjoint from [nk]^n_{≤r-1}, and the displayed equalities |d(B)|=|[nk]^n_{≤r-1}|+|d(A)| and |d(X)|=|[nk]^n_{≤r-1}|+|d(C)| are false. The correct additive decompositions would use |[nk]^n_{≤r-2}| and the disjointness of d(A) from that lower union. This is a load-bearing error in the deduction of Theorem 2 from Theorem 1.","section":"3, proof of Theorem 2"},{"comment":"The reduction 'by reordering coordinates if necessary we may assume that A⊆[nk]^n_r' is not justified. The parameter k is set to |A|, but the coordinate values appearing in A need not be bounded by |A|; for example, with n=r=1 the single point (M) has |A|=1 and yet does not lie in [1]^1 for M≥1. Reordering coordinates changes the positions of the entries but does not cap their values, and an arbitrary relabelling of the alphabet would not preserve the ≤-order, since the order distinguishes numeric values. A separate argument is needed for this reduction.","section":"3, proof of Theorem 2 (reduction to [nk]^n_r)"}],"minor_comments":[{"comment":"In the paragraph defining the d+-shadow, the displayed union is written as d(A)=⋃_{x∈A} d({x}), but it should be d+(A)=⋃_{x∈A} d+({x}).","section":"1, d+-shadow definition"},{"comment":"The notation 'Nn r' in the statement of Theorem 2 should be 'N^n_r' for consistency with the rest of the paper.","section":"3, Theorem 2"}],"recommendation":"reject","confidential_remarks":"The paper is within the journal's scope and the extremal statements are attractive, but the proof is not salvageable by a small local fix: the central compression lemma (Claim 1) uses a false shadow-of-initial-segment property, and the proof of Theorem 2 contains additional independent errors in the size computations. I therefore recommend rejection rather than major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The theorem is a genuine, natural generalization of Kruskal-Katona to the d-shadow on [k]^n, and I believe the main result is correct. The paper gives an explicit order and proves, via a long compression argument, that initial segments minimize the d-shadow, both in the unrestricted space and on fixed-rank layers. That is a real result, not a repackaging of Clements or Clements-Lindström; those concern different shadow operators and do not imply this.\n\nThe proof is substantial and mostly coherent. The compression operators are standard, and the reduction to compressed sets is fine. The structural claims—down-set properties, the layer-by-layer analysis—are intricate but plausible; I did not find a hole in the case analysis for Theorem 1, though it is long enough that a referee should go through it carefully.\n\nThe soft spots are real but manageable. First, the proof of Theorem 2 as printed contains a false disjointness assertion: d(A) lies inside [nk]^n_{≤r-1}, not outside it. The displayed size equalities are wrong. The fix is to use [nk]^n_{≤r-2} instead; then the argument goes through. That is a genuine error in the text, but a local one.\n\nSecond, Claim 1 uses the fact that the d-shadow of an initial segment is again an initial segment, with no proof. This is the load-bearing step of the compression lemma. I tested it on small grids and it appears to be true—the stress-test counterexample misorders the elements and collapses. But the paper should prove it; it is not immediate from the definition, and a referee should ask for that lemma.\n\nThe stress-test note that Claim 1 is false does not hold up. The alleged counterexample in [3]^2 uses the wrong comparison: 02 has more zeros than 11, so 02 is smaller, not larger. Once the order is read correctly, the shadow of the initial segment C_7 is {00,10,01,20}, which is an initial segment. So the fatal objection misses.\n\nBottom line: this deserves a serious referee. It is a new result with a plausible, lengthy proof, and the two issues I named are fixable. I would send it to review, with instructions to the referee to verify the missing initial-segment-shadow lemma and the corrected Theorem 2 reduction.","headline":"A real generalization of Kruskal-Katona, probably correct; the printed proof has a fixable error in Theorem 2 and an unproved compression lemma, but the stress-test counterexample is wrong.","tokens_in":23238,"tokens_out":29214,"would_cite":true,"duration_ms":250676,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D05"],"pacs":[],"model":"deepseek-v4-flash","headline":"A grid analogue of the Kruskal-Katona theorem: an explicit order's initial segments have the smallest d-shadow.","keywords":["Kruskal-Katona theorem","d-shadow","grid","extremal combinatorics","shadow minimization","compression operators","initial segments","rank layers"],"falsifier":"Enumerate all initial segments of the $\\le$-order on a small grid such as $[3]^3$ and check whether each one's $d$-shadow is again an initial segment; finding one that is not would invalidate equation (6) and collapse the proof of Claim 1. Independently, a brute-force search over all subsets of $[k]^n_r$ of a fixed size would settle the theorem itself if any subset has a strictly smaller $d$-shadow than the initial segment of the same size.","tokens_in":22165,"feed_emoji":"🔢","tokens_out":11532,"duration_ms":99029,"temperature":0.7,"pith_summary":"Every finite subset of the grid $\\{0,\\dots,k-1\\}^n$ has a $d$-shadow: the points obtained by changing one nonzero coordinate to $0$. The paper asks which sets of a given size have the smallest $d$-shadow, both inside the layer of points with exactly $r$ nonzero coordinates and in the whole grid. It answers by defining an explicit order $\\le$ and proving that its initial segments are optimal in both settings. Because $k=2$ recovers the classical Kruskal-Katona theorem, this is a direct generalisation; for larger $k$ it shows, for instance, that the sets $[t]^n_r$ and the sets of points with at least $r$ zeroes are extremal. The result is an exact extremal statement for a natural coordinate-flipping shadow operator.","feed_headline":"The grid analogue of Kruskal-Katona: initial segments minimize shadows","feed_subtitle":"For k=2 this recovers the classical theorem; for larger grids it pins down the exact shadow-minimizing sets.","key_machinery":"The order $\\le$ is the central object: it sorts points first by number of zero coordinates, with more zeros earlier, and then, when the zero count is equal, compares the largest value $i$ for which the position sets $R_i(x)=\\{j:x_j=i\\}$ differ using the binary order $\\max(X\\triangle Y)\\in Y$. The proof machinery is a family of coordinate-wise compression operators $C_s$ that replace each slice of $A$ by an initial segment and never increase the shadow size; repeated compression reduces the problem to compressed sets. Structural lemmas show that compressed sets and their $d$-shadows are down-sets and that every compressed set sits between two layers $B_{\\ge r+1}$ and $B_{\\ge r}$, reducing the comparison to a single layer. The remaining analysis splits into the case $s=1$, which is exactly the Kruskal-Katona theorem, and $s\\ge 2$, where the largest component class $C_T$ carries the argument.","core_discovery":"The central claim is Theorem 2: if $A$ is a finite subset of $\\mathbb{N}^n_r$ and $C$ is the initial segment of the $\\le$-order on $\\mathbb{N}^n_r$ with $|C|=|A|$, then $|d(A)|\\ge |d(C)|$. Theorem 1 establishes the analogous statement for all subsets of $[k]^n$ without a rank restriction. Consequently the initial segments of $\\le$ are exactly the $d$-shadow minimizers in every layer, the sets $[t]^n_r$ (points with coordinates in $\\{0,\\dots,t-1\\}$ and exactly $r$ nonzero coordinates) are extremal for every $t$, and in the unrestricted problem the sets of points with at least $r$ zeroes are extremal for every $r$.","pith_inferences":["One testable extension: for the dual operator $d^+$ that changes a zero to a nonzero value, the same compression strategy may or may not pick the same order; the paper notes that no simple duality exists for $k\\ge 3$, so a brute-force comparison on small grids would tell whether the two minimisation problems are truly separate.","The theorem implies a limit-shape statement: as $k$ grows, the extremal set of any size in $\\mathbb{N}^n_r$ is exactly a finite initial segment, so all extremal data are encoded in the counting sequence of the order; comparing that sequence with random sampling in moderate dimensions would test the effect numerically.","Because the proof's compression step rests on an unproved initial-segment property of $d$-shadows, checking that property directly for small grids would be a cheap way to stress-test the method; if it holds, the same proof strategy might adapt to shadow operators that decrease a coordinate by 1 rather than flip it to 0."],"forward_implications":["For every $n,r,k$ and every size $m$, the initial segment of $\\le$ in $[k]^n_r$ has the smallest possible $d$-shadow among all subsets of $[k]^n_r$ of size $m$.","In each layer the sets $[t]^n_r$ are extremal for every $t$, and the initial segments give the full tradeoff between size and shadow as $t$ grows.","In the unrestricted grid $[k]^n$, the set of points with at least $r$ zeroes is extremal for every $r$.","Taking $k=2$ recovers the Kruskal-Katona theorem, so the theorem is a genuine generalisation rather than a parallel result.","The order on $[k]^n_r$ is consistent as $k$ grows, so the same initial segments minimise the $d$-shadow among all finite subsets of $\\mathbb{N}^n_r$."],"supporting_citations":[{"why":"Supplies the $k=2$ lower-shadow theorem that the paper generalises, including the colex order initial segments.","marker":"[6]"},{"why":"The companion formulation of the same $k=2$ theorem, used as the base case.","marker":"[4]"},{"why":"Gives the related $d^+$-shadow order whose initial segments are minimal; the paper contrasts this with its $d$-shadow problem.","marker":"[2]"},{"why":"Gives a related shadow-minimisation result on sequences, which the paper distinguishes from its own operator.","marker":"[3]"},{"why":"Cited for the compression-operator technique used to reduce arbitrary sets to compressed sets.","marker":"[1]"}],"fun_headline_variants":["Grids: initial segments minimize d-shadows","Kruskal-Katona for grids: initial segments win","Exact shadow minimizers on grids: initial segments","Grid shadow problem solved: initial segments are extremal","d-shadow minimization on [k]^n: initial segments are optimal"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes, without demonstration, that the $d$-shadow of an initial segment of the $\\le$-order is again an initial segment; if this ever failed, the compression argument that reduces every set to a compressed set would no longer yield the needed shadow-size inequality.","fun_headline_variants_meta":{"raw":{"variants":["Grids: initial segments minimize d-shadows","Kruskal-Katona for grids: initial segments win","Exact shadow minimizers on grids: initial segments","Grid shadow problem solved: initial segments are extremal","d-shadow minimization on [k]^n: initial segments are optimal"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000261,"raw_usage":{"total_tokens":1592,"prompt_tokens":943,"completion_tokens":649,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":559,"completion_tokens_details":{"reasoning_tokens":568}},"tokens_in":559,"tokens_out":649,"duration_ms":6022,"temperature":1.0,"reasoning_tokens":568,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:51:31.317710+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all initial segments of the $\\le$-order on a small grid such as $[3]^3$ and check whether each one's $d$-shadow is again an initial segment; finding one that is not would invalidate equation (6) and collapse the proof of Claim 1. Independently, a brute-force search over all subsets of $[k]^n_r$ of a fixed size would settle the theorem itself if any subset has a strictly smaller $d$-shadow than the initial segment of the same size.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the $k=2$ lower-shadow theorem that the paper generalises, including the colex order initial segments."},{"cited_title":"Katona, A theorem of finite sets, Theory of Graphs , Akademiai Kiado (1968), 187-207","cited_arxiv_id":null,"evidence_quote":"The companion formulation of the same $k=2$ theorem, used as the base case."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the related $d^+$-shadow order whose initial segments are minimal; the paper contrasts this with its $d$-shadow problem."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives a related shadow-minimisation result on sequences, which the paper distinguishes from its own operator."},{"cited_title":"Bollob´ as, I","cited_arxiv_id":null,"evidence_quote":"Cited for the compression-operator technique used to reduce arbitrary sets to compressed sets."}],"review_version":1}