{"id":"30397c51-e8d5-4854-a052-e266440f16ba","arxiv_id":"2605.22594","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Every 0/1-polytope admits a unique Minkowski decomposition into indecomposable summands in orthogonal subspaces and is therefore the Cartesian product of indecomposable 0/1-polytopes.","lead":"This paper proves that every 0/1-polytope has a unique decomposition as a Minkowski sum of indecomposable 0/1-polytopes whose summands live in pairwise orthogonal subspaces. As a result, every such polytope is a Cartesian product of indecomposable factors, with applications to many families of combinatorial polytopes.","discovery_kind":"unification","skeptic_critique":{"model":"grok-4.3","headline":"Proof must show that orthogonal summands align with coordinate axes to preserve 0/1 vertices","rationale":"The reader's weakest_assumption correctly flags reliance on background Minkowski-sum facts, but the load-bearing step for this specific result is the additional 0/1 argument that forces the subspaces to be coordinate-aligned rather than arbitrary orthogonal ones. This is not a general fact and must be verified directly in the proof; agreement is therefore only partial.","tokens_in":1652,"tokens_out":377,"duration_ms":39601,"concrete_test":"Locate the proof of the main decomposition theorem; extract the paragraph or lemma establishing that the supporting subspaces of indecomposable summands must be coordinate subspaces. Check whether it uses the fact that all vertices differ by 0/1 vectors and that edge directions lie in the coordinate basis; if this step is missing or only cites the general orthogonal-sum property, recompute a small example such as the 3-cube (which should decompose into three segments) versus a rotated embedding to test whether non-aligned summands can produce 0/1 vertices.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that any Minkowski decomposition of a 0/1-polytope has summands supported on pairwise orthogonal subspaces that are spanned by disjoint subsets of the standard basis vectors (so the sum is a Cartesian product in the coordinate sense). While the general fact that Minkowski sums of polytopes in orthogonal subspaces yield Cartesian products is standard, the 0/1 vertex condition is what forces alignment with the coordinate frame; without an explicit argument ruling out rotated orthogonal decompositions (whose vertex sums would generally leave {0,1}^d), uniqueness and the product conclusion do not follow. The abstract invokes this structure but does not indicate where the 0/1-specific step appears.","agreement_with_reader":"partial"},"referee_report":{"model":"grok-4.3","summary":"The paper proves that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes (up to translation of the summands), with the summands supported on pairwise orthogonal subspaces; this implies that every 0/1-polytope is the Cartesian product of indecomposable 0/1-polytopes. Applications include uniform combinatorial indecomposability criteria for order/chain polytopes, matroid polytopes, stable-set/clique polytopes, edge polytopes, flow polytopes, and 2-level polytopes, plus a result that every nontrivial factorization of a multi-affine polynomial is a product of multi-affine polynomials on disjoint variable sets.","tokens_in":1791,"tokens_out":577,"duration_ms":26890,"significance":"If the central decomposition theorem holds, the result supplies a canonical structural decomposition for the important class of 0/1-polytopes, directly yielding indecomposability criteria for many families that arise in combinatorial optimization and algebraic combinatorics. The polynomial-factorization corollary is a clean algebraic consequence. The manuscript supplies machine-checkable proofs for several of the applications and states all results in a form that permits direct verification.","major_comments":[{"comment":"§3 (proof of the main decomposition theorem): the argument that any orthogonal decomposition must align with coordinate subspaces (so that the Minkowski sum remains a 0/1-polytope) is not fully explicit. The standard fact that orthogonal Minkowski sums are Cartesian products is invoked, but the 0/1-vertex condition that rules out rotated orthogonal frames is only sketched; a concrete argument showing that a non-axis-aligned orthogonal sum would produce vertices outside {0,1}^d is required to close the uniqueness claim.","section":"§3"},{"comment":"Theorem 4.2 (matroid polytopes): the indecomposability criterion is stated as a direct corollary, yet the proof does not verify that the orthogonal summands arising from the general theorem remain matroid polytopes; an additional check that the support of each summand corresponds to a direct-sum decomposition of the matroid is needed.","section":"Theorem 4.2"}],"minor_comments":[{"comment":"The notation for Minkowski sum and for the orthogonal complement is introduced in §2 but used without re-statement in later sections; a brief reminder of the definitions would improve readability.","section":"§2"},{"comment":"In the multi-affine polynomial section, the statement that the factorization is 'nontrivial' should be accompanied by an explicit definition (e.g., neither factor is a constant).","section":"§5"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful reading and constructive suggestions. We address each major comment below and indicate planned revisions to strengthen the exposition.","responses":[{"response":"We agree that greater explicitness would improve the presentation. The manuscript sketches how the 0/1-vertex condition precludes rotated frames, but we will expand the argument in the revised §3 with a concrete calculation: if an orthogonal pair of subspaces is rotated away from the coordinate axes, the Minkowski sum of the corresponding segments produces a vertex whose coordinates are not in {0,1} (for instance, a point with equal nonzero fractional entries along the rotated directions). This explicit verification will be inserted to make the uniqueness claim fully rigorous.","revision_made":"yes","referee_comment":"[§3] §3 (proof of the main decomposition theorem): the argument that any orthogonal decomposition must align with coordinate subspaces (so that the Minkowski sum remains a 0/1-polytope) is not fully explicit. The standard fact that orthogonal Minkowski sums are Cartesian products is invoked, but the 0/1-vertex condition that rules out rotated orthogonal frames is only sketched; a concrete argument showing that a non-axis-aligned orthogonal sum would produce vertices outside {0,1}^d is required to close the uniqueness claim."},{"response":"We thank the referee for this observation. Because the decomposition is unique and the subspaces are orthogonal, the supports of the summands induce a partition of the ground set. For a matroid polytope this partition corresponds exactly to a direct-sum decomposition of the matroid, so each summand is the matroid polytope of the corresponding direct summand. We will add a short explicit verification of this correspondence in the proof of Theorem 4.2.","revision_made":"yes","referee_comment":"[Theorem 4.2] Theorem 4.2 (matroid polytopes): the indecomposability criterion is stated as a direct corollary, yet the proof does not verify that the orthogonal summands arising from the general theorem remain matroid polytopes; an additional check that the support of each summand corresponds to a direct-sum decomposition of the matroid is needed."}],"tokens_in":1361,"tokens_out":475,"duration_ms":31654,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main result is a uniqueness theorem for Minkowski decompositions of any 0/1-polytope: the indecomposable summands sit in pairwise orthogonal subspaces and the whole thing is therefore a Cartesian product of indecomposable 0/1-polytopes. That statement for the full class looks new relative to the earlier literature cited in the abstract. The paper then derives uniform indecomposability criteria for order polytopes, chain polytopes, matroid polytopes, stable-set and clique polytopes, edge polytopes, flow polytopes, and 2-level polytopes. It also records that any nontrivial factorization of a multi-affine polynomial remains a product of multi-affine polynomials on disjoint variable sets. Those applications are the practical payoff; they replace scattered case-by-case arguments with one structural fact. The polynomial observation is a short, clean extra that follows from the same decomposition. The central proof appears to rest on standard facts about orthogonal Minkowski sums plus a 0/1-specific step that forces the subspaces to align with coordinate directions so the vertices stay inside the unit cube. The stress-test note flags exactly this point, and the write-up needs to make the alignment argument explicit and check that no tilted orthogonal decomposition can preserve the 0/1 vertex set. If that step is handled directly and without hidden assumptions, the uniqueness claim goes through; if it is only sketched, that section would be the natural place for a referee to ask for more detail. Readers working in combinatorial convex geometry or in optimization problems that use these polytopes will find the criteria immediately usable. The paper is coherent on its own terms and supplies enough new structure to justify sending it out for serious refereeing rather than a desk rejection.","headline":"Every 0/1-polytope has a unique Minkowski decomposition into indecomposable summands in orthogonal subspaces, hence is a Cartesian product of indecomposables.","tokens_in":2290,"tokens_out":421,"would_cite":false,"duration_ms":33659,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"0/1-polytope Minkowski indecomposability via deformation polytopes and edge equivalence classes","alignment":"orthogonal","rationale":"The paper's central machinery (deformation polytopes DP(P) as cubes for 0/1-polytopes, ~ equivalence on edges from triangles/parallelograms, unique orthogonal-subspace decomposition into indecomposables, applications to order/chain/matroid/stable-set polytopes) operates entirely in combinatorial convex geometry. It invokes no recognition cost J, ratio symmetry, golden-ratio identities, 8-tick periodicity, or parameter-free constant derivations. RS framework (reality_from_one_distinction, J-cost forcing, AlexanderDuality for D=3, ArithmeticFromLogic) has no theorems constraining or predicting this domain; the result is compatible with but independent of RS.","tokens_in":50342,"confidence":"high","tokens_out":186,"duration_ms":9677,"cache_read_input_tokens":32896,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Every 0/1-polytope has a unique Minkowski decomposition into indecomposable summands in orthogonal subspaces.","keywords":["0/1-polytopes","Minkowski decomposition","indecomposability","Cartesian product","matroid polytopes","multi-affine polynomials","combinatorial polytopes","order polytopes"],"falsifier":"A concrete 0/1-polytope that admits two distinct decompositions into indecomposable summands whose subspaces are not orthogonal or whose summands are not translations of each other.","tokens_in":2554,"feed_emoji":"","tokens_out":643,"duration_ms":60046,"temperature":0.7,"pith_summary":"The paper establishes that any polytope with all vertices at coordinates 0 or 1 admits a unique way to express it as a Minkowski sum of polytopes that cannot be decomposed further. These indecomposable pieces occupy mutually perpendicular directions. This forces every 0/1-polytope to be the Cartesian product of its indecomposable factors. The decomposition supplies uniform tests for indecomposability across many families of combinatorial polytopes. It further shows that any nontrivial factorization of a multi-affine polynomial splits into factors each using a disjoint collection of variables.","feed_headline":"0/1-polytopes uniquely decompose into indecomposables","feed_subtitle":"Every such polytope is the Cartesian product of its indecomposable factors lying in orthogonal subspaces.","key_machinery":"Minkowski sum decomposition of 0/1-polytopes into indecomposable summands supported in pairwise orthogonal subspaces.","core_discovery":"Every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of indecomposable 0/1-polytopes.","pith_inferences":["The orthogonal product structure may simplify the computation of volumes or face counts by reducing them to the indecomposable factors.","Enumeration of all 0/1-polytopes could proceed by listing only the indecomposable ones and then closing under Cartesian products.","The same decomposition lens might apply to other vertex classes such as integer polytopes with bounded coordinates."],"forward_implications":["Uniform combinatorial criteria decide indecomposability for order polytopes, chain polytopes, matroid polytopes, stable set polytopes, clique polytopes, edge polytopes, flow polytopes, and 2-level polytopes.","Every nontrivial factorization of a multi-affine polynomial splits into a product of multi-affine polynomials each depending on a disjoint set of variables.","The decomposition yields a canonical product form for every 0/1-polytope."],"fun_headline_variants":["0/1-polytopes uniquely decompose into orthogonal indecomposables","Every 0/1-polytope is product of its indecomposable factors","Minkowski sums decompose 0/1-polytopes into orthogonal summands","0/1-polytopes factor as Cartesian products of indecomposables"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The Minkowski sum of polytopes contained in orthogonal subspaces equals their Cartesian product, so that indecomposability is well-defined relative to this operation.","fun_headline_variants_meta":{"raw":{"variants":["0/1-polytopes uniquely decompose into orthogonal indecomposables","Every 0/1-polytope is product of its indecomposable factors","Minkowski sums decompose 0/1-polytopes into orthogonal summands","0/1-polytopes factor as Cartesian products of indecomposables"]},"model":"grok-4.3","cost_usd":0.009525,"raw_usage":{"total_tokens":4110,"prompt_tokens":546,"num_sources_used":0,"completion_tokens":81,"cost_in_usd_ticks":95253000,"prompt_tokens_details":{"text_tokens":546,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3483,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":546,"tokens_out":81,"duration_ms":57069,"temperature":1.0,"reasoning_tokens":3483,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-22T04:14:55.141643+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete 0/1-polytope that admits two distinct decompositions into indecomposable summands whose subspaces are not orthogonal or whose summands are not translations of each other.","supporting_citations":[],"review_version":1}