{"id":"375d699f-5da1-415e-b925-3669a00b0054","arxiv_id":"2411.19163","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Random polytopes in products of balls with block-beta sampling have expected facet counts of order n^{(k-1)/(k+1)} (ln n)^{c}, bridging smooth and polytopal cases.","lead":"The paper studies random polytopes formed as convex hulls of many random points in products of Euclidean balls, and finds exact growth rates for the expected number of facets. These rates interpolate between the known smooth and polytopal extremes, unifying two previously separate regimes in random polytope theory.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2.4(2) rests on a uniform Laplace error term that is false when c x1...x_{ℓ-1} drops below 1/n; Steps 2 and 3 apply this lemma, so the exponents in Theorem 1.1 are not established as written.","rationale":"The reader's CONDITIONAL verdict is appropriate. I agree with the identified weakest assumption: Lemma 2.4(2)'s uniform error term is the pivot of the proof. The main theorem applies this lemma only after several variable substitutions, and no independent derivation is supplied. I refine the reader's formulation: the assertion that o_n(1) can be chosen independently of x1,...,x_{ℓ-1} is not just unproved but outright false as stated, because t = c x1...x_{ℓ-1} may be as small as n^{-2}, where J2 is not Laplace-dominated. The lemma itself may still be true because the small-t region is suppressed by the outer x-weights, but that suppression is exactly what must be proved; the present text does not provide it. The section-content display inconsistency in Section 4.1 appears to be a typo, since the next display contains the correct ^d, and the rest of the reduction, the Sylvester-functional bounds, and the max-over-permutations argument are structurally coherent. Known special cases (balls, cubes, cylinders) and the simulations in Figure 1.2 are consistent with the claimed rates. No machine-checked proof is available, so an independent check of Lemma 2.4(2) is the fastest way to settle the point. I therefore do not move the verdict: it remains conditional pending a corrected proof of the uniformity/splitting in Lemma 2.4(2).","tokens_in":36850,"tokens_out":34844,"duration_ms":297111,"concrete_test":"Test the actual asymptotics of Lemma 2.4(2) in a boundary-sensitive case: take α=0, m=3, ℓ=2, c=1, a_1=1.5, a_2=a_3=1, so the outer exponent a_1-a_2-1 = -0.5 is integrable but singular near 0. For t = x_1, evaluate exactly I_n = ∫_0^1 t^{3/2} ∫_0^1 ∫_0^1 (1 - t y z)^n yz dy dz dt using the incomplete-beta identity F_n(t) = (tn)^{-2}[Γ(2) log(tn) - Γ'(2) + o(1)] on the t ≥ ε_n part and explicit bounds on t ≤ ε_n, or by high-precision numerical integration at n = 10^4, 10^6. The lemma predicts I_n ∼ 2 n^{-2} log n. If the numerics match this, the uniformity failure is harmless and the theorem needs only a revised proof of the lemma; if the observed growth is n^{-1} (boundary-dominated), then the claimed exponent in Theorem 1.1 fails for this parameter choice and the main result collapses.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is Theorem 1.1, and its proof funnels through Lemma 2.4 after the meta-cube substitutions in Steps 2 and 3. In the proof of Lemma 2.4(2), the inner integral J2 is evaluated by Laplace's method with h(y) = -log(1 - t y), where t = c x1...x_{ℓ-1}. The paper asserts that the o_n(1) term can be chosen independently of x1,...,x_{ℓ-1}. This is not merely unproved; it is false on the domain [0,1]^{ℓ-1}. If t n is bounded (e.g., if t ≤ c/n), then J2(n;x) = ∫_0^{t(n-α)} (1 - z/(n-α))^{n-α} z^{a_ℓ} dz is of order (t n)^{a_ℓ+1}, while the asserted uniform leading constant Γ(a_ℓ+1)(n-α)^{a_ℓ+1}/n^{a_ℓ+1} is of order 1. The same obstruction appears in the intermediate expression involving (log(c x1...x_{ℓ-1}(n-α)))^{m-ℓ}, which can even be negative for small t when m-ℓ is odd. A correct proof must split the domain where t n is bounded away from infinity and show that this boundary region is negligible after the outer integration with weights x_i^{a_i-a_ℓ-1}. The paper provides no such estimate, so the derivation of the (ln n)^{#kmax-1} exponent and the threshold in Theorem 1.1 is incomplete. This is a proof gap rather than a demonstrated counterexample; special cases and simulations suggest the final formula, but the written argument does not establish it.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies random polytopes generated as convex hulls of n independent points from block-beta distributions on the product body Z_d = B_{d_1}^2 × ... × B_{d_m}^2. The main result (Theorem 1.1) asserts that the expected number of facets grows as n^{(kmax-1)/(kmax+1)} (log n)^{#kmax-1}, where k_i = (d_i+β_i)/(1+β_i) and kmax, #kmax are the maximum and multiplicity of the beta-adjusted dimensions. This unifies and interpolates the classical smooth case (power law, m=1) and the polytopal case (logarithmic, d_i=1). For the uniform distribution the paper also gives growth rates for all face numbers and for the expected volume difference (Corollary 1.2). The proof uses the Blaschke-Petkantschin formula, a reduction to a 'meta-cube' via polyspherical coordinates, geometric estimates for meta-caps and meta-sections, and an integral asymptotic lemma (Lemma 2.4) extending results of Affentranger-Wieacker.","tokens_in":37229,"tokens_out":16707,"duration_ms":162344,"significance":"If correct, the paper provides the first natural family of convex containers exhibiting the full interpolation between smooth and polytopal random-polytope behavior, with explicit exponents. It recovers known results for the Euclidean ball and the cube, and it gives a new class of bodies for which floating-body asymptotics can be read off from the Bárány-Larman inequalities. The meta-cube reduction is an elegant and potentially reusable idea. The proof is detailed and includes simulation support; the main obstacle is a gap in the proof of the integral-asymptotic lemma, which is repairable.","major_comments":[{"comment":"The proof of Lemma 2.4(2) is not complete as written. After the change of variables z = c x_1...x_{ℓ-1}(n-α)y, the inner integral J_2 is expressed as (c x_1...x_{ℓ-1}(n-α))^{a_ℓ+1} ∫_0^1 e^{-n h(y)} φ(y) dy with h(y) = -log(1 - c x_1...x_{ℓ-1} y). The proof invokes [50, Thm. II.1.1] and states that 'computing the second-order term in this expansion shows that the sequence o_n(1) can be chosen independently of x_1,...,x_{ℓ-1}'. This uniformity assertion is not justified and is pointwise false on the full domain: if t := c x_1...x_{ℓ-1} satisfies t n ≤ C, then J_2 is of order (t n)^{a_ℓ+1}, not of order Γ(a_ℓ+1). The paper provides no computation and no splitting of the outer integral over x_1,...,x_{ℓ-1} to show that the region where t n is bounded contributes negligibly after multiplication by the weight ∏ x_i^{a_i-a_ℓ-1}. Since Lemma 2.4(2) is applied in Steps 2 and 3 of the proof of Theorem 1.1 after several variable substitutions, the derivation of the (log n)^{#kmax-1} factor and the threshold in Theorem 1.1 is not established as written. This is a proof gap rather than a demonstrated counterexample; the final rates are plausible and consistent with special cases, but the authors should supply the missing boundary estimate or an alternative proof of the integral asymptotics.","section":"Lemma 2.4(2)"}],"minor_comments":[{"comment":"In the displayed reduction formula for E f_{d-1}(P^β_{n,d}) after applying Blaschke-Petkantschin and Lemma 3.1, the factor Vol_{m-1}(C(v,s); tilde β) appears without the exponent d. The correct expression, as used consistently in Steps 2 and 3, has Vol_{m-1}(C(v,s); tilde β)^d. Please correct the display.","section":"Section 4.1"},{"comment":"There are several typos: 'the the underlying model parameters' in the abstract, 'play significant role' and 'they used to model' in Section 1.1. These should be fixed.","section":"Abstract and Introduction"},{"comment":"The caption says 'n≤105'; this should read 'n≤10^5'.","section":"Figure 1.2"},{"comment":"The intermediate expression (log(c x_1...x_{ℓ-1}(n-α)))^{m-ℓ} is not positive on the whole domain for small x_i, especially when m-ℓ is odd. The asymptotic notation should be applied to absolute values or to the final integrated quantity, with the sign issue handled explicitly.","section":"Lemma 2.4(2) proof"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses an interesting and timely problem, and the main theorem is likely correct. However, the proof of Lemma 2.4(2) requires a substantial repair before the central claim can be considered established. The authors should also correct the missing exponent in the Section 4.1 display. I recommend major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The main new thing here is a genuinely new family of containers: products of Euclidean balls with block-beta sampling. The expected facet number gets a mixed power-log rate, n^{(kmax-1)/(kmax+1)} (log n)^{#kmax-1}, which interpolates between the smooth and polytopal regimes. The meta-cube reduction in Section 3 is the best part—it is a clever and useful piece of symmetry that reduces the geometry to an m-dimensional cube. The paper also recovers the known ball and cube cases as checks, and the simulations are reassuring. This is not a trivial extension; the interpolation phenomenon itself is the contribution.\n\nNow the soft spot, and it is load-bearing. Lemma 2.4(2) claims a Laplace expansion of J2 with an o_n(1) error that is uniform in x1,...,x_{l-1}. That uniformity assertion is false as stated. When t = c x1...x_{l-1} is small enough that t n is bounded, the inner integral is of order (t n)^{a_l+1}, not of order 1, and the claimed leading constant is off by a factor that blows up. The paper does not split off this boundary region or show it is negligible after the outer integration. Steps 2 and 3 use exactly this lemma to get the (log n)^{#kmax-1} exponent, so Theorem 1.1 is not established by the written argument. This is a proof gap, not a demonstrated counterexample—the theorem is very likely true—but it requires real work to fix. There is also a smaller presentation issue: the reduction formula in Section 4.1 has a missing or at least ambiguous d-th power on the section-content factor.\n\nFor a reader in stochastic geometry or random polytopes, the paper is worth knowing about for the meta-cube idea and the conjectured rates, even before the proof is repaired. I would send it to a serious referee rather than desk reject, but with the expectation of a major revision focused on Lemma 2.4(2). Personally, I would not cite the main theorem until the Laplace argument is corrected; I would cite the meta-cube reduction if I needed it.","headline":"New interpolating rates for random polytopes in products of balls, but the proof as written has a real gap in the key Laplace lemma.","tokens_in":37759,"tokens_out":4292,"would_cite":false,"duration_ms":40210,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52A22","52A27","60D05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Random polytopes in products of Euclidean balls are shown to grow at rates that interpolate between the smooth and polytopal regimes, with the rate determined by the largest adjusted block dimension.","keywords":["random polytopes","block-beta distribution","expected facet number","product body","meta-cube","floating bodies","affine surface area","interpolation"],"falsifier":"Numerically evaluate the product integrals in Lemma 2.4(2) for small n and m = 2 with a1 > a2 and c = 1, checking that the leading term's o_n(1) is uniform as the integration variables approach 0 and 1; alternatively, simulate E f_{d-1}(P_{n,d}) for uniform points in Z_{(2,2)} against Z_{(3,1)} and compare log-log slopes to the predicted $n^{{1/3}}$ ln n and $n^{{1/2}}$ rates.","tokens_in":36624,"feed_emoji":"📐","tokens_out":7450,"duration_ms":75653,"temperature":0.7,"pith_summary":"Random polytopes formed as convex hulls of n independent points behave very differently when the container is smooth, with facets growing like a power of n, and when it is a polytope, with facets growing like a power of log n. This paper aims to establish that one natural family of containers, products of Euclidean balls of possibly different dimensions, interpolates between these two regimes. Its main theorem states that for block-$\\beta$ distributed points the expected number of facets is of order $n^{{(kmax-1)/(kmax+1)}}$ (ln n)^{#kmax-1}, where k_i=(d_i+β_i)/(1+β_i) is the adjusted dimension of block i, and kmax and #kmax record the largest value and how many blocks attain it. The content of the formula is that the exponent of n is governed entirely by the dominant block, while an extra logarithmic factor appears exactly when several blocks tie for the maximum.","feed_headline":"Product-ball random polytopes bridge smooth and cubical facet growth","feed_subtitle":"Facet count scales as n^{(k-1)/(k+1)} (ln n)^{#k-1}, where k is the largest adjusted block dimension; ties add log factors.","key_machinery":"The load-bearing object is the meta-cube reduction. Because Z_d is invariant under the product group SO(d_1)×…×SO(d_m), every cap and section of Z_d is, up to a rotation, determined by a cap or section of the m-dimensional cube [-1,1]^m with a transformed block-$\\beta$ parameter; this turns a d-dimensional integral-geometry computation into a product of one-dimensional integrals over [0,1]^m. Those integrals are evaluated by an extended product-integral lemma (Lemma 2.4), and a Sylvester-type functional measuring the expected volume of a random simplex in a section is shown to be uniformly bounded away from zero (Lemma 3.5), so that only the cap-volume asymptotics drive the rate.","core_discovery":"The central claim is Theorem 1.1: for a container Z_d = ∏ B_{d_i}^2 and independent points with block-$\\beta$ density of parameter β_i in block i, set k_i = (d_i+β_i)/(1+β_i) ≥ 1. Then the expected number of facets satisfies E f_{d-1}(P^β_{n,d}) ≍ $n^{{(kmax-1)/(kmax+1)}}$ (ln n)^{#kmax-1}, where kmax = max_i k_i and #kmax counts the number of blocks attaining it. For uniform points (β = 0) the same rate holds for the expected number of j-faces for all j, and the expected missing volume satisfies Vold(Z_d) − E Vold(P_{n,d}) ≍ $n^{{-2/(dmax+1)}}$ (ln n)^{#dmax-1}, where dmax and #dmax are defined from the block dimensions. The paper interprets the extra logarithm as the number of surplus facets formed by connecting separate clusters of points that concentrate in the parts of the boundary corresponding to the maximal adjusted dimensions.","pith_inferences":["One testable extension is to replace the Euclidean ball factors by general smooth convex bodies: the paper's Conjecture 5.1 predicts the same rates, and the meta-cube argument suggests the mechanism is local cap structure rather than the exact Euclidean geometry.","In the β → −1 limit the block-beta density degenerates to the uniform measure on the sphere, and if the paper's Conjecture 5.4 holds the adjusted dimensions k_i exceed d_i, so a lower-dimensional block could dominate the exponent; this regime is currently unproved.","The tie-induced logarithm is reminiscent of ridge clustering in polytopal containers; one could probe whether, for B^k × B^k, most facets cluster near the ridge S^{k-1}×S^{k-1}, as the paper suggests, which would be a directly checkable geometric signature.","The open constant problem for m ≥ 2 likely requires analyzing non-vertex meta-cube configurations, so numerical evaluation of the constant for B^2 × B^2 could guide future work."],"forward_implications":["The cylinder B^{d-1} × [-1,1] has kmax = d-1, so E f_{d-1} ≍ n^{(d-2)/d}: a fractional power strictly between the smooth rate n^{(d-1)/(d+1)} and the polytopal rate (ln n)^{d-1}.","For a Lagrangian product B^k × B^k, the two blocks tie at kmax = k, producing E f ≍ n^{(k-1)/(k+1)} ln n; the logarithm appears only because of the tie.","In the uniform case, the expected volume difference is ≍ n^{-2/(dmax+1)} (ln n)^{#dmax-1}, transferring the facet-rate formula to volume approximation via the floating-body bounds.","For general β, a block with d_i = 1 gives k_i = 1 and can never be the dominant block; the polytopal cube regime (all k_i = 1, #kmax = d) is recovered as the extreme case.","Corollary 1.2 extends the facet rate to faces of dimension at least floor(d/2) − 1 for arbitrary block-beta distributions; the low-dimensional faces are controlled by the same rate only in the uniform case."],"supporting_citations":[{"why":"Supplies the original product-integral lemma that Lemma 2.4 extends to real-valued parameters; used to evaluate the asymptotic integrals.","marker":"[2]"},{"why":"Gives the smooth and polytopal facet asymptotics for random polytopes and the combinatorial framework that the paper's rates are compared against.","marker":"[37]"},{"why":"Provides the floating-body bounds linking random polytope volume and face numbers to caps, used to transfer Theorem 1.1 to arbitrary faces and volume.","marker":"[7]"},{"why":"Shows generic convex bodies oscillate between the two extremal rates, motivating the search for an interpolating family.","marker":"[4]"},{"why":"Establishes the beta-polytope case m = 1 that Theorem 1.1 recovers as a special case.","marker":"[28]"},{"why":"Supplies the Blaschke–Petkantschin formula and the integral-geometric framework used in the proof setup.","marker":"[44]"},{"why":"Gives the lower bound on the expected volume of a random simplex in a convex set, used to bound the Sylvester-type functional in Lemma 3.5.","marker":"[19]"},{"why":"Provides the face-number inequality used to extend the facet rate to all sufficiently high-dimensional faces in Corollary 1.2.","marker":"[24]"},{"why":"Gives the comparison of facets clustering near ridges in simple polytopes, the analogue of the tie phenomenon for product bodies.","marker":"[39]"}],"fun_headline_variants":["Product-ball polytopes interpolate facet growth between extremes","Block-beta polytopes: facet scaling bridges smooth and polytopal","Random polytopes in product balls: new facet rate interpolation","Facet counts interpolate from smooth to cubical for product balls","Volume and facet rates in random polytopes bridge container extremes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof leans on the claim in Lemma 2.4(2) that the error term in a second-order Laplace expansion is uniform in the integration variables; the paper asserts this uniformity without carrying out the computation, and it is applied after several coordinate substitutions in the proof of Theorem 1.1.","fun_headline_variants_meta":{"raw":{"variants":["Product-ball polytopes interpolate facet growth between extremes","Block-beta polytopes: facet scaling bridges smooth and polytopal","Random polytopes in product balls: new facet rate interpolation","Facet counts interpolate from smooth to cubical for product balls","Volume and facet rates in random polytopes bridge container extremes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000287,"raw_usage":{"total_tokens":1674,"prompt_tokens":925,"completion_tokens":749,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":541,"completion_tokens_details":{"reasoning_tokens":661}},"tokens_in":541,"tokens_out":749,"duration_ms":7760,"temperature":1.0,"reasoning_tokens":661,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T10:30:54.454186+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Numerically evaluate the product integrals in Lemma 2.4(2) for small n and m = 2 with a1 > a2 and c = 1, checking that the leading term's o_n(1) is uniform as the integration variables approach 0 and 1; alternatively, simulate E f_{d-1}(P_{n,d}) for uniform points in Z_{(2,2)} against Z_{(3,1)} and compare log-log slopes to the predicted $n^{{1/3}}$ ln n and $n^{{1/2}}$ rates.","supporting_citations":[{"cited_title":"Affentranger and J","cited_arxiv_id":null,"evidence_quote":"Supplies the original product-integral lemma that Lemma 2.4 extends to real-valued parameters; used to evaluate the asymptotic integrals."},{"cited_title":"Reitzner","cited_arxiv_id":null,"evidence_quote":"Gives the smooth and polytopal facet asymptotics for random polytopes and the combinatorial framework that the paper's rates are compared against."},{"cited_title":"Bárány and D","cited_arxiv_id":null,"evidence_quote":"Provides the floating-body bounds linking random polytope volume and face numbers to caps, used to transfer Theorem 1.1 to arbitrary faces and volume."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows generic convex bodies oscillate between the two extremal rates, motivating the search for an interpolating family."},{"cited_title":"Kabluchko, C","cited_arxiv_id":null,"evidence_quote":"Establishes the beta-polytope case m = 1 that Theorem 1.1 recovers as a special case."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the lower bound on the expected volume of a random simplex in a convex set, used to bound the Sylvester-type functional in Lemma 3.5."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the face-number inequality used to extend the facet rate to all sufficiently high-dimensional faces in Corollary 1.2."},{"cited_title":"Reitzner, C","cited_arxiv_id":null,"evidence_quote":"Gives the comparison of facets clustering near ridges in simple polytopes, the analogue of the tie phenomenon for product bodies."}],"review_version":1}