Pith. sign in

REVIEW 2 major objections 4 minor 28 references

$k$-fold circuits and coning in rigidity matroids

T0 review · 2 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read 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}.

desk verdict 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. read the letter →

arxiv 2508.18838 v2 pith:MBGG7SYV submitted 2025-08-26 math.CO math.MG

John Hewetson , Bill Jackson , Anthony Nixon , Ben Smith This is my paper · ORCID
classification math.COmath.MG MSC 05B3552C25
keywords k-foldcircuitsrigiditymatroidprincipalpartitionconingmatchinggenericbalanced2-sum
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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

What would settle it

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.

Watch

Extended reading notes

Core claim

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

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

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.

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 (2)
  1. [§3.2, Theorem 3.7 (Figure 4)] 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.
  2. [§3.3, Proposition 3.19] 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.
minor comments (4)
  1. [§3.2, Theorem 3.7] 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.
  2. [§5, item 4] 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.
  3. [Abstract and Introduction] 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.
  4. [§4] 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.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the main results are derived from prior rigidity and matroid theorems, not by assuming what they prove.

full rationale

The paper's central claims—Theorem 3.7 (failure of the k-fold circuit property for d ≥ 4), the balance criteria Theorems 3.12 and 3.16, the coning Theorem 4.3, and the almost-cone characterization Theorem 4.10—are new derivations built on the k-fold circuit framework from [17] and prior rigidity results such as [12], [24], and [27]. The k-fold circuit definitions and foundational inequalities are quoted from [17], which is a self-citation by three of the four authors; however, the present paper does not reduce its conclusions to the conclusions of [17]. The foundational propositions are used as tools, not as the target results. The proof of Theorem 3.7 relies on [12, Corollary 2] to certify that the auxiliary graph G in Figure 4 is R_d-independent. This citation is load-bearing, and [12] shares two authors with the present paper, but it is an external published theorem with an independent proof, whose assumptions do not include the k-fold circuit property or the negative theorem being proved. The displayed inequality 5d+4 < d(d+9)/2 alone would not justify independence, so the unstated content of [12, Corollary 2] is a verifiability gap and a potential correctness risk, but not a circular step. No fitted parameters, empirical predictions, or renamed known results are present. The paper does not smuggle in an ansatz by self-citation or import a uniqueness theorem from its own authors. Overall, the derivation chain is self-contained modulo legitimate external results; the self-citations are real reliance but do not make the central claims circular.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No free parameters were fitted; this is a purely combinatorial and matroidal paper. All constants are standard dimension parameters. The main external assumptions are cited theorems from prior literature, with a notable reliance on the same authors' earlier preprint [17] and one opaquely invoked corollary [12, Corollary 2].

assumptions (6)
  • standard math Standard matroid rank, circuits, duals, closure, 2-sums, parallel connections and their flat descriptions (Oxley).
    Used throughout as background definitions and standard facts.
  • standard math Generic frameworks have rank independent of the particular algebraically independent realisation (Asimov-Roth).
    Defines R_d and justifies calling edge sets independent in the rigidity matroid.
  • domain assumption Whiteley's coning rank formula and the circuit-cone equivalence from Garamvölgyi et al.
    Imported as Lemmas 2.5 and 2.6 and used throughout the cone results.
  • domain assumption Foundational facts on k-fold circuits and principal partitions from the same authors' preprint [17].
    Propositions 2.8, Lemma 2.9, Theorem 2.12, Corollary 2.14, and Proposition 2.15 are taken from [17]; the paper's edifice rests on these.
  • domain assumption K_{d+2,d+2} is an R_d-circuit for all d >= 3, from Graver et al. [15, Theorem 5.2.1].
    Used in Theorem 3.7 to identify circuits inside K_{d+2,d+3}.
  • domain assumption [12, Corollary 2] gives an exact condition implying the auxiliary graph G in Figure 4 is R_d-independent.
    Load-bearing for the negative result; the corollary is not stated or proved in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of $k$-fold circuits and coning in rigidity matroids." pith.science (2026). https://pith.science/paper/MBGG7SYV

@misc{pith2026250818838,
  author       = {Pith},
  title        = {Pith review of: $k$-fold circuits and coning in rigidity matroids},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MBGG7SYV}},
  note         = {Machine review of arXiv:2508.18838}
}
abstract

In 1980 Lov\'{a}sz introduced the concept of a double circuit in a matroid. The 2nd, 3rd and 4th authors recently generalised this notion to $k$-fold circuits (for any natural number $k$) and proved foundational results about these $k$-fold circuits. In this article we use $k$-fold circuits to derive new results on the generic $d$-dimensional rigidity matroid $\mathcal{R}_d$. These results include analysing 2-sums, showing sufficient conditions for the $k$-fold circuit property to hold for $k$-fold $\mathcal{R}_d$-circuits, and giving an extension of Whiteley's coning lemma. The last of these allows us to reduce the problem of determining if a graph $G$ with a vertex $v$ of sufficiently high degree is independent in $\mathcal{R}_d$ to that of verifying matroidal properties of $G-v$ in $\mathcal{R}_{d-1}$.

Figures

