{"id":"20765fec-09e1-4883-847d-443629c214e7","arxiv_id":"2607.23622","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.5,"correctness_risk":"low","formal_verification":"none","parameter_count":2,"one_line_summary":"Mixed subdivisions and tropical homotopy for matroid/engineered complete intersections yield root counts and eliminant Newton polytopes, implemented and timed on applications.","lead":"The paper gives algorithms that tropicalize and count solutions of engineered complete intersections, a common class of sparse polynomial systems, by generalizing mixed subdivisions and tropical homotopy. The methods also compute Newton polytopes of eliminants such as A-discriminants, with working Julia code and timings on reaction networks and discriminants.","discovery_kind":"new_method","skeptic_critique":null,"referee_report":{"model":"moonshotai/kimi-k3","summary":"The paper develops algorithmic tools for engineered complete intersections (ECIs) and their combinatorial abstraction, matroid complete intersections (MCIs), building on the first author's prior theory [Est24; Est25]. The main contributions are: (1) a generalization of Huber–Sturmfels mixed subdivisions to MCIs, with Theorem 2 expressing the mixed volume MV(r,A) as the sum of volumes of dual tropical roots at a generic height vector; (2) a tropical homotopy continuation algorithm (Algorithms 1–2) that tracks mixed subdivisions along a path in height space, with an explicit polyhedral description of mixed cell cones (Lemma 2) and a wall-crossing update rule (Corollary 1, WallWalk); (3) an effective real-patchworking pipeline, including a reduction of real root counting for systems with mutually transversal simplicial supports to linear algebra over F₂ (Theorem 4), applied to prove the existence of a degree-4 hypersurface in 3 variables whose discriminant curve has all 24 cusp singularities real (Theorem 6); and (4) a vertex oracle for the Newton polytope of an ECI eliminant (Theorem 5, Corollary 3, Algorithm 3), built on a support-function formula from [Est25] and combined with Huggins' method, applied to A-discriminants and ED-type eliminations. All algorithms are implemented in a publicly available Julia package (MCISubdivisions.jl, built on OSCAR), and the paper reports experiments on steady-state systems from chemical reaction networks, A-discriminants, and euclidean-dista","tokens_in":30503,"tokens_out":9783,"duration_ms":339156,"significance":"If the results hold, this is a useful and concrete advance in computational tropical geometry. It provides the first implementation of tropical homotopy continuation that manipulates mixed cell cones of ECI/MCIs directly (rather than via chains of flats of matroids as in [DR24]), with reported speedups of one to two orders of magnitude over [HHR24] and [Fel+26] on chemical-reaction-network examples. The eliminant vertex oracle yields A-discriminant Newton polytopes in times comparable to or better than dedicated tropical implicitization [RST25]. Strengths that deserve explicit credit: the key formulas are parameter-free and proved in the text; the software is public with reproducible example scripts; the F₂-linear-algebra reduction for real root counting (Theorem 4) is elegant and effective; and Theorem 6 is a concrete, machine-verified existence result (a degree-4 surface with all 24 discriminant cusps real) that showcases the whole pipeline. Proposition 1 (multiplicities of positive-dimensional MCI tropicalizations as mixed volumes of cancellations) generalizes a result of Sturmfels–Tevelev and is of independent interest.","major_comments":[{"comment":"Corollary 1 (the wall-crossing update on which the correctness of Algorithm 1 rests, cf. Remark 8) is internally inconsistent in orientation. The statement concludes 'for every M ∈ M+ there is M′ ∈ M− with supp(M) ⊆ supp(M′) ∪ supp(c)', but the proof takes M ∈ M− with M ∉ M+ ('Since we have M∉M+, but M ∈ M−') and constructs M′ ∈ M+ — which is the direction WallWalk actually implements (input M−, output M+), and Example 6 also follows the proof's direction. As written, the statement's quantifiers and the proof's labels are swapped. Please make statement, proof, and Algorithm 1 mutually consistent, and state explicitly in which direction the support inclusion holds, since a reader verifying the homotopy's correctness needs the orientation (and the sign of ∑_{s∈S′_i} c_s < 0 relative to the crossing direction) pinned down.","section":"§3.3, Corollary 1"},{"comment":"Notation 6 defines r″(S) := max{r(S∩A) + r′(S∩B), n}. This cannot be a matroid rank function (e.g. r″(∅) = n, and ranks of small sets exceed their cardinality). The proof of Lemma 3 uses r″(S) = r′(S) for S ⊆ B, which holds for min{r(S∩A) + r′(S∩B), n} — the truncation at rank n of the direct sum — so min is evidently intended. Since Lemma 3 is the initialization step of Algorithm 2, please correct the definition and re-check the statements of Lemma 3 and Algorithm 2 (lines 6–9) accordingly.","section":"§3.3, Notation 6 / Lemma 3"},{"comment":"Three of the seven ED-degree instances in Table 3 report 'rounding error' for Algorithm 3: facet inequalities of mixed cell cones are computed in floating point and become ill-conditioned when one support entry dominates. Since a misclassified cone facet silently invalidates the WallWalk update, this bears on the practical-reliability claim of §5. The authors acknowledge the issue and sketch an exact fallback; I ask that the paper (a) state explicitly which parts of the pipeline are exact (dual-number bookkeeping, circuit arithmetic) and which are floating-point, and (b) discuss cheap a posteriori certification — e.g. verifying the output subdivision's cone inequalities in exact arithmetic, or certifying the computed vertex/Σsvol against a known degree or an independent evaluation — so that a user can detect rather than inherit such failures.","section":"§5, Table 3 (Euclidean Distance Degree)"}],"minor_comments":[{"comment":"Lemma 2, proof: the second family of inequalities is written as π_A(c(i,i+1))·d ≥ 0, but the defining condition in the same proof is the strict ordering (ω,1)(S_{1,d}) > (ω,1)(S_{2,d}) > …, which yields strict inequalities for points of C°_M(r,A). Please reconcile strict vs. non-strict inequalities with the open cone / euclidean closure distinction in the statement.","section":null},{"comment":"Proposition 3: item 2 concludes 'MV(r,A) = …' but the quantity on the left should presumably be the mixed volume of the sequence (r_i,S_i)_i in the sense of Definition 8(4); also item 1 writes A_i where the hypothesis names the sets S_i. Example 3(2) refers to 'item 3 in Definition 4', but Definition 4 has no items — presumably Definition 8(3) is meant.","section":null},{"comment":"Definition 11: 'if only if' should be 'if and only if'. Remark 6: 'appears more than once than we consider' should be 'then'. Theorem 4's statement has a stray unbalanced parenthesis ('not satisfying the condition of Lemma 1)'), and Lemma 1 and the proof of Theorem 4 use A_i where S_i is meant.","section":null},{"comment":"Algorithm 1, Homotopy, line 4: the loop condition quantifies over 'M ∈ M′' but should range over the current subdivision M; moreover, after setting t_curr to the minimal crossing time, the search should be over (t_curr, 1] to avoid re-detecting the same wall at t_curr. WallWalk, line 11: 'for any circuit S′_i …' reads existentially; presumably all such circuits are enumerated ('for every circuit').","section":null},{"comment":"Algorithm 2, line 3: 'the regular subdivision of A at height d′' should be the set of maximal cells of the regular triangulation of A at d′, since the circuits of the uniform matroid u_{A,n} are the (n+1)-element subsets.","section":null},{"comment":"§5, Tables 1–2: the speedups over [HHR24] (60s → 0.7s) and [Fel+26] (262s → 3.1s) quote timings reported in those papers, presumably on different hardware. Please add a one-line caveat that the comparison is against published timings, or ideally rerun one baseline on the same machine.","section":null},{"comment":"Theorem 6 and its proof: Theorem 3 only guarantees equality of real root counts for t0 ≫ 0, with no effective bound, and the proof does not exhibit or certify a specific t0. Since the theorem claims only existence this is logically sufficient, but the manuscript currently leaves unclear whether the witnessing polynomial is ˜f of Appendix A itself or an engineered f_{i,d}(t0); please clarify, and note that the msolve certification was applied to the cancellation systems, not to the final polynomial.","section":null},{"comment":"A brief complexity discussion would strengthen §3.3: even an empirical statement about the number of wall crossings and the per-WallWalk cost (facet-inequality computation, circuit enumeration in matroid quotients) would help readers gauge where the bottleneck lies, particularly in light of the 86-variable odebase example where the initial regular triangulation already fails.","section":null},{"comment":"Figure 1's caption/introduction cross-reference ('see Section 1') is self-referential; please point to the relevant part of §5 instead. In the abstract and §1, 'chemical reaction networks' examples would benefit from a forward pointer to Table 1.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The paper's two main theoretical inputs — Theorem 1 (trop(I_p) = trop(r,A) for generic specializations) and Theorem 2.14 of [Est25] (the support-function formula behind Theorem 5) — are taken from the first author's own arXiv preprints [Est24; Est25], which do not yet appear to be peer-reviewed. The dependence is transparent and the reductions are clearly stated, so this is ordinary theory-to-algorithms layering rather than a circularity problem, but the editor may wish to note that the correctness of the algorithmic output ultimately rests on those preprints. The overlap with the authors' own [MM25] (mixed fiber polytope case) is properly cited and clearly delineated."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is the algorithmic layer on Esterov’s ECI/MCI tropical theory. What is new is the mixed-cell / dual-tropical-root notion for matroid complete intersections, the explicit mixed-cell-cone inequalities, the WallWalk flip (Algorithm 1), and the moving-set vertex oracle for eliminant Newton polytopes (Corollary 3 / Algorithm 3). Those are genuine extensions of HS95, Jen16, Mal17, and the mixed-fiber work in MM25, not just rephrasing.\n\nThe math is clean enough for the genre. Theorem 2 (mixed volume = sum of cell volumes at generic height) and the cone description are proved by reduction to cancellations and stable intersection; the path-crossing argument under genericity is standard tropical-homotopy fare. They ship Julia/Oscar code, match mixed volumes on CRN examples from odebase and Fel+26, get the degree-4 “all 24 cusps real” witness via the real-patchworking reduction to an F2 linear system, and report A-discriminant and ED-degree timings that are competitive with or better than RST25 / HHR24 on the instances they show. That is real evidence, not vapor.\n\nSoft spots are ordinary and acknowledged. Everything rides on generic heights and paths that cross only relative interiors of facets (dual numbers / perturbation); floating-point facet inequalities already produce the rounding errors in Table 3 on larger ED instances. Largest CRNs time out at the initial regular triangulation, same bottleneck everyone hits. Heavy dependence on Est24/Est25 is normal theory-to-algorithms layering, not circularity. No formal verification, but the claims are the kind you check by running the code and comparing volumes.\n\nWho it is for: people who actually compute root counts, tropicalizations, or Newton polytopes of sparse/vertically parametrized systems (CRNs, A-discriminants, ED degree, critical-point systems). If that is your toolkit, the package and the mixed-cell language are worth engaging. I would send it to referees; it is above desk-reject threshold for a symbolic-computation algorithms paper.","headline":"Solid algorithmic companion to Esterov’s ECI/MCI theory: mixed cells, a workable tropical homotopy, and an eliminant vertex oracle, with code and timings that beat some prior tropical pipelines on the reported examples.","tokens_in":31426,"tokens_out":534,"would_cite":true,"duration_ms":10839,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14T05","13P15","68W30","52B55"],"pacs":[],"model":"grok-4.5","headline":"Mixed subdivisions of engineered complete intersections give their root counts and eliminant Newton polytopes, and a tropical homotopy computes them.","keywords":["engineered complete intersections","matroid complete intersections","mixed subdivisions","tropical homotopy continuation","mixed volume","A-discriminants","Newton polytopes","chemical reaction networks"],"falsifier":"On any small engineered complete intersection whose generic root count is already known by Gröbner bases or certified numerical solving, run the mixed-subdivision algorithm and check whether the sum of cell volumes equals that known count and whether the eliminant Newton polytope matches an independently computed one.","tokens_in":31627,"feed_emoji":"🌿","tokens_out":918,"duration_ms":31478,"temperature":0.7,"pith_summary":"Engineered complete intersections are sparse polynomial systems that arise by feeding monomials into a fixed linear map; they appear in enumerative geometry, chemical reaction networks, and discriminants. The paper shows that the classical mixed-subdivision picture for counting roots of generic sparse systems extends to this larger class: for a generic height function the mixed volume equals the sum of volumes of certain mixed cells (dual tropical roots). A tropical homotopy tracks those cells along a straight-line path in height space by walking across mixed-cell cones, yielding both the root count and a practical start system for numerical solving. The same cells supply a vertex oracle for the Newton polytope of any eliminant hypersurface of the system, so A-discriminants and related eliminants become accessible by evaluation-interpolation. The algorithms are implemented and timed on reaction-network examples, real-patchworking constructions, and classical discriminants.","feed_headline":"Tropical homotopy counts roots of engineered systems","feed_subtitle":"Mixed cells give both solution counts and eliminant Newton polytopes for sparse systems from geometry and chemistry","key_machinery":"Mixed cell cones: the closed set of height vectors for which a given mixed cell remains a dual tropical root is a polyhedral cone cut out by explicit affine-circuit inequalities; the WallWalk step of the tropical homotopy updates the mixed subdivision precisely when a straight-line path crosses a facet of one of these cones.","core_discovery":"For a zero-dimensional matroid complete intersection and a sufficiently generic height vector, the mixed volume equals the sum of the volumes of the dual tropical roots (mixed cells) at that height; those cells are exactly the data needed both to count roots of a generic engineered complete intersection and to read off vertices of the Newton polytope of any of its eliminants.","pith_inferences":["The same cancellation-and-mixed-cell formalism should extend, with only notational changes, to the larger class of systems that are nondegenerate upon monomial cancellation.","Once mixed-cell cones are available, certified path-tracking or interval methods could replace the probabilistic dual-number perturbation used to guarantee genericity.","The vertex-oracle speed-up observed for A-discriminants suggests that other classical resultant and discriminant polytopes admitting an engineered presentation become practical targets for the same pipeline."],"forward_implications":["Generic root counts of square engineered systems, including many chemical-reaction steady-state systems, are obtained by summing mixed-cell volumes without solving the system.","Coupling the computed mixed subdivision with existing tropical start-system techniques yields an optimized numerical homotopy for the same systems.","Vertices of Newton polytopes of A-discriminants and other ECI eliminants are returned by a single linear-form evaluation on the mixed cells, enabling evaluation-interpolation recovery of the eliminant itself.","Real-patchworking for engineered systems reduces real-root counting for large parameter values to linear algebra over the field with two elements on the simplicial cancellations of each mixed cell."],"fun_headline_variants":["Tropical homotopy counts ECI roots via mixed cells","Mixed cells give root counts for engineered systems","Tropicalizing ECIs yields mixed subdivisions that count solutions","Homotopy builds mixed cells for ECI root counts and eliminants","Mixed volume from tropical roots equals ECI solution count"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"Height vectors and the straight-line homotopy path must avoid a finite arrangement of bad linear subspaces and must cross only the relative interiors of mixed-cell-cone facets; otherwise the cell list and the volume sum can be wrong.","fun_headline_variants_meta":{"raw":{"variants":["Tropical homotopy counts ECI roots via mixed cells","Mixed cells give root counts for engineered systems","Tropicalizing ECIs yields mixed subdivisions that count solutions","Homotopy builds mixed cells for ECI root counts and eliminants","Mixed volume from tropical roots equals ECI solution count"]},"model":"grok-4.5","effort":"low","cost_usd":0.004022,"raw_usage":{"total_tokens":1228,"prompt_tokens":782,"num_sources_used":0,"completion_tokens":59,"cost_in_usd_ticks":40224000,"prompt_tokens_details":{"text_tokens":782,"audio_tokens":0,"image_tokens":0,"cached_tokens":128},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":387,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":782,"tokens_out":59,"duration_ms":7712,"temperature":1.0,"reasoning_tokens":387,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-30T17:26:18.315304+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"On any small engineered complete intersection whose generic root count is already known by Gröbner bases or certified numerical solving, run the mixed-subdivision algorithm and check whether the sum of cell volumes equals that known count and whether the eliminant Newton polytope matches an independently computed one.","supporting_citations":[],"review_version":1}