{"id":"e6fd0a13-fbe2-43a9-b94d-e2c7dfd71f50","arxiv_id":"2512.05307","paper_version":5,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A graph of implicit edge dependencies unifies and extends indecomposability criteria and yields new indecomposable deformed permutahedra that are not matroid polytopes.","lead":"A new graph records which edge lengths stay proportional across all deformations of a polytope framework, yielding a unified indecomposability criterion. The authors use it to construct indecomposable deformed permutahedra outside the matroid polytope family and to refute a 1987 conjecture.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Facet-count formula in Cor. 3.3.5 is contradicted by the paper's own examples, so the advertised lower bound is unsupported.","rationale":"The reader's weakest_assumption concerned Lemma 3.3.9 and the connectivity of ED_uv after vertex deletion; that step appears essentially correct (Balinski gives 3-connectivity for n+m>=5, so deleting 1 or 2 vertices preserves connectivity). The more serious issue is the incorrect facet-count formula in the proof of Corollary 3.3.5, which the reader noted in the rationale but did not elevate to the weakest assumption. This is a concrete internal inconsistency: the paper's own table contradicts the formula, so the advertised lower bound is unsupported. The main indecomposability theorem (Theorem 3.3.10 / 3.3.4) still appears sound, modulo a small gap in applying Theorem 2.5.4 (the proof shows all a-edges are pairwise dependent and every vertex is incident to an a-edge, but does not explicitly prove the graph of a-edges is connected; this is repairable via Balinski on the 1-skeleton of Z_{n,m}). Therefore the appropriate verdict remains CONDITIONAL, not REJECT or ACCEPT: the central construction is likely valid, but the paper must correct the facet-count argument before the claimed enumeration is accepted.","tokens_in":51841,"tokens_out":17869,"duration_ms":143307,"concrete_test":"Recompute the number of facets of Zbar_{n,m} and Ztilde_{n,m} for small cases and compare with the formula 2^N+N+2-(2^n+2^{N-n}). For N=4, n=1, m=3, the formula gives 12; Example 3.3.1 gives 7 facets for Zbar_{1,3} and 8 facets for Ztilde_{1,3}. If the actual facet counts differ from the formula (as they do), the proof of Corollary 3.3.5's distinctness claim fails. A more comprehensive check would compute facet counts for n=1..floor((N-1)/2) for N=5,6 using a polytope library (e.g., polymake) to see whether the count is monotone in n at all.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Corollary 3.3.5 claims at least 2^floor((N-1)/2) non-isomorphic indecomposable deformed N-permutahedra that are not matroid polytopes. The proof argues that the polytopes Zbar_{n,m} and Ztilde_{n,m} for n+m=N are pairwise non-isomorphic because 'the number of facets of Z_{n,m} is ... 2^N + N + 2 - (2^n + 2^{N-n})', which 'is different for each n'. This formula is plainly false: for N=4, n=1, it gives 2^4+4+2-(2+8)=12, whereas the paper's own Example 3.3.1 reports that Zbar_{1,3} (strawberry) has 7 facets and Ztilde_{1,3} (octahedron) has 8 facets. Thus the non-isomorphism argument in Corollary 3.3.5 collapses, and the specific lower bound 2^floor((N-1)/2) is not established by the provided reasoning. This does not invalidate Theorem 3.3.4, which asserts the existence of indecomposable deformed permutahedra for each n,m with n+m>=5, but it removes a headline quantitative claim from the paper's stated contributions.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a graph of (implicit) edge dependencies for frameworks and uses it to give new indecomposability criteria for frameworks and polytopes. The central result, Theorem 2.6.4, states that a framework is indecomposable if it has a dependent vertex set S and a covering family of flats each containing a vertex of S. The authors show that this criterion subsumes and generalizes earlier criteria of Shephard, Kallay, McMullen, and others. The main application is to graphical zonotopes of complete bipartite graphs: after one or two deep truncations, the resulting polytopes are claimed to be indecomposable deformed permutahedra that are not matroid polytopes. Further applications include new lower bounds on the number of rays of the submodular cone, a negative answer to Smilansky's 1987 conjecture in dimension 4, bounds on deformation cones, and constructions of uniquely decomposable polytopes.","tokens_in":52141,"tokens_out":10430,"duration_ms":93760,"significance":"If the central results are correct, the paper offers a genuinely useful framework: the cycle-equation formulation is self-contained, Theorem 2.6.4 is proved directly from the deformation equations, and the method recovers several classical criteria in a uniform language. The construction of indecomposable deformed permutahedra that are not matroid polytopes is a substantive contribution to the long-standing problem of understanding extreme rays of the submodular cone. The paper also contains several interesting auxiliary results, such as the product formula for deformation cones and the treatment of parallelogramic Minkowski sums. However, the advertised quantitative lower bound in Corollary 3.3.5 is not supported by the provided proof, and one load-bearing lemma in the main application is stated with only a sketch. These issues do not necessarily invalidate the core framework, but they must be addressed before the paper can be accepted.","major_comments":[{"comment":"The counting argument for the lower bound is not sound. First, for each n in the stated range there are two polytopes, Zbar_{n,m} and Ztilde_{n,m}, so the construction gives at most 2 floor((N-1)/2) examples, not 2^{floor((N-1)/2)}. More seriously, the facet-count formula quoted in the proof is contradicted by the paper's own Example 3.3.1: for N=4, n=1 the formula gives 2^4 + 4 + 2 - (2 + 8) = 12 facets, while Example 3.3.1 reports that Zbar_{1,3} (strawberry) has 7 facets and Ztilde_{1,3} (octahedron) has 8. Thus the formula is not counting facets of the constructed truncated polytopes, or, if it counts facets of the original zonotope Z_{n,m}, it cannot distinguish the truncated polytopes. The advertised lower bound 2^{floor((N-1)/2)} is therefore unsupported and should be corrected or removed.","section":"§3.3, Corollary 3.3.5 and its proof"},{"comment":"The proof of Lemma 3.3.9 is only a one-line reference to the ordered-partition description of faces of a graphical zonotope. This lemma is load-bearing: Theorem 3.3.10 uses it to identify the subgraph ED_uv for the truncated polytopes with the 1-skeleton of the contracted graphical zonotope, and then applies Balinski's theorem to conclude that this graph remains connected after deleting one or two vertices. What needs to be shown explicitly is that the uv-edge graph of Zbar_{n,m} and Ztilde_{n,m} is obtained from the 1-skeleton of Z_{K_{n,m}/uv} by deleting exactly the vertex or vertices corresponding to the deep truncation(s), and that those deleted vertices are genuine vertices of that 1-skeleton. As written, the decisive step is asserted rather than proved.","section":"§3.3.2, Lemma 3.3.9 and Theorem 3.3.10"}],"minor_comments":[{"comment":"The table lists Ztilde_{2,2} as 'cuboctahedron' with f-vector (13,24,13), but the standard cuboctahedron has f-vector (12,24,14). If the polytope intended is not the usual cuboctahedron, the name should be changed or qualified.","section":"§3.3, Example 3.3.1"},{"comment":"The phrase 'the number of facets of Z_{n,m}' is ambiguous: it should say explicitly whether it refers to the original zonotope, Zbar_{n,m}, or Ztilde_{n,m}. The proof also silently treats the two truncated polytopes as non-isomorphic without giving a distinguishing invariant for the pair.","section":"§3.3, Corollary 3.3.5"},{"comment":"Theorem 3.3.4 states 'not isomorphic to matroid polytopes', while Theorem 3.3.13 establishes the stronger property of not being normally equivalent to a matroid polytope. It would be clearer to state the stronger property in Theorem 3.3.4 and in Corollary 3.3.5.","section":"§3.3, Theorem 3.3.4"},{"comment":"The notation distinguishing ED_uv, ED_uv, and ED_uv is difficult to read in the typeset version. Please use visibly distinct symbols and reintroduce them at the point where they are used in the proof of Theorem 3.3.10.","section":"§3.3.2"}],"recommendation":"major_revision","confidential_remarks":"The core framework and the proof of Theorem 2.6.4 appear sound and significant, and the main construction of indecomposable truncated graphical zonotopes is plausible. However, the proof of Corollary 3.3.5 contains a concrete numerical contradiction with the authors' own example, and the key graph-identification lemma behind Theorem 3.3.10 is only sketched. These are fixable but load-bearing issues. I recommend major revision rather than rejection, because the main theoretical contribution does not seem to depend on the erroneous lower bound."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on arXiv:2512.05307. The core idea is good: define the graph of edge dependencies recording forced equalities of edge-length ratios across deformations, add implicit edges, and use covering families of flats. This gives a genuinely wider indecomposability criterion that recovers Shephard, Kallay, and McMullen, and it is the right tool for the truncated graphical zonotopes. The main existence result, Theorem 3.3.4, looks solid: the proof of indecomposability in 3.3.10 is coherent, and the non-matroid argument in 3.3.13 is fine. The Smilansky counterexamples in dimension 4 check out. This is a useful paper for polytope/deformation-cone people.\n\nSoft spots. The counting claim in Corollary 3.3.5 is not supported. The facet-count formula used there — 2^N + N + 2 - (2^n + 2^{N-n}) — is the number of facets of the untruncated Z_{n,m}, not of the truncated polytopes being counted, and the paper's own Example 3.3.1 gives 7 and 8 facets for Zbar_{1,3} and Ztilde_{1,3} where the formula would say 12. So the advertised lower bound 2^floor((N-1)/2) of pairwise non-isomorphic examples is not established. The existence part of the theorem survives, but the counting contribution needs a real fix — either a correct facet count for the truncated family, or a different isomorphism invariant. Also, Lemma 3.3.9 — the identification of ED_{uv} with the 1-skeleton of the contracted zonotope — is asserted rather than proved. It's plausible from the ordered-partition description, but since Balinski connectivity is load-bearing, the proof should be written out. These are local, not fatal: I don't see a problem in the cycle-equation framework or in Theorem 2.6.4.\n\nBottom line: worth a serious referee. I'd send it out, ask for a revision that fixes the counting argument and expands Lemma 3.3.9. I'd cite the framework and the indecomposability examples, but not the lower bound until it's repaired.","headline":"Strong new framework for indecomposability, with a real but local counting error that should be fixed before the paper's advertised bounds are trusted.","tokens_in":52609,"tokens_out":2968,"would_cite":true,"duration_ms":26649,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52B05","52B11","05B35"],"pacs":[],"model":"deepseek-v4-flash","headline":"A single graph of forced edge-length equalities now certifies indecomposability of polytopes, unifying the classical tests and yielding new indecomposable deformed permutahedra.","keywords":["indecomposable polytopes","Minkowski sum","deformation cone","edge dependencies","deformed permutahedra","submodular cone","graphical zonotopes","matroid polytopes"],"falsifier":"Solve the linear cycle equations for the deformation cone of the 4-dimensional polytope Zbar_{2,3}: if the solution space has dimension greater than one, the claimed indecomposability is false; if exactly one, the main application is confirmed. A cheaper local test is to build the graph of edges parallel to a fixed direction a_1 b_1 in Zbar_{2,3}, delete the nodes corresponding to the two truncated vertices, and check whether the remaining graph is connected—the theorem's proof requires it.","tokens_in":51726,"feed_emoji":"📐","tokens_out":6773,"duration_ms":61386,"temperature":0.7,"pith_summary":"This paper sets out a unified way to prove that a convex polytope is indecomposable—cannot be written as a nontrivial Minkowski sum—using a graph built from the polytope's edge lengths. Two edges are declared dependent if the ratio of their lengths is forced to stay constant across all possible deformations; the paper shows this relation is enough to certify indecomposability whenever a suitable dependent set of vertices touches a covering family of flats. This single criterion recovers the classical indecomposability tests and extends them to examples none of them handle. The flagship application is a new infinite family of indecomposable deformed permutahedra—deeply truncated graphical zonotopes of complete bipartite graphs—that are not matroid polytopes, giving new rays of the submodular cone and refuting a 1987 conjecture on vertex and facet counts. Along the way the graph yields bounds on the dimension of deformation cones and a product formula for Cartesian products.","feed_headline":"One graph unifies polytope indecomposability tests","feed_subtitle":"A graph of forced edge-length equalities yields new indecomposable deformed permutahedra and falsifies a 1987 conjecture.","key_machinery":"The central object is the graph of implicit edge dependencies, whose nodes are the non-degenerate edges of a framework and whose arcs record pairs of edges whose length ratios are forced to stay equal across all deformations. Dependency is transitive, so connected components are cliques, and indecomposability is equivalent to this graph being connected. The proof machinery has three parts: adding implicit edges (vertex pairs whose difference scales by a common factor in every deformation) does not change the deformation cone; projecting a framework along a subspace and contracting degenerate edges lifts dependencies from the projected framework back to the original; and a covering family of","core_discovery":"The central claim is that indecomposability of a polytope or framework can be read off from a graph of forced edge-length equalities. Two edges are dependent if the ratio of their lengths is the same in every deformation; a framework is indecomposable exactly when all non-degenerate edges are pairwise dependent, i.e. when this graph is complete. The paper's main theorem states a sufficient condition: if some subset S of vertices is dependent (all pairs joined by paths of dependent implicit edges) and a covering family of flats—each flat being a connected subconfiguration, with facets as a special case—has every member containing a vertex of S, then the whole framework is indecomposable. This","pith_inferences":["The covering-flat formulation suggests indecomposability is a local-to-global phenomenon: one only needs a dependent core touching enough faces, so similar criteria may transfer to polytopes obtained by face subdivisions or perturbations that preserve the edge-dependency graph.","The projection-and-lift mechanism gives a general recipe for other polytope families: find a direction in which a projection is indecomposable and lift that dependency back; this could generate new indecomposable families from zonotopes beyond the complete-bipartite case.","The refutation in dimension 4 leaves open whether higher-dimensional analogues of the old vertex/facet conjecture exist; the edge-dependency graph may be a more practical sufficient condition than numerical inequalities for building such counterexamples.","The deformation-cone dimension bounds could serve as a fast combinatorial heuristic—count connected components of the edge-dependency graph—to screen candidates for extreme rays of the submodular cone before running full linear-programming checks."],"forward_implications":["For every N at least 4, there are at least 2^floor((N-1)/2) non-isomorphic indecomposable deformed N-permutahedra that are not matroid polytopes, providing new rays of the submodular cone.","The 1987 conjecture asserting that indecomposable polytopes must have relatively few vertices compared with their number of facets is false in dimension 4, with explicit 4-dimensional examples satisfying the conjecture's numerical condition yet still indecomposable.","The dimension of a deformation cone is bounded above by the number of connected components of the edge-dependency graph, and the deformation cone of a Cartesian product is the product of the factor deformation cones.","Taking permutahedral wedges of these indecomposable examples yields at least (N-1)!/3! non-normally-equivalent indecomposable deformed N-permutahedra that are not matroid polytopes.","Stacking vertices on facets of parallelogramic Minkowski sums of indecomposable polytopes gives indecomposable polytopes exactly when a certain graph recording which summands appear together in the stacked facets is connected."],"fun_headline_variants":["Edge-dependency graph unifies indecomposability tests","New graph criterion for indecomposable polytopes","Forced edge ratios expose new indecomposable polytopes","1987 conjecture falsified via edge-dependency graph","Beyond matroids: new indecomposable permutahedra"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof of indecomposability for the new examples rests on identifying the graph of edges parallel to a fixed direction in a truncated graphical zonotope with the 1-skeleton of the contracted graphical zonotope, and on that graph remaining connected after the one or two truncated vertices are deleted; if this identification or the post-deletion connectivity fails, the central application collapses.","fun_headline_variants_meta":{"raw":{"variants":["Edge-dependency graph unifies indecomposability tests","New graph criterion for indecomposable polytopes","Forced edge ratios expose new indecomposable polytopes","1987 conjecture falsified via edge-dependency graph","Beyond matroids: new indecomposable permutahedra"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000185,"raw_usage":{"total_tokens":1197,"prompt_tokens":820,"completion_tokens":377,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":564,"completion_tokens_details":{"reasoning_tokens":296}},"tokens_in":564,"tokens_out":377,"duration_ms":3897,"temperature":1.0,"reasoning_tokens":296,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T18:27:57.995198+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Solve the linear cycle equations for the deformation cone of the 4-dimensional polytope Zbar_{2,3}: if the solution space has dimension greater than one, the claimed indecomposability is false; if exactly one, the main application is confirmed. A cheaper local test is to build the graph of edges parallel to a fixed direction a_1 b_1 in Zbar_{2,3}, delete the nodes corresponding to the two truncated vertices, and check whether the remaining graph is connected—the theorem's proof requires it.","supporting_citations":[],"review_version":1}