Figures reproduced from arXiv: 2508.18838 by the authors.

Figure 1
Figure 1. Four examples of double R2-circuits. Remark 2.11. Many of the fundamental properties of k-fold circuits arise from the observation that D ⊆ E is a k-fold circuit of a matroid M if and only if E \ D is a flat of the dual matroid M∗ of rank |E| −r(E)−k. From this, one can deduce that the cyclic sets of M form a lattice that is dual to the lattice of flats of M∗ . This viewpoint also sheds light on the principal partit… view at source ↗
Figure 2
Figure 2. A trivial double R2-circuit arising as a 2-sum where neither graph is a double R2-circuit. Example 3.6. The double banana is a well known example of a flexible R3-circuit, obtained as the graphical 2-sum of two copies of K5 along a common edge e. For d ≥ 3, it can be generalised to the graph Bd,d−1, defined by letting Bd,d−1 = (G1 ∪ G2) − e where Gi ∼= Kd+2, G1 ∩ G2 ∼= Kd−1 and e ∈ E(G1 ∩ G2). From [12, Lemma 11] an… view at source ↗
Figure 3
Figure 3. 3.2 Balanced k-fold circuits in rigidity matroids Recall that a matroid M satisfies the k-fold circuit property if all its k-fold circuits are balanced. It is easy to construct examples of rigidity matroids where the double circuit property fails if we consider the rigidity matroid of an arbitrary graph. However, if the graph is complete and hence M = Rd, then the double circuit property holds for both d = 1, 2: the… view at source ↗
Figures from the paper (5 more)
Figure 3
Figure 3. Figure 3: The (k + 1)-tuple banana B (k+1) 3,2 from Example 3.6, obtained as an iterated graphical 2-sum of k + 1 copies of K5. It is a flexible k-fold R3-circuit. u1 u2 u3 u4 v1 · · · · · · · · · vd−1 vd vd+1 [PITH_FULL_IMAGE:figures/full_fig_p009_3.png]
Figure 4
Figure 4. Figure 4: The Rd-independent graph G from the proof of Theorem 3.7. It is a copy of K4,d+1 with d edges added: u1u2, u3u4 and vivi+1 for 1 ≤ i ≤ d − 2. Theorem 3.7. Rd does not satisfy the k-fold circuit property for any d ≥ 4 and any k ≥ 2. Proof. We first show that Rd does not…
Figure 5
Figure 5. Figure 5: The cones of four double R2-circuits. {A′ 1 , A′ 2 , . . . , A′ 11} of the cone from {A1, A2, . . . , A7} by adding u1v, u2v to the part A1 which contains the edges incident to u1, u2 to form A′ 1 , putting A′ i = Ai for 2 ≤ i ≤ 7 and using the four edges from v to the…
Figure 6
Figure 6. Figure 6: The left graph G ∗ v is the cone of the right graph G, a 3-fold R2-circuit. 4.2 Adding edges to Rd-independent graphs As a second application of Theorem 4.3 we have the following. Corollary 4.13. Let G be obtained from an Rd-independent graph by adding at most 2 edges.…
Figure 7
Figure 7. Figure 7: Illustration of 3-dimensional X- and V -replacements. • a (d-dimensional) X-replacement if there exists non-adjacent edges uv and xy in G such that G′ is G − {uv, xy} plus an additional vertex w of degree d + 2 adjacent to u, v, x, y; • a (d-dimensional) V -replacement…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 27 canonical work pages

  1. [17]

    Jackson, A

    B. Jackson, A. Nixon and B. Smith, k-fold circuits in matroids, preprint, (2024) arXiv:2412.14782

    work page arXiv 2024

  2. [1]

    Asimow and B

    L. Asimow and B. Roth, The rigidity of graphs, Transactions of the American Mathematical Society , 245 (1978) 279–289

    work page 1978

  3. [2]

    Barakat, R

    M. Barakat, R. Behrends, C. Jefferson, L. K¨ uhne, and M. Leu ner, On the Generation of Rank 3 Simple Matroids with an Application to Terao’s Freeness Conjecture, SIAM Journal on Discrete Mathematics , 35:2 (2021). 24

    work page 2021

  4. [3]

    Berg and T

    A. Berg and T. Jord´ an, A proof of Connelly’s conjecture on 3-c onnected circuits of the rigidity matroid, Journal of Combinatorial Theory: Series B , 88:1 (2003) 77–97

    work page 2003

  5. [4]

    Brylawski, Constructions, in Theory of Matroids , N

    T. Brylawski, Constructions, in Theory of Matroids , N. White, Ed. Cambridge: Cambridge University Press (1986) 127—223

    work page 1986

  6. [5]

    Clinch, B

    K. Clinch, B. Jackson and S. Tanigawa, Abstract 3-Rigidity and Biv ariate C1 2 -Splines I: Whiteley’s Maximality Conjecture, Discrete Analysis, 2 (2022) 50p

    work page 2022

  7. [6]

    Coullard and L

    C.R. Coullard and L. Hellerstein, Independence and port oracles f or matroids, with an application to computational learning theory, Combinatorica, 16 (1996) 189–208

    work page 1996

  8. [7]

    Dress and L

    A. Dress and L. Lov´ asz, On some combinatorial properties of a lgebraic matroids, Combinatorica, 7 (1987) 39–48

    work page 1987

