REVIEW 2 major objections 6 minor
Volumes and higher moments of cube slices and slabs are piecewise rational functions of the cutting parameters, with fourteen explicit formulas in four dimensions.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
A chamber decomposition of the sphere yields piecewise-rational volume and moment formulas for slices and slabs of polyhedral balls, including a complete 14-function family for the 4-cube and closed critical-point equations in dimension 2.
T0 review reviewed 2026-07-13 challenge →
load-bearing objection Solid computational extension of the authors’ chamber method that delivers the first complete 14-function volume catalogue for 4-cube slices/slabs plus closed arbitrary-order moments in dim 2; math and code check out. the 2 major comments →
Critical moments of slices and slabs of the cube (and other polyhedral norms)
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
Core claim
There is a finite chamber decomposition of the sphere times the non-negative reals such that, on each chamber, the M-th moment of every slice and every slab of a fixed polyhedral-norm ball is given by an explicitly computable rational function of the cutting parameters (a,t). For the four-dimensional cube the volumes alone are captured by exactly fourteen such functions modulo signed permutations.
What carries the argument
The sweep arrangement of a polytope, whose regions induce constant vertex orderings and whose maximal chambers keep the set of intersected edges fixed; barycentric triangulation of the resulting slices or slabs then converts each chamber into a single rational moment formula via the Baldoni–Berline–De Loera–Köppe–Vergne simplex-integration identity.
Load-bearing premise
Inside each chamber the combinatorial type of every slice and slab is constant, so a single triangulation works for the whole chamber and produces a globally valid rational expression on its closure.
What would settle it
For the four-dimensional unit cube, compute the volume of a slice whose normal and offset lie strictly inside one of the fourteen listed chambers by an independent numerical method (Monte-Carlo or exact polyhedral volume software) and check whether it matches the corresponding rational function to machine precision; a mismatch falsifies the claim that the fourteen formulas are complete and correct.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a unified algebraic–combinatorial framework for volumes and higher moments of slices and slabs of polyhedral norm balls. Building on the sweep-arrangement chamber decomposition of [BLM25] for slices, it extends the construction to slabs of centrally symmetric polytopes (Lemma/Theorem 6), combines it with the Baldoni–Berline–De Loera–Köppe–Vergne simplex-moment formula, and obtains a polynomial-time algorithm in fixed dimension (Theorem 1). On the unit cube it recovers the König–Koldobsky volume formulas in dimensions 2 and 3, produces a complete catalogue of fourteen rational volume formulas (modulo signed permutations) for the 4-cube (Theorem 2), gives closed-form M-th moments and critical-point equations for square slices (Theorem 3 / Proposition 10), and records higher moments through order 4 in dimensions 2–3 (with degree observations in Theorem 4). An algebraic ideal-theoretic approach to critical points is outlined in §2.5, with public Sage code and an extensive appendix of explicit formulas.
Significance. If the claims hold, the work supplies a systematic, machine-checkable pipeline for parametric volume and moment formulas of slices and slabs of any polyhedral norm ball, together with the first complete explicit catalogue for the 4-cube. Recovery of the classical 2- and 3-dimensional formulas is a strong consistency check; the public code and printed rational functions make the 4-cube catalogue reproducible. The fixed-dimension polynomial-time bound via the Upper Bound Theorem, the extension from slices to slabs, and the closed-form arbitrary-order moments for the square are genuine additions to computational convex geometry and geometric functional analysis. The critical-point analysis, while more complete in dimension 2 than in higher dimensions, gives a usable algebraic toolkit for extremal questions.
major comments (2)
- The abstract asserts that for the 4-cube the authors “identify candidate global maxima and minima for slice and slab volumes; the candidates are verified to be critical points by exact symbolic computation and are checked numerically to give the global extrema.” The body (§2.5, §3, Appendix) develops the algebraic critical-point framework and gives exhaustive formulas, but does not list the candidate points, the ideals or Gröbner bases used for the 4D verification, or the numerical sampling protocol that would justify “global.” Either add a short subsection (or appendix table) documenting the candidates and the exact/numeric checks, or temper the abstract claim to match what is actually proved (critical-point candidates from the chamber ideals, with numerical evidence of extremality).
- Theorem 2’s count of “exactly fourteen” distinct rational functions is obtained by enumerating chambers under the ordering a1≥⋯≥a4≥0 and inspecting the resulting expressions (proof of Theorem 2). Completeness therefore rests on the correctness and exhaustiveness of that enumeration. The public repository is cited, but the manuscript itself should state explicitly how many maximal chambers appear before symmetry reduction, how duplicates under signed permutation were detected, and that the fourteen expressions are pairwise non-identical as rational functions (not merely on overlapping domains). A one-paragraph verification protocol would make the count fully checkable from the text alone.
minor comments (6)
- Notation for the rational pieces (f_k^{(M,d)}, g_k^{(M,d)}) is introduced late and then frequently abbreviated by dropping superscripts; a short “Notation” paragraph at the start of §3 (as begun) should be expanded and used consistently in table captions.
- Remark 11 on evaluating slice formulas for non-unit vectors ā is important but easy to miss; a forward pointer from Tables 5 and 7 would help readers avoid incorrect numerical checks.
- Several displayed formulas in the Appendix (especially 4D slabs) are extremely long single-line expressions; breaking them or moving the heaviest ones entirely to the repository with a clear pointer would improve readability without loss of content.
- In Definition 2.2 and Lemma 5 the interval notation mixes open/closed conventions (0≤⟨a,vj⟩<t/2<⟨a,vj+1⟩ versus open chambers); a uniform convention for open chambers and closed closures would avoid edge-case ambiguity when invoking continuity.
- Typos / typesetting: “K¨onig” and similar accented names appear inconsistently; “��������” placeholders in the source should be replaced by the actual software names (SageMath, Macaulay2, OSCAR, HomotopyContinuation.jl) already listed in the references.
- Figure 3 and Figure 4 are helpful for the 2D second-moment example; adding a brief caption note that the black curve is the locus of interior critical points for fixed t would make the figures self-contained.
Circularity Check
No significant circularity: chamber construction is cited from prior work by overlapping authors, but volumes, moments, and the 4-cube catalogue are derived independently via triangulation and simplex integration.
specific steps
-
self citation load bearing
[Section 2.1, Definitions 2.1–2.2 and Lemma 5]
"Our main method builds on prior work concerning a combinatorial decomposition of the parameter space of all slices of a polytope. … We begin by introducing a construction that is central to our method. … Definition 2.2 (Maximal Chamber, [BLM25]). … Lemma 5 ([BLM25, Subsections 2.2 and 3.2])."
The finite chamber decomposition that indexes all rational pieces is taken from the authors' earlier paper [BLM25]. The present work does not re-prove existence or finiteness of the chambers; it only extends the same chambers to slabs and moments. This is ordinary self-citation of a foundational construction, not a circular reduction of the new claims (which are derived from triangulation + Eq. (5)).
full rationale
The paper's central claims (piecewise-rational moment formulas on a finite chamber decomposition of S^{d-1} imes R≥0, polynomial-time algorithm in fixed dimension, and the explicit 14-function catalogue for 4-cube volumes) are obtained by (i) the sweep-arrangement chambers of Defs. 2.1–2.2, (ii) combinatorial equivalence of slices/slabs inside each chamber (Lemma 5 / Theorem 6), (iii) barycentric triangulation whose vertices are rational functions of (a,t) by the edge-intersection formula (2), and (iv) the closed-form simplex-moment integral (5) from the independent reference [BBDL+11]. Continuity extends the expressions to closed chambers. No parameters are fitted to data; the recovery of the König–Koldobsky formulas is an a-posteriori consistency check, not an input. The sole self-citation that is load-bearing for the chamber construction is [BLM25]; everything beyond that construction (slabs, higher moments, critical-point ideals, 4-cube enumeration) is new and self-contained. Public Sage code and the Appendix catalogue further corroborate independence. Score 1 reflects only the minor, non-circular self-citation of the chamber framework.
Axiom & Free-Parameter Ledger
axioms (3)
- standard math The volume (or moment) of a simplex is given by the closed-form determinant / multinomial formula of Baldoni–Berline–De Loera–Köppe–Vergne (Eq. 5).
- domain assumption Any two slices (or slabs) belonging to the same maximal chamber of the sweep arrangement are combinatorially equivalent and admit a common triangulation whose vertices are rational functions of (a,t).
- standard math The number of maximal chambers of a polytope with n vertices in fixed dimension d is polynomial in n (O(n^{d(d-1)/2})).
Cite this review
Pith. "Pith review of Critical moments of slices and slabs of the cube (and other polyhedral norms)." pith.science (2026). https://pith.science/paper/LT2XDBCW
@misc{pith2026260325643,
author = {Pith},
title = {Pith review of: Critical moments of slices and slabs of the cube (and other polyhedral norms)},
year = {2026},
howpublished = {\url{https://pith.science/paper/LT2XDBCW}},
note = {Machine review of arXiv:2603.25643}
}
abstract
In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls. Our main method builds on prior work concerning a combinatorial decomposition of the parameter space of all slices of a polytope. We extend this framework to slabs, and find a polynomial-time algorithm in fixed dimension. We also exhibit computational methods to obtain moments of arbitrary order for all slices or slabs of any polyhedral norm ball, and an algebraic framework for analyzing their critical points. In addition, we present an experimental study of the $d$-dimensional unit cube. Our analysis recovers and reinterprets the known volume formulas for slabs and slices of the two- and three-dimensional cubes, first obtained by K\"onig and Koldobsky. Moreover, our method identifies a new complete family of fourteen rational functions giving the volumes of slices and slabs of the four-dimensional cube. We further compute explicit higher moments of slices and slabs in dimensions two and three, and derive explicit formulas for moments of arbitrary order for slices of the two-dimensional cube, describing their critical points. For the four-dimensional cube, we further use these formulas to identify candidate global maxima and minima for slice and slab volumes; the candidates are verified to be critical points by exact symbolic computation and are checked numerically to give the global extrema.
This paper was first reviewed by grok-4.5 on July 13, 2026.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.