{"id":"31f5561d-ece7-42de-8efc-4ab7de4e221c","arxiv_id":"2512.12757","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For hyperplane arrangements in R^d, the maximum number of minimum-volume d-simplices is Θ_d(n^d), and the guaranteed subset with all-distinct simplex volumes is o(n) in every dimension.","lead":"This paper counts special shapes (d-simplices) formed by n hyperplanes in d-dimensional space: how many can have equal volume, and how many can be forced to have all different volumes. It proves the number of minimum-volume shapes is Θ(n^d), and that the guarantee of all-different volumes is always o(n).","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.3's upper bound relies on an unproved configuration lemma: for two tangent hyperplanes T,T' to the same branch, T' cuts τ and τ' equals half of τ plus a Shannon cell. This is asserted, not proved, and without it the O_d(n^d) bound fails.","rationale":"The reader's verdict is CONDITIONAL with the weakest assumption being exactly the unproved geometric configuration lemma in the higher-dimensional upper-bound proof of Theorem 1.3. After independent review of Section 3, I find this is indeed the most load-bearing concern: the asserted 'simpler approach' skips the detailed verification that was provided in the 3D case (Claim 1), and the specific decomposition of τ' into a half-τ and a Shannon cell is a strong structural claim that is not a consequence of Shannon's theorem alone. The paper's other results (Theorems 1.1, 1.2, 1.4, 1.5) are less affected: Theorem 1.1's incidence argument is plausible, the lower bound for m_d(n) is explicit, and the construction for D_d(n) is a clear generalization of the planar spiral. But the asymptotic classification m_d(n)=Θ(n^d) cannot be accepted without a proof of the configuration lemma. My assessment does not move the verdict away from CONDITIONAL; it confirms that the reader's identified concern is real and should be resolved before acceptance. An explicit computational test in low dimension would settle whether the lemma is true in the needed generality.","tokens_in":12382,"tokens_out":3838,"duration_ms":36818,"concrete_test":"Test the configuration lemma in R^4 with explicit coordinates. Take H_i={x_i=0}, C_R: x_1 x_2 x_3 x_4=1 in the positive orthant, and choose two tangent points p,p' with distinct positive coordinates (e.g., p=(1,1,1,1), p'=(2,3,1,1)). Compute the tangent hyperplanes T=T_p(C_R), T'=T_{p'}(C_R), and the simplices τ=conv(0, d p_i e_i) and τ'=conv(0, d p'_i e_i). (i) Check whether the hyperplane T' intersects the interior of τ. (ii) Compute the arrangement of {H_1,...,H_4,T,T'} and identify its two d-simplicial cells via Shannon's theorem. (iii) Check whether τ' equals the union of one half of τ (cut by T') and one of those cells. If this fails for a generic pair p,p', the asserted configuration is false; if it holds only for special pairs, the proof needs to show it holds for all pairs that can arise in a minimum-volume configuration.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The upper-bound proof of Theorem 1.3 (Section 3) argues that for a fixed branch C_R, at most 2^d hyperplanes can form a minimum-volume d-simplex with the d coordinate hyperplanes, giving the O_d(n^d) bound. The key step is the paragraph beginning 'It turns out that an even simpler approach works for higher dimensions...'. There, for two tangent hyperplanes T and T' of C_R with simplices τ and τ', the author asserts: (1) 'Clearly, T' must pass through the interior of τ'; (2) the two d-simplicial cells σ1, σ2 guaranteed by Shannon's theorem do not intersect τ; and (3) 'τ' can be expressed as the union of one of R1,R2 and one of σ1,σ2.' These claims are neither proved nor derived from the earlier 3D argument (Claim 1). In the 3D case, the analogous statement required a lengthy coordinate-based proof; no such proof appears for d≥4. Moreover, premise (3) is a strong structural statement about the arrangement of d+2 hyperplanes: it asserts that the simplex τ' (formed by H_1,...,H_d,T') decomposes into exactly one half of τ and one Shannon cell, rather than, say, several cells. This is not justified by Shannon's theorem or any cited lemma. If this configuration lemma is false or unproved, the upper-bound proof collapses to the trivial O_d(n^{d+1}), and the central theorem m_d(n)=Θ_d(n^d) is unsupported. The concern is load-bearing because the entire constant-order bound for each d-tuple depends on it.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces dual versions of Erdős-type extremal problems: instead of volumes determined by points, it studies volumes of d-simplices determined by hyperplane arrangements in R^d. The main results are Theorem 1.1 (an upper bound for the number of unit-volume d-simplices), Theorem 1.2 (an Ω_d(n^d) lower bound for the same quantity), Theorem 1.3 (the claimed Θ_d(n^d) bound for the number of minimum-volume d-simplices), Theorem 1.4 (a linear lower bound for maximum-volume tetrahedra in R^3), and Theorem 1.5 (upper bounds for the largest subset of hyperplanes all of whose induced d-simplices have distinct volumes, derived from bounds on arithmetic progressions). The central technical claim is Theorem 1.3, whose proof combines a tangent-hypersurface branch argument for the upper bound and a Coxeter–Freudenthal–Kuhn triangulation construction for the lower bound.","tokens_in":12810,"tokens_out":20591,"duration_ms":194116,"significance":"If correct, Theorem 1.3 would be the first determination, up to constant factors, of the number of minimum-volume d-simplices in hyperplane arrangements for every d, extending Damásdi et al.'s planar result in a natural way. Theorem 1.5 gives the first nontrivial upper bounds for the distinct-volume subset problem in this dual setting, connecting it to Szemerédi-type results via a clean construction. The paper also gives explicit, checkable constructions in Section 2 and Section 5, and it makes appropriate use of external theorems (Bézout, Kővári–Sós–Turán, Shannon, Green–Tao, Leng–Sah–Sawhney). However, the proofs of the two most significant results, Theorems 1.3 and 1.4, contain substantial unproved geometric assertions, and the lower-bound construction for Theorem 1.3 is not in general position. These issues must be addressed before the results can be considered established.","major_comments":[{"comment":"The d≥4 proof of the O_d(n^d) upper bound in Theorem 1.3 rests on an unproved configuration lemma. For two tangent hyperplanes T,T' to the same branch C_R, the manuscript asserts without proof that: (i) T' passes through the interior of the simplex τ determined by H_1,...,H_d,T; (ii) the two Shannon cells σ_1,σ_2 do not intersect τ; and (iii) τ' is the union of one half of τ and one of σ_1,σ_2. These are not consequences of Shannon's theorem, which only guarantees the existence of two simplicial cells in an arrangement of d+2 hyperplanes and says nothing about their position relative to τ. The step 'Therefore neither σ_1 nor σ_2 intersects τ' is especially unclear: a Shannon cell could be a proper subcell of one of the regions R_1,R_2 cut out by T' in τ. The 3D Claim 1 does not supply a proof for d≥4, and its own first sentence—'the interior of the face \\tilde{T} of τ intersects T'—is al","section":"§3, upper bound (pp. 8–9, paragraph beginning 'It turns out that an even simpler approach works...')"},{"comment":"The lower-bound construction for m_d(n) is not in general position. It uses d(n+1) parallel hyperplanes x_i=k and C(d,2)(2n−1) hyperplanes x_p−x_q=t, which contain many parallel pairs and higher-order concurrencies. This violates the definition of general position given in Section 1. If m_d(n) is intended to be the maximum over general-position arrangements—as the upper-bound proof and the phrasing of Question 1 suggest—then this construction is inadmissible. A small perturbation to general position could destroy the exact equality of all d!·n^d CFK simplices, so a separate argument is needed to produce Ω_d(n^d) equal-volume minimum simplices in general position. Alternatively, the paper must explicitly define m_d(n) for arbitrary arrangements and adapt the upper-bound proof accordingly.","section":"§3, lower bound (CFK construction)"},{"comment":"The proof of M_3(n)>7/6 n−O(1) is not a proof as written. Proposition 4.2 is justified only by a description of a figure ('rectangular boxes cross each other as shown in Figure 4'), and the existence of a 'star-shaped badge' arrangement with 6 planes and 5 maximum-volume tetrahedra is simply observed from Figure 5. No coordinates, volume computations, or verification that no other tetrahedra have larger volume are supplied. The gluing argument distinguishes cases 'one, three, or two planes' but does not prove that the required affine transformations and translations can actually be performed to realize those cases. Consequently, the claimed lower bound for M_3(n) is unsupported.","section":"§4, Theorem 1.4"}],"minor_comments":[{"comment":"The proposition states D_d(n)<r_{d+2}(n), but the proof establishes only that every subfamily of size r_{d+2}(n)+1 contains two equal-volume d-simplices, which gives D_d(n)≤r_{d+2}(n). The strict inequality is not derived. The asymptotic upper bounds in Theorem 1.5 follow from the non-strict bound, so the statement should be corrected or a justification for strictness added.","section":"§5, Proposition 5.1"},{"comment":"There is a typo: '2d connected branches in total' should be '2^d connected branches in total.' Also, the bipartite graph setup says 'vertex set H × P_d' but the intended bipartition is H ∪ P_d; please correct the notation.","section":"§2, proof of Theorem 1.1"},{"comment":"In the odd-dimensional case, the claim that the affine hulls H_i are hyperplanes of dimension d−1 and that the arrangement is in general position is stated only as 'one can verify.' A short proof or an explicit genericity argument should be included.","section":"§5, odd d construction"},{"comment":"The first sentence of the proof of Claim 1 ('the interior of the face \\tilde{T} of τ intersects T′') is not proved; it may be derivable by a coordinate calculation from xyz=2V_0/9, but as written it is an unstated geometric fact. Since the higher-dimensional argument relies on an analogous but stronger 'clear' assertion, this base-case assumption deserves an explicit proof as well.","section":"§3, 3D base case"}],"recommendation":"major_revision","confidential_remarks":"The manuscript has the shape of a promising extended abstract: the high-level ideas are natural and several components (the incidence proof of Theorem 1.1, the AP construction for Theorem 1.5, the CFK lower bound) are checkable. The decisive gaps are in the geometric configuration lemmas of Sections 3 and 4. I would not recommend rejection if the authors can supply rigorous proofs of those lemmas, but the central claims are not presently established."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Couple of things you should know. The paper gives the first higher-dimensional bounds for the dual simplex-volume problems. The two results I trust most are the CFK triangulation lower bound m_d(n) ≳ n^d and the D_d(n) < r_{d+2}(n) bound, which with Green–Tao and Leng–Sah–Sawhney gives sublinear D_d. Both arguments are explicit and checkable. The even/odd constructions for D_d are a neat use of volume-preserving rotations, and they are written carefully enough to verify.\n\nThe unit-volume upper bound f_d(n) = O_d(n^{d+1 - d/(d^d+1)}) also checks out: the bipartite graph plus KST plus Bezout argument is standard and correct, though it is only a small improvement over the trivial O(n^{d+1}).\n\nNow the soft spots, in proportion. The upper bound in Theorem 1.3 is the load-bearing part of the paper's headline result m_d = Θ(n^d), and it is not proved. The proof in Section 3 moves to general d with: 'It turns out that an even simpler approach works...', then asserts three things about two tangent hyperplanes T,T' to the same branch: that T' passes through the interior of τ, that the Shannon cells σ1, σ2 do not intersect τ, and that τ' is exactly the union of one half of τ and one Shannon cell. The first claim is easy to verify with coordinates, as is the second given the first and minimality. But the third is a structural assertion about the arrangement of d+2 hyperplanes that does not follow from Shannon's theorem alone. In the 3D case the paper gives a long coordinate argument; in general d it gives none. The stress-test note is right: without a proof of this configuration lemma, the O_d(n^d) upper bound is unsupported. This is an addressable gap — I don't see an actual counterexample — but it has to be filled.\n\nThe other weak part is Theorem 1.4, the 7n/6 lower bound for maximum-volume tetrahedra. The proof is a sequence of 'we can arrange', 'we observe', 'see Figure 4' statements. The visual idea is plausible, but there is no quantitative verification of the gluing process. That result is less central, but as written it is not convincing.\n\nThe paper is clearly the work of someone who knows the area. The reader's significance score of 5 feels right, not higher. For peer review: send it. The distinct-volume result and the CFK lower bound are real contributions, and the upper-bound gap can be tested in revision. I would want a full proof of the configuration lemma and a cleaned-up Section 4 before accepting.","headline":"Solid lower bound and D_d result, but the upper bound for m_d relies on an unproved configuration lemma; worth refereeing but needs a real fix.","tokens_in":13316,"tokens_out":15110,"would_cite":true,"duration_ms":133371,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52C35","52C45"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that any n hyperplanes in R^d give at most Θ(n^d) minimum-volume d-simplices, and some arrangements attain that order.","keywords":["hyperplane arrangements","simplex volumes","distinct distances","unit distances","minimum-volume simplices","arithmetic progressions","extremal combinatorics"],"falsifier":"Construct, for d=3, an arrangement of planes where two distinct tangent planes to the same branch of xyz=c produce tetrahedra of the same minimum volume with the coordinate planes in the same octant; such a pair would violate the configuration lemma and show that the current proof of the O(n^3) upper bound for m_3(n) is incomplete.","tokens_in":12281,"feed_emoji":"📐","tokens_out":8867,"duration_ms":77582,"temperature":0.7,"pith_summary":"Hyperplanes are the flat (d-1)-dimensional slices of d-dimensional space. Any d+1 of them, in general position, enclose a d-simplex—the d-dimensional version of a triangle. This paper studies the dual of two classical point-set questions: instead of asking how many distinct distances or unit distances n points determine, it asks how many distinct volumes or unit-volume simplices n hyperplanes determine. The main result settles the order of magnitude of the maximum number of minimum-volume d-simplices: it is Θ(n^d) in every dimension. It also shows that the maximum number of unit-volume simplices lies between n^d and n^{d+1-d/(d^d+1)}, and that no arrangement can force a subset of size proportional to n whose induced simplices all have distinct volumes. These are the first such dual bounds valid for all dimensions.","feed_headline":"n hyperplanes make Θ(n^d) minimum-volume simplices","feed_subtitle":"Settling the dual distance problem up to constants in every dimension; distinct-volume subsets stay sublinear.","key_machinery":"The core object is an algebraic hypersurface C_R: after affine transforming d chosen hyperplanes to the coordinate planes x_i=0 and fixing a region R, the branch of ∏ x_i = constant is the set of points whose tangent hyperplanes form a d-simplex of exactly the minimum volume with the coordinate planes. Upper bounds for m_d(n) come from controlling tangencies of the arrangement's hyperplanes to these branches, using projective duality and a standard extremal bound for bipartite graphs with no large complete bipartite subgraph. The distinct-volume result uses a family of volume-preserving affine maps T_D that shift each hyperplane H_i to H_{i+1}; because T_D preserves volume, any (d+2)-term ar","core_discovery":"The paper's central theorem (Theorem 1.3) states that m_d(n), the largest number of minimum-positive-volume d-simplices determined by n hyperplanes in general position in R^d, is Θ_d(n^d). The upper bound is proved by fixing any d hyperplanes with a common point and considering the 2^d regions they cut out; in each region, a degree-d hypersurface parametrizes the hyperplanes that form a minimum-volume simplex with the fixed d. The proof asserts that at most a bounded number of the remaining arrangement hyperplanes can be tangent to that surface in a given region, so the total count is at most a constant times the number of d-subsets of the hyperplanes. The lower bound uses an explicit grid a","pith_inferences":["The upper-bound proof of m_d(n) relies on an unproved configuration assertion about how two tangent hyperplanes and the simplicial cells of the arrangement of d+2 hyperplanes are positioned; if that configuration fails, the O_d(n^d) bound for m_d(n) would still be plausible but would require a different proof.","The volume-preserving shift construction suggests a geometric analogue of additive-combinatorial phenomena: arrangements with few repeated simplex volumes behave like sets of integers with few arithmetic progressions, hinting at deeper structure connecting extremal geometry and additive combinatorics.","The grid-and-diagonal lower-bound construction for m_d(n) is explicit; testing small-dimensional variants computationally, especially in R^3, could reveal whether the d! constant is tight or whether more elaborate arrangements can exceed it.","The maximum-volume tetrahedron lower bound M_3(n)>7n/6 indicates that the point-set linear bound for maximum-area triangles does not carry over to hyperplane duals, and suggests that the extremal rate for M_d(n) may be superlinear in higher dimensions."],"forward_implications":["If m_d(n)=Θ(n^d), then the number of minimum-volume simplices is on the order of the number of d-subsets of hyperplanes, meaning each d-subset contributes only a bounded number of such simplices on average.","The explicit grid-and-diagonal construction yields an arrangement with about d^2 n hyperplanes and d! n^d minimum-volume simplices, so the constant in the lower bound is explicit and independent of how the arrangement is chosen.","The unit-volume count f_d(n) is now pinned between n^d and n^{d+1-d/(d^d+1)}, reducing the gap from a factor n to a factor n^{1-d/(d^d+1)}.","The sublinear bound on D_d(n) means every arrangement of n hyperplanes contains a large subset (proportional to n) whose induced simplices cannot all have distinct volumes; this is the dual analogue of the known point-set phenomenon.","Any improvement in upper bounds for arithmetic-progression-free sets in [n] immediately transfers to a better upper bound for D_d(n)."],"fun_headline_variants":["Minimum-volume simplices from n hyperplanes scale as n^d","Hyperplane arrangements yield Θ(n^d) minimum-volume simplices","Dual distance problem settled: min-volume simplices are Θ(n^d)","n hyperplanes determine Θ(n^d) minimum-volume simplices","Settling dual Erdős: min-volume simplices from n hyperplanes are Θ(n^d)"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The upper-bound proof of Theorem 1.3 depends on an unproved geometric configuration assertion: for any two tangent hyperplanes to a fixed branch surface C_R and the arrangement they form with the d coordinate hyperplanes, the two guaranteed simplicial cells lie outside the smaller simplex and the larger simplex is the union of a half of the smaller one with a cell, forcing a volume contradiction.","fun_headline_variants_meta":{"raw":{"variants":["Minimum-volume simplices from n hyperplanes scale as n^d","Hyperplane arrangements yield Θ(n^d) minimum-volume simplices","Dual distance problem settled: min-volume simplices are Θ(n^d)","n hyperplanes determine Θ(n^d) minimum-volume simplices","Settling dual Erdős: min-volume simplices from n hyperplanes are Θ(n^d)"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000243,"raw_usage":{"total_tokens":1333,"prompt_tokens":678,"completion_tokens":655,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":422,"completion_tokens_details":{"reasoning_tokens":555}},"tokens_in":422,"tokens_out":655,"duration_ms":6226,"temperature":1.0,"reasoning_tokens":555,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T16:35:05.963650+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct, for d=3, an arrangement of planes where two distinct tangent planes to the same branch of xyz=c produce tetrahedra of the same minimum volume with the coordinate planes in the same octant; such a pair would violate the configuration lemma and show that the current proof of the O(n^3) upper bound for m_3(n) is incomplete.","supporting_citations":[],"review_version":1}