Show all 28 references
  1. [8]

    Eftekhari, B

    Y. Eftekhari, B. Jackson, A. Nixon, B. Schulze, S. Tanigawa and W. Whiteley, Point-hyperplane frame- works, slider joints and rigidity preserving transformations, Journal of Combinatorial Theory: Series B, 135 (2019) 44–74

    2019

  2. [9]

    Garamv¨ olgyi, S

    D. Garamv¨ olgyi, S. Gortler and T. Jord´ an, Globally rigid graphs a re fully reconstructible, Forum of Mathematics, Sigma , 10 (2022)

    2022

  3. [10]

    Garamv¨ olgyi and T

    D. Garamv¨ olgyi and T. Jord´ an, Minimally globally rigid graphs, European Journal of Combinatorics , 108 (2023) 103626

    2023

  4. [11]

    Garamv¨ olgyi, Stress-linked pairs of vertices and the gener ic stress matroid, arXiv:2308.16851

    D. Garamv¨ olgyi, Stress-linked pairs of vertices and the gener ic stress matroid, arXiv:2308.16851

    arXiv

  5. [12]

    Grasegger, H

    G. Grasegger, H. Guler, B. Jackson and A. Nixon, Flexible circuit s in the d-dimensional rigidity matroid, Journal of Graph Theory , 100:2, (2021) 315–330

    2021

  6. [13]

    Grasegger, H

    G. Grasegger, H. Guler, B. Jackson and A. Nixon, Corrigendum to Flexible circuits in the d-dimensional rigidity matroid, Journal of Graph Theory , 103:2, (2022) 307–308

    2022

  7. [14]

    Graver, Rigidity matroids, SIAM Journal on Discrete Mathematics , 4 (1991) 355–368

    J. Graver, Rigidity matroids, SIAM Journal on Discrete Mathematics , 4 (1991) 355–368

    1991

  8. [15]

    Graver, B

    J. Graver, B. Servatius and H. Servatius, Combinatorial rigidit y, American Mathematical Society, Grad- uate Studies in Mathematics, Providence, RI, 1993

    1993

  9. [16]

    Jackson and T

    B. Jackson and T. Jord´ an, Thed-dimensional rigidity matroid of sparse graphs, Journal of Combinatorial Theory: Series B , 95 (2005) 118–133

    2005

  10. [18]

    Laman, On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics 4 (1970) 331–340

    G. Laman, On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics 4 (1970) 331–340

    1970

  11. [19]

    Lov´ asz, Matroid matching and some applications, Journal of Combinatorial Theory: Series B , 28 (1980) 208–236

    L. Lov´ asz, Matroid matching and some applications, Journal of Combinatorial Theory: Series B , 28 (1980) 208–236

    1980

  12. [20]

    Makai, Matroid matching with Dilworth truncation, Discrete Mathematics, 308 (2008) 1394–1404

    M. Makai, Matroid matching with Dilworth truncation, Discrete Mathematics, 308 (2008) 1394–1404

    2008

  13. [21]

    J. C. Maxwell, On the calculation of the equilibrium and stiffness of f rames, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science , 27:182 (1864) 294–299

  14. [22]

    Oxley, Matroid Theory, Oxford Science Publications, The Clar endon Press, Oxford University Press, NewYork, 1992

    J. Oxley, Matroid Theory, Oxford Science Publications, The Clar endon Press, Oxford University Press, NewYork, 1992

    1992

  15. [23]

    H. Pollaczek-Geiringer, Uber die Gliederung ebener Fachwerke, ZAMM - Journal of Applied Mathe- matics and Mechanics / Zeitschrift fur Angewandte Mathemat ik und Mechanik , 7 (1927), 58-72 and 12 (1932) 369-376. 25

    1927

  16. [24]

    Servatius and H

    B. Servatius and H. Servatius, On the 2-sum in rigidity matroids, European Journal of Combinatorics , 32 (2011) 931–936

    2011

  17. [25]

    Tay, On generically dependent bar frameworks in space, Structural Topology, 20 (1993) 27–48

    T.-S. Tay, On generically dependent bar frameworks in space, Structural Topology, 20 (1993) 27–48

    1993

  18. [26]

    Tay and W

    T.-S. Tay and W. Whiteley, Generating isostatic frameworks, Structural Topology, 11 (1985) 20–69

    1985

  19. [27]

    Whiteley, Cones, infinity and one-story buildings, Structural Topology, 8 (1983) 53–70

    W. Whiteley, Cones, infinity and one-story buildings, Structural Topology, 8 (1983) 53–70

    1983

  20. [28]

    Whiteley, Some matroids from discrete applied geometry, in Matroid Theory , J

    W. Whiteley, Some matroids from discrete applied geometry, in Matroid Theory , J. E. Bonin, J. G. Oxley, and B. Servatius eds., Contemporary Mathematics 197, Ame rican Mathematical Society, 1996, 171–313. 26

    1996

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.