{"id":"06a06788-0485-434f-9ba8-46ab530086f3","arxiv_id":"2502.01124","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Higher-order flexes are redefined as minimal parametrizations of algebraic curve branches, bounded by the flexion order, and computed via Puiseux series.","lead":"This paper proposes a new way to define higher-order flexes of bar-joint frameworks, using branches of algebraic curves and Puiseux series. The definition aims to resolve a known paradox from the double-Watt mechanism and gives an algebraic procedure to compute the flexes and check which are real.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central exclusion of Stachel's infinite sequence rests on the unproved bound k≤r and the completeness of item 3 of Definition 2; a conditional reading is appropriate.","rationale":"The reader's weakest assumption identifies exactly the same load-bearing point: Definition 2's item 3 is the only mechanism that excludes Stachel's infinite sequence, and it is asserted rather than proved. The paper's worked examples, especially the Puiseux computations in Examples 3–4 and Appendices A–B, are explicit enough to be checked and are internally coherent; they do support the definition in those cases. But they cannot prove the global claims of completeness and of k≤r. Since the paper is a definitional proposal whose central motivation is to resolve a known counterexample, a theorem-shaped assertion inside a footnote is insufficient. This does not warrant rejection, because the definition may be correct and the computational method is demonstrably usable; it does warrant conditional acceptance pending a proof or a decisive computation on the extended double-Watt mechanism.","tokens_in":9728,"tokens_out":9401,"duration_ms":112792,"concrete_test":"Take Stachel's extended double-Watt mechanism from [21]/[15, Ex. 3] and enumerate, via the resultant/Puiseux method of Section 3, all branches of order k of the one-dimensional components of ideals generated by e−1 independent members of the linear span of the edge quadrics. Compute the maximal k satisfying conditions 1–3 of Definition 2 and compare it with the flexion order r. If any branch has k>r, or if the infinite (k,3k−1) family reappears, the bound k≤r is false; if the maximum is exactly r, the central exclusion claim is supported. Independently, compare this list with flexes obtained by unrestricted local parametrizations of the full configuration scheme to test the completeness of item 3.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Definition 2, item 3 restricts (k,n)-flexes to branches of curves whose ideals have generators in the linear family spanned by the edge quadrics c1,...,ce. Section 3 then states, in a footnote, that 'k cannot be greater than the flexion order r,' which is the mechanism that truncates Stachel's (k,3k−1) sequence. This is the single load-bearing step, and no proof is supplied: r is an intersection multiplicity of the full ideal ⟨c1,...,ce⟩ [15, Sec. 3.1], while k is the branch order of a curve defined by a different ideal whose generators are only linear combinations of the ci. There is no argument in the paper relating these two numbers. The completeness direction is equally unproved: for a general (not necessarily isostatic) framework, no reason is given that every physically meaningful higher-order flex extends to a branch of a curve in this linear family; the worked examples verify only two configurations. If item 3 is too weak, Stachel's infinite sequence survives; if it is too strong, legitimate flexes are silently excluded.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a new algebraic definition of higher-order flexes, called 1-parametric (k,n)-flexes, for bar-joint frameworks that are not continuously flexible. The definition modifies Sabitov's and Stachel's earlier notions by adding condition 3 of Definition 2: the polynomial flex path must extend to a minimal parametrization of a branch of order k of an algebraic curve defined by an ideal whose generators lie in the linear span of the edge quadrics c1,...,ce. The paper motivates this definition through a removal procedure for isostatic frameworks, describes a Puiseux-series computation for the associated branches, and works through two main examples: a configuration of three quadrics with a (3;2,3) flex triple, and an immobile 4-bar mechanism with a (∞;1,1) triple. The stated goal is to resolve the dilemma caused by Stachel's infinite sequence of irreducible (k,3k−1)-flexes for an extended double-Watt mechanism.","tokens_in":9963,"tokens_out":6531,"duration_ms":76187,"significance":"If the proposed definition is accepted and the key bounds hold, the paper would provide a principled algebraic-geometric way to associate finitely many flex types to a higher-order flexible framework, complementing the author's earlier redefinition of flexion order. The worked examples are detailed and internally consistent, and the Puiseux computations in Appendix A cover the special cases excluded by Eq. (8). The paper is genuinely definitional and computational: it fits no free parameters and does not reduce its main claims to prior results by construction. However, the central load-bearing assertion, k ≤ r, is stated without proof, and the completeness of condition 3 of Definition 2 is an unproved hypothesis. The significance of the paper therefore remains conditional on closing these two gaps.","major_comments":[{"comment":"The central claim that k cannot be greater than the flexion order r is asserted in footnote 3, but no proof is given. Here r is the intersection multiplicity of the full ideal ⟨c1,...,ce⟩ at the configuration, as in [15, Sec. 3.1], whereas k is the branch order of a curve whose defining ideal has generators only in the linear span of c1,...,ce. These are ideals of different varieties, and the paper contains no argument relating their local invariants. This bound is load-bearing: it is the mechanism that truncates Stachel's infinite sequence of (k,3k−1)-flexes. If the bound is false, the claimed resolution of that dilemma collapses; if it is true, it needs a proof. The paper should either supply a lemma with a proof or state the bound as an explicit assumption and discuss its status.","section":"§3, Definition 2, footnote 3"},{"comment":"Definition 2, item 3 restricts (k,n)-flexes to branches of curves whose ideals are generated by quadrics in the linear family spanned by c1,...,ce. The motivation in Section 2 is a removal procedure that is natural for isostatic frameworks, where one deletes a bar and forms linear combinations of the remaining equations. For a general framework, the paper gives no argument that every flex in the Sabitov–Stachel sense extends to such a branch. If item 3 is too weak, Stachel's infinite sequence is not actually excluded; if it is too strong, legitimate flexes are silently excluded. The paper should clarify the intended scope (isostatic versus general frameworks) and either prove a completeness statement or explicitly formulate the completeness condition as a hypothesis.","section":"§2–§3, Definition 2, item 3"}],"minor_comments":[{"comment":"The phrase 'my means of Newton diagrams' should read 'by means of Newton diagrams.'","section":"§1.2"},{"comment":"Definition 2 begins with 'which is not continuous flexible,' but the next paragraph says the definition 'also holds for frameworks with a 1-dimensional mobility (⇔ n = ∞).' This should be clarified, and the meaning of r = ∞ in Example 4 should be explained in terms of the definition of flexion order from [15].","section":"§3, Definition 2 and Example 4"},{"comment":"Please specify whether the linear family in item 3 is taken over R or over C; the Puiseux computations in Section 3 and the appendices are carried out over C, while the reality discussion in Example 4 uses real parts.","section":"§3, Definition 2, item 3"},{"comment":"The term 'minimal parametrization' is used for planar curves in Section 1.2 and then for space curves via the projection method of [13], but no formal definition is given for the space-curve case; a short definition would improve readability.","section":"§1.2 and §3"},{"comment":"The 'degree reasons' excluding cusps with k > 2 are compressed; since the same conclusion is verified by the computations in Appendix A, either expand the geometric argument or present it as a consequence of the computation.","section":"Example 2, footnote 2"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives a new definition of (k,n)-flexes for bar-joint frameworks, replacing Stachel's irreducibility condition with a global algebraic condition: the flex must sit on a branch of a curve whose ideal is generated inside the linear span of the edge quadrics (item 3 of Def. 2). That is a real step forward. It turns the search for associated flexes into a concrete Puiseux computation, and the two worked examples are detailed enough to check. The appendix handles the special cases properly, and the paper is honest about what remains open.\n\nThe soft spot is exactly where the reader and stress-test point. The claim that k cannot exceed the flexion order r is the load-bearing wall: it is what truncates Stachel's infinite sequence of (k,3k-1)-flexes. But no proof is given. r is an intersection multiplicity of the full ideal <c1,...,ce>, while k is the branch order of a curve defined by a different ideal whose generators are only linear combinations of the c_i. The paper says in a footnote that r is only an upper bound, which is a statement of intent, not an argument. Without that inequality, the central resolution is not established. The completeness direction is also definitional: item 3 restricts to the linear family, and while the removal procedure for isostatic frameworks motivates it, no reason is given why a general framework's higher-order flexes must arise from such a curve. If the family is too small, you silently miss flexes; if too large, the definition may not exclude what you want. The examples only verify two configurations.\n\nThis is not a fatal flaw, because the paper is a definitional contribution: if the inequality and completeness can be pinned down, the framework stands. But as submitted, the main claim is conditional. The paper deserves a serious referee: the problem is real, the definition is new, and the computational pipeline is demonstrated. I would encourage the editor to send it out, with instructions to the referee to focus on the k<=r bound and the geometric completeness of item 3. A proof or a counterexample would settle it. I would not cite the truncation claim until that is resolved.","headline":"A genuinely new definitional repair for higher-order flexes, but the mechanism that kills Stachel's infinite sequence is asserted, not proved.","tokens_in":10425,"tokens_out":2695,"would_cite":false,"duration_ms":29432,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14H20","52C25","70B15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper resolves the infinite higher-order-flex dilemma by tying flexes to algebraic curve branches.","keywords":["associated flexes","higher-order flexibility","higher-order rigidity","bar-joint framework","Puiseux series","algebraic curves","flexion order","double-Watt mechanism"],"falsifier":"Compute the flexion order r of Stachel's extended double-Watt mechanism with the author's earlier algorithm and check whether any (k,3k-1)-flex for k>r still satisfies items 1 and 2 of Definition 2; if one does, the bound k≤r is false. More generally, any one-parameter family of configurations satisfying the stationary-multiplicity and non-triviality conditions that cannot be extended to a branch in the linear family of quadrics would refute item 3's completeness.","tokens_in":9542,"feed_emoji":"📐","tokens_out":6490,"duration_ms":62314,"temperature":0.7,"pith_summary":"The paper proposes a definition of higher-order flexes for bar-joint frameworks that repairs a defect in the classical definitions. The defect is that some rigid frameworks, such as Stachel's extended double-Watt mechanism, produce an infinite sequence of irreducible (k,3k-1)-flexes under the old rules, so no unique flexion order can be read off. The paper's fix is to require that any flex extend to a minimal parametrization of a branch of an algebraic curve cut out by the framework's edge-length quadrics. This makes the set of flexes finite and computable, because the branch order k can never exceed the framework's flexion order r. The paper demonstrates the computation with Puiseux series and shows how to keep only real flexes.","feed_headline":"A curve-based definition ends the infinite-flex dilemma","feed_subtitle":"For bar-joint frameworks, higher-order flexes become finite: k can never exceed the flexion order r.","key_machinery":"The load-bearing object is the minimal parametrization of a branch of an algebraic curve, as given by the Newton-Puiseux theorem: a local branch through the origin can be written as $x(t)=t^{\\nu_{0}}$, $y(t)=\\beta_{1}t^{\\nu_{1}}+\\cdots$ with $0<\\nu_{0}<\\nu_{1}<\\cdots$, and the branch order is $\\min(\\nu_{0},\\nu_{1})$. Definition 2's item 3 connects each candidate flex to such a branch of a curve that lies in the linear family of quadrics generated by the framework's edge equations. This moves the question from polynomial guesses to algebraic curve geometry; in particular, $k$ is the branch order, and Puiseux expansions, obtained here by projecting space curves to coordinate planes and eliminating variables with resultants, supply the actual flexes.","core_discovery":"The central claim is that a (k,n)-flex of a bar-joint framework should be defined by three conditions: the polynomial substitution in Eq. (2) makes the edge-length equations vanish with multiplicity at least n+1 at t=0; the k-th order velocity vectors are non-trivial; and the substitution extends to a minimal parametrization of a branch of order k of an algebraic curve belonging to a one-dimensional irreducible component of a variety whose ideal is generated inside the linear family of quadrics spanned by c1,...,ce. With this third condition, which replaces Stachel's irreducibility condition, the infinite sequence of possible flexes for the extended double-Watt mechanism disappears, since k is bounded above by the flexion order r defined in the author's earlier work. The paper verifies the definition on a model isostatic framework, where only (1,1)- and (2,3)-flexes occur, and on an immobile 4-bar mechanism whose configuration curve has only two conjugate complex branches through the origin, giving the real flex triple (r;kmax,nmax)=(∞;1,1).","pith_inferences":["Because $k$ is bounded by $r$ and branch orders are determined by the curve ideal, one could enumerate all higher-order flexes for a given framework by Newton-polygon or tropical methods without fully constructing Puiseux expansions; the paper points toward tropical geometry as future work but does not implement the enumeration.","The same curve-branch viewpoint suggests a natural definition of $p$-parametric flexes by replacing curves with local branches of $p$-dimensional surfaces, as the author notes as a future direction.","An implicit consequence is that higher-order flexibility becomes an algebraic singularity phenomenon: the flexes of a framework are the branches of its configuration-space curve that meet a distinguished hypersurface with prescribed multiplicity, which could connect to singularity-based classifications of mechanisms.","For frameworks with continuous mobility ($n=\\infty$), Definition 2 still applies, so the flexes are exactly the branches of the configuration curve; this unifies continuous and higher-order flexibility under one definition."],"forward_implications":["For any bar-joint framework with finite flexion order $r$, there are no $(k,n)$-flexes with $k>r$, so the list of associated flexes is finite.","The redefined flexes can be computed algorithmically: build the curve ideal in the linear family of quadrics, compute branch parametrizations via Puiseux or Newton-diagram methods, and substitute into the remaining edge equation to get $n$.","The definition automatically handles real versus complex behavior: taking the real part of the minimal parametrization yields the highest real flex, which complements the flexion order $r$.","The extended double-Watt dilemma is resolved: the infinitely many old-style $(k,3k-1)$-flexes are cut off because branches of order higher than $r$ cannot occur.","The classical case of ordinary $n$-th order flexes is recovered as the special case $k=1$."],"supporting_citations":[{"why":"Defines the flexion order r that Definition 2 uses as the upper bound for k.","marker":"[15]"},{"why":"Supplies the original double-Watt mechanism example showing that classical higher-order rigidity conflicts with continuous flexion.","marker":"[5]"},{"why":"Introduces the original (k,n)-flex notion and the finite algorithm for testing bendability that inspires the redefinition.","marker":"[17]"},{"why":"Proposes the irreducible (k,n)-flex formulation and applies it to the first double-Watt mechanism.","marker":"[20]"},{"why":"Presents the extended double-Watt/Kempe mechanism whose infinite (k,3k-1)-flex sequence motivates item 3 of Definition 2.","marker":"[21]"},{"why":"Provides the projection method for computing minimal parametrizations of branches of space curves, used throughout the paper's examples.","marker":"[13]"}],"fun_headline_variants":["Curve-based flex definition caps k at flexion order","Higher-order flexes now finite via algebraic curves","Puiseux series bound flex order in bar-joint frameworks","Algebraic curves end infinite flex sequences"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Every higher-order flex is assumed to arise from a branch of an algebraic curve lying in the linear family of quadrics spanned by the edge-length equations; if a genuine flex escaped that family, Definition 2 would silently miss it.","fun_headline_variants_meta":{"raw":{"variants":["Curve-based flex definition caps k at flexion order","Higher-order flexes now finite via algebraic curves","Puiseux series bound flex order in bar-joint frameworks","Algebraic curves end infinite flex sequences"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000429,"raw_usage":{"total_tokens":2146,"prompt_tokens":850,"completion_tokens":1296,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":466,"completion_tokens_details":{"reasoning_tokens":1235}},"tokens_in":466,"tokens_out":1296,"duration_ms":12561,"temperature":1.0,"reasoning_tokens":1235,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T16:28:51.160132+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the flexion order r of Stachel's extended double-Watt mechanism with the author's earlier algorithm and check whether any (k,3k-1)-flex for k>r still satisfies items 1 and 2 of Definition 2; if one does, the bound k≤r is false. More generally, any one-parameter family of configurations satisfying the stationary-multiplicity and non-triviality conditions that cannot be extended to a branch in the linear family of quadrics would refute item 3's completeness.","supporting_citations":[{"cited_title":"Mechanism and Machine Theory 205:105853 (2025)","cited_arxiv_id":null,"evidence_quote":"Defines the flexion order r that Definition 2 uses as the upper bound for k."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the original double-Watt mechanism example showing that classical higher-order rigidity conflicts with continuous flexion."},{"cited_title":"Geometry III, 179–250, Springer (1992)","cited_arxiv_id":null,"evidence_quote":"Introduces the original (k,n)-flex notion and the finite algorithm for testing bendability that inspires the redefinition."},{"cited_title":"Tensegrity Workshop, La Vacquerie, France (2007)","cited_arxiv_id":null,"evidence_quote":"Proposes the irreducible (k,n)-flex formulation and applies it to the first double-Watt mechanism."},{"cited_title":"AIM Workshop on Rigidity and polyhedral combinatorics, Palo Alto/CA, USA (2007)","cited_arxiv_id":null,"evidence_quote":"Presents the extended double-Watt/Kempe mechanism whose infinite (k,3k-1)-flex sequence motivates item 3 of Definition 2."},{"cited_title":"Dissertation (Supervisor: Herwig Hauser), University of Vienna (2020)","cited_arxiv_id":null,"evidence_quote":"Provides the projection method for computing minimal parametrizations of branches of space curves, used throughout the paper's examples."}],"review_version":1}