Realized Rank Certificates for Matchstick Frameworks and Insertion Edges

Mike Winkler

Home/Archive/arXiv

arXiv · 2607.06576

Realized Rank Certificates for Matchstick Frameworks and Insertion Edges

Mike Winkler

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give an exact, checkable rank-certificate method for realized planar unit-distance frameworks. The method is motivated by Vogel's computations for matchstick graphs and by the insertion-edge tests used in the Matchstick Graphs Calculator. Its algebraic core is independent of geometry. A singular square matrix $M$ is replaced by a sparse perturbation $B=M+UCV^T$. If $B$ is nonsingular and the inverse satisfies $V^TB^{-1}U=C^{-1}$, then the columns of $B^{-1}U$ and the rows of $V^TB^{-1}$ form bases of the right and left kernels of $M$, and the rank defect of $M$ is certified. Applied to the equilibrium matrix of a planar framework, this gives finite exact certificates for self-stresses, infinitesimal motions, redundant edges, and candidate edges whose constraints are already forced by the realized framework. The certificate data can be checked independently from the search that produced it, using exact matrix identities. We emphasize that matchstick frameworks are not generic: unit distances, triangles, rhombi, and symmetries can change the realized rank. The method therefore concerns the coordinate-dependent representation of a given drawing, not only the generic rigidity matroid of the abstract graph.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Mike Winkler. 2026-07-02. Realized Rank Certificates for Matchstick Frameworks and Insertion Edges. https://arxiv.org/abs/2607.06576

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