{"id":"1b36d4bf-2513-404b-a556-f1392548b89d","arxiv_id":"2508.18838","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"New results on k-fold circuits in d-dimensional rigidity matroids: R_d lacks the k-fold circuit property for d >= 4, sufficient balance conditions are given, and a coning reduction handles almost-cone graphs.","lead":"This paper proves new structural facts about k-fold circuits in the generic d-dimensional rigidity matroid, including that for d >= 4 the matroid fails the k-fold circuit property. It also gives a coning lemma that reduces independence questions for graphs with high-degree vertices to lower-dimensional rigidity questions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.7 hinges on the unstated [12, Cor. 2] to certify that the auxiliary graph G is R_d-independent; the displayed inequality alone does not rule out a circuit on fewer vertices.","rationale":"The reader's weakest_assumption identifies exactly the load-bearing point: Theorem 3.7 depends on an unstated cited lemma. My independent reading confirms this is the right concern. The displayed Maxwell inequality is not sufficient because it only controls the total rank bound for d+5 vertices; it does not rule out a proper subgraph being a circuit. The proof explicitly invokes [12, Corollary 2] for the crucial independence of G, and that corollary is neither stated nor proved in the manuscript. All later steps in Theorem 3.7---the 1-extension argument, the closedness of the K_{d+2,d+2} subgraphs, and the extension to k-fold circuits---are coherent and would be sound if G is indeed independent. I checked the 1-extension details for possible hidden flaws: the choice of deleted edges requires picking u and u' outside certain pairs, but such choices exist for d >= 4, so that is only a minor imprecision. The claim about the principal partition of K_{d+2,d+3} is not strictly necessary for the imbalance conclusion, since the intersection over the d+3 known parts is already empty; extra parts would only increase the right-hand side. Thus the central concern is the unstated [12, Corollary 2]. This does not change the reader's conditional verdict: the manuscript should state the corollary and either prove it or give a complete direct verification that G is independent. If the corollary turns out to be misapplied, the negative theorem would fail; if it is correct, the proof likely goes through.","tokens_in":29807,"tokens_out":19565,"duration_ms":196701,"concrete_test":"State [12, Corollary 2] in full and verify that G satisfies its hypotheses; then independently re-derive the corollary or prove directly that every subgraph of G is independent. A concrete computational check for d=4: compute the rank of the generic 4-dimensional rigidity matrix of G (9 vertices, 24 edges) and of every proper subgraph using random algebraic coordinates; if any proper subgraph is dependent, the corollary is misapplied. For additional confidence, repeat at d=5 symbolically for one sample to confirm the pattern persists.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central negative theorem, Theorem 3.7, constructs the graph G in Figure 4 with d+5 vertices and 5d+4 edges, and concludes that G is R_d-independent from two facts: the Maxwell count 5d+4 < d(d+9)/2 and an unspecified [12, Corollary 2]. The Maxwell count is only an upper bound on the rank of a graph on d+5 vertices; it says nothing about proper subgraphs. A circuit could be supported on fewer vertices, e.g. K_{d+2}, whose edge count may be above the Maxwell bound for its own vertex set but still below d(d+9)/2. Therefore the displayed inequality is insufficient. The proof must rely on [12, Cor. 2] supplying a stronger statement, presumably a classification or edge-count lower bound for R_d-circuits on at most d+5 vertices. The corollary is neither stated nor proved, and it is cited exactly for the load-bearing independence claim. If G were not independent, the sequence of 1-extensions would not show that K_{d+2,d+3} minus two edges is independent, so K_{d+2,d+3} would not be established as a double R_d-circuit; the unbalanced k-fold construction for all k >= 2 would then collapse. This is a verifiability gap rather than a demonstrated error, but it is the weakest link in the strongest claim.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper develops k-fold circuit theory for generic d-dimensional rigidity matroids. Its main results are: (i) a negative theorem (Theorem 3.7) that R_d (d ≥ 4) fails the k-fold circuit property for every k ≥ 2, via the unbalanced double circuit K_{d+2,d+3}; (ii) two sufficient conditions for balancedness (Theorems 3.12 and 3.16); (iii) a proof that R_{2m}(K_n) fails the matroid matching property for m ≥ 2 (Proposition 3.19); and (iv) a coning theorem (Theorem 4.3) describing principal partitions under coning, with applications to almost-cones, edge addition, and X-replacement. The paper also records 2-sum and parallel-connection lemmas for k-fold circuits. The proofs are mostly detailed and the paper is well organised.","tokens_in":30090,"tokens_out":19341,"duration_ms":202735,"significance":"If correct, Theorem 3.7 closes the k-fold circuit route to matroid matching formulas for all d ≥ 4, complementing the known positive results for d = 1, 2. The coning theorem and the sufficient balancedness criteria are substantive new tools, and the applications to independent graphs and X-replacement are clean and useful. The paper is honest about its limitations, including the open R_3 case and the explicit Example 4.12 showing the difficulty of extending Theorem 4.10. Its main weakness is that the central negative result and the matroid-matching result depend on unstated or unproved structural facts about R_d-circuits; these are verifiability gaps rather than demonstrated errors.","major_comments":[{"comment":"The proof that the auxiliary graph G is R_d-independent is not self-contained. The displayed inequality |E(G)| = 5d + 4 < d(d+9)/2 is only the Maxwell upper bound for a graph on d + 5 vertices; it does not rule out an R_d-circuit on a proper subgraph, e.g. K_{d+2} has (d+2)(d+1)/2 edges and could in principle occur inside G. The argument therefore rests entirely on the unstated [12, Corollary 2], which is neither quoted nor proved. Since K = K_{d+2,d+3} - {uv, u'v'} is obtained from G by 1-extensions and the negative theorem depends on K being independent, this is a load-bearing gap. Please state [12, Corollary 2] and verify that it excludes circuits in all subgraphs of G, or replace it with a direct independence proof.","section":"§3.2, Theorem 3.7 (Figure 4)"},{"comment":"The proof asserts that 'every R_{2m}-circuit in G is a copy of K_{2m+2,2m+2}' and uses this to conclude independence after deleting two H-pairs and to bound r(H_i ∪ Z) in Case 3. This classification is not proved or cited in the manuscript. Without it the computation ν(H) = (m+1)(2m+3) - 2 and the lower bound on α(Z,π) are unsupported. Since this proposition is the paper's evidence that R_{2m}(K_n) fails the matroid matching property, the classification should be stated explicitly and proved, or a different argument supplied.","section":"§3.3, Proposition 3.19"}],"minor_comments":[{"comment":"The sentence 'As the sets A_i := K_{d+2,d+3} \\ G_i give a partition ... they must form its principal partition' is not a valid inference in general: further circuits, if present, would add further parts. The unbalance conclusion survives because the true number of parts is at least d + 3, but the sentence should be corrected or justified.","section":"§3.2, Theorem 3.7"},{"comment":"The text refers to 'Lemma 4.14' when discussing a lower bound on flexible k-fold circuits; the intended reference appears to be Lemma 4.19.","section":"§5, item 4"},{"comment":"The phrase 'The 2nd, 3rd and 4th authors recently generalised' is informal; please name the authors or make the reference to [17] explicit in the main text.","section":"Abstract and Introduction"},{"comment":"In the equilibrium stress equation (12), the indices of ω_{vu} and the displacement p(v) - p(u) are consistent only up to orientation; it would help to fix a convention and say that signs are irrelevant because stresses are defined up to scaling of each edge.","section":"§4"}],"recommendation":"major_revision","confidential_remarks":"This is a promising manuscript whose main claims seem likely correct, but the current version is not fully verifiable: Theorem 3.7 and Proposition 3.19 rely on unstated or unproved structural statements about R_d-circuits. These gaps are repairable without changing the overall architecture of the paper. The manuscript is within scope for a combinatorics journal, and I have no concerns about novelty or citation practice beyond the need to make the reliance on [12] explicit."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take. The paper is a genuine step forward on k-fold circuits in rigidity matroids, and the coning results are the strongest part. It shows Rd fails the k-fold circuit property for all d >= 4 and k >= 2, gives sufficient balance criteria (at most two technicolour vertices; all (k-1)-fold circuits rigid), and, most usefully, proves a coning lemma that controls the principal partition of G*v in terms of G, plus an almost-cone characterization and a corollary about adding two edges and remaining independent in dimension d+1. These are new results, not repackaged old ones. The proofs I checked are coherent, and the authors are honest about the open R3 case and the t > 2 limitation.\n\nThe soft spot is exactly where the stress-test points. Theorem 3.7 needs the auxiliary graph G to be Rd-independent. The text notes |E(G)| = 5d+4 < d(d+9)/2, then says [12, Corollary 2] implies it has no circuit. That Maxwell count on its own is not enough: a circuit could live on fewer vertices. So the argument leans entirely on an external corollary that is neither stated nor proved. I don't think it is wrong -- Grasegger, Guler, Jackson and Nixon likely do prove a bound that rules out circuits on at most d+5 vertices -- but the implication should be written out, and the corollary reproduced or at least stated precisely. As written, the paper's headline negative claim cannot be fully checked from the text.\n\nThere is a smaller verifiability issue: many foundational propositions are imported from the same group's earlier preprint [17]. That is a real reliance, but not a circularity problem: the new balance and coning theorems are derived, not restated.\n\nBottom line: this deserves a serious referee. The fix is local, make the [12, Corollary 2] application explicit, and the surrounding results carry real weight. I would want the referee to verify that corollary actually gives what the proof needs, but I would not desk reject this.","headline":"Solid, genuinely new paper on k-fold circuits in rigidity matroids, but the headline negative theorem leans on an unstated external corollary that needs to be on the page.","tokens_in":30586,"tokens_out":2637,"would_cite":true,"duration_ms":25800,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05B35","52C25"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every d ≥ 4 and k ≥ 2, the generic d-dimensional rigidity matroid R_d fails the k-fold circuit property, witnessed by the complete bipartite graph K_{d+2,d+3}.","keywords":["k-fold circuits","rigidity matroid","principal partition","coning","matroid matching","generic rigidity","balanced circuits","2-sum"],"falsifier":"For $d = 4$, compute the generic rank of the rigidity matrix of the graph in Figure 4, which has $5d+4 = 24$ edges on $d+5 = 9$ vertices: the construction requires this graph to be independent. Equivalently, check that $K_{6,7}$ with two independent edges removed has generic rank exactly 40; if it is less, the unbalanced double $R_4$-circuit witness fails.","tokens_in":29685,"feed_emoji":"📐","tokens_out":10483,"duration_ms":109453,"temperature":0.7,"texified_at":"2026-08-05T20:00:54.914668+00:00","pith_summary":"This paper uses $k$-fold circuits—edge sets whose rank falls $k$ short of their size and that remain cyclic after deleting any element—to probe the generic $d$-dimensional rigidity matroid $R_d$. It shows that for all $d \\geq 4$ and all $k \\geq 2$, $R_d$ does not satisfy the $k$-fold circuit property: the complete bipartite graph $K_{d+2,d+3}$ is exhibited as an unbalanced double circuit whose principal partition has $d+3$ parts, and adding disjoint copies of $K_{d+2}$ turns it into an unbalanced $k$-fold circuit. Because balanced double circuits are what make the classical min-max formula for matroid matching exact, this closes a natural route to matching formulas in dimensions four and higher. The paper also gives two sufficient conditions for a $k$-fold circuit to be balanced, and extends the cone operation: a graph is a $k$-fold $R_d$-circuit exactly when its cone is a $k$-fold $R_{d+1}$-circuit, with enough control over principal partitions to characterise minimal rigidity of almost-cones, prove an add-two-edges independence corollary, and identify the smallest flexible double circuit.","texify_model":"deepseek-v4-flash","texify_usage":{"total_tokens":8825,"prompt_tokens":846,"completion_tokens":7979,"prompt_tokens_details":{"cached_tokens":0},"prompt_cache_hit_tokens":0,"prompt_cache_miss_tokens":846,"completion_tokens_details":{"reasoning_tokens":7142}},"feed_headline":"Rigidity matroids fail the k-fold circuit property for d ≥ 4","feed_subtitle":"A complete bipartite graph K_{d+2,d+3} is an unbalanced double circuit, blocking the matroid-matching route to exact formulas.","key_machinery":"The governing object is the $k$-fold circuit and its principal partition. A $k$-fold circuit is a cyclic edge set $D$ with rank $r(D) = |D| - k$; its principal partition splits $D$ into parts by declaring two elements equivalent when deleting both lowers the rank by exactly one, equivalently when they lie in exactly the same collection of $(k-1)$-fold circuits. Balancedness is the condition $r\\left(\\cap_i cl(D \\setminus A_i)\\right) = \\ell - k$, and the paper pushes this condition through 2-sums, parallel connections, and coning. The second workhorse is the cone operation $G * v$, with the rank identity $r_{d+1}(G * v) = r_d(G) + |V(G)|$; this transfers independence, circuits, and $k$-fold circuits between dimensions and underlies the a","core_discovery":"The paper's central claim is that $k$-fold circuits, together with their principal partitions, can be carried through the standard graph operations of 2-sums, parallel connections, and coning in rigidity matroids, and that doing so settles the balancedness question in every dimension $d \\geq 4$. The headline negative result asserts that $R_d$ lacks the $k$-fold circuit property for every $d \\geq 4$ and $k \\geq 2$: $K_{d+2,d+3}$ is an unbalanced double $R_d$-circuit whose principal partition has $d+3$ parts, and adjoining $k-2$ edge-disjoint copies of the $R_d$-circuit $K_{d+2}$ gives an unbalanced $k$-fold circuit. Since the $k$-fold circuit property is the known route from balanced double circuits to an exact min-max formula f","pith_inferences":["Read as a tool, the coning theorem reduces a high-dimensional independence question to a lower-dimensional one only for vertices of degree at least n−3; the paper leaves implicit whether iterating the argument yields an inductive rank algorithm on graphs with a chain of high-degree vertices.","The counterexample family is complete bipartite, so a natural next test is whether the k-fold circuit property holds on rigidity matroids restricted to sparse or K_{d+1}-free graph classes; if it does, matroid matching formulas could survive in those restricted settings.","Example 4.12 identifies the true obstruction to extending the two-spoke theorem to three spokes: the lattice of sub-k-fold circuits inside a 3-fold circuit is far more complex than the principal partition, so any t ≥ 3 version would need to control that lattice rather than just one partition.","The uniqueness of the closed double banana as the smallest flexible double circuit suggests that other flexible higher-fold circuits might be classified by iterated gluing along K_{d-1}, giving a structural family for testing future conjectures."],"forward_implications":["For d ≥ 4, no exact min-max matroid matching formula for R_d can be derived from the double circuit property; for even d ≥ 4, R_{2m}(K_n) actually fails the matroid matching property when n ≥ 4m+5.","A cone graph with one or two edges to the apex deleted is minimally rigid in dimension d+1 exactly when the base graph is R_d-rigid with the expected edge count, the residual graph is R_d-independent, and each deleted spoke lies on an R_d-circuit (with a neighbourhood condition in the two-spoke case).","Adding at most two edges to an R_d-independent graph always yields an R_{d+1}-independent graph, which verifies a special case of X- and V-replacement in every dimension.","If all the (k−1)-fold circuits inside a k-fold R_d-circuit are rigid, or if the circuit has at most two technicolour vertices, then it is balanced, so the negative theorem does not preclude a substantial class of balanced examples.","The unique smallest flexible double R_d-circuit is the closed double banana built from two copies of K_{d+2} glued along a K_{d-1}; no analogous tight bound is known for k ≥ 3."],"supporting_citations":[{"why":"Defines k-fold circuits, principal partitions, balancedness, and the k-fold circuit property used throughout the paper.","marker":"[17]"},{"why":"Supplies the flexible-circuit and independence results, including the corollary invoked in the proof of Theorem 3.7, and the closure of circuits under graphical 2-sums.","marker":"[12]"},{"why":"Establishes the exact min-max matroid matching theorem for matroids with the double circuit property, which motivates the balancedness condition.","marker":"[7]"},{"why":"Gives the cone rank formula r_{d+1}(G ∗ v) = r_d(G) + |V| and the cone independence equivalence that the coning results extend.","marker":"[27]"},{"why":"Shows how 2-sums behave in rigidity matroids, enabling the transfer between graphical and matroidal 2-sums and parallel connections.","marker":"[24]"},{"why":"Shows that K_{d+2,d+2} is an R_d-circuit, the building block for the unbalanced double circuit in Theorem 3.7.","marker":"[15]"},{"why":"Proves the double circuit property for R_2, the low-dimensional positive baseline that the higher-dimensional negative results contrast with.","marker":"[20]"}],"fun_headline_variants":["No k-fold circuits in rigidity matroids for d≥4","Unbalanced double circuit blocks rigidity formulas","k-fold circuit property fails for all d≥4 in R_d","Rigidity matroids: coning helps, but balancedness fails","Double circuit counterexample stalls exact rigidity formula"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The negative theorem leans on a quoted independence criterion for a specific sparse graph: if that criterion does not apply, $K_{d+2,d+3}$ is not shown to be a double circuit and the whole failure proof for the double case collapses.","fun_headline_variants_meta":{"raw":{"variants":["No k-fold circuits in rigidity matroids for d≥4","Unbalanced double circuit blocks rigidity formulas","k-fold circuit property fails for all d≥4 in R_d","Rigidity matroids: coning helps, but balancedness fails","Double circuit counterexample stalls exact rigidity formula"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000873,"raw_usage":{"total_tokens":3609,"prompt_tokens":732,"completion_tokens":2877,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":476,"completion_tokens_details":{"reasoning_tokens":2797}},"tokens_in":476,"tokens_out":2877,"duration_ms":26294,"temperature":1.0,"reasoning_tokens":2797,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T16:09:42.760967+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $d = 4$, compute the generic rank of the rigidity matrix of the graph in Figure 4, which has $5d+4 = 24$ edges on $d+5 = 9$ vertices: the construction requires this graph to be independent. Equivalently, check that $K_{6,7}$ with two independent edges removed has generic rank exactly 40; if it is less, the unbalanced double $R_4$-circuit witness fails.","supporting_citations":[{"cited_title":"Jackson, A","cited_arxiv_id":null,"evidence_quote":"Defines k-fold circuits, principal partitions, balancedness, and the k-fold circuit property used throughout the paper."},{"cited_title":"Grasegger, H","cited_arxiv_id":null,"evidence_quote":"Supplies the flexible-circuit and independence results, including the corollary invoked in the proof of Theorem 3.7, and the closure of circuits under graphical 2-sums."},{"cited_title":"Dress and L","cited_arxiv_id":null,"evidence_quote":"Establishes the exact min-max matroid matching theorem for matroids with the double circuit property, which motivates the balancedness condition."},{"cited_title":"Whiteley, Cones, infinity and one-story buildings, Structural Topology, 8 (1983) 53–70","cited_arxiv_id":null,"evidence_quote":"Gives the cone rank formula r_{d+1}(G ∗ v) = r_d(G) + |V| and the cone independence equivalence that the coning results extend."},{"cited_title":"Servatius and H","cited_arxiv_id":null,"evidence_quote":"Shows how 2-sums behave in rigidity matroids, enabling the transfer between graphical and matroidal 2-sums and parallel connections."},{"cited_title":"Graver, B","cited_arxiv_id":null,"evidence_quote":"Shows that K_{d+2,d+2} is an R_d-circuit, the building block for the unbalanced double circuit in Theorem 3.7."},{"cited_title":"Makai, Matroid matching with Dilworth truncation, Discrete Mathematics, 308 (2008) 1394–1404","cited_arxiv_id":null,"evidence_quote":"Proves the double circuit property for R_2, the low-dimensional positive baseline that the higher-dimensional negative results contrast with."}],"review_version":1}