Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.38396

Destroying Rigidity in the Plane

Yu Cong·Chao Xu·Yajie Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

Rigidity and global rigidity are fundamental graph properties in discrete geometry, with applications to structural engineering and network localization. In two dimensions, both admit combinatorial characterizations in terms of the rigidity matroid and graph connectivity. We study the computational complexity of finding minimum-cost sets of edges or vertices whose deletion destroys either property in a finite simple graph. With unit costs, we give deterministic polynomial-time algorithms for edge deletion destroying global rigidity and vertex deletion destroying either property. We prove that edge deletion destroying rigidity is NP-hard and that, with positive integer costs, all four problems are NP-hard. These results resolve, in dimension two, the open questions on recognizing robustness under edge and vertex deletions posed by Jordán and Whiteley (2017), as well as the minimum edge-deletion problem for rigidity recorded in EGRES Open.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu Cong, Chao Xu, Yajie Zhao. 2026-10-28. Destroying Rigidity in the Plane. https://arxiv.org/abs/2610.38396

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

KEEP EXPLORING

Related papers

arXiv2026

Tight Lower Bound for Multicolor Discrepancy

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $Ω(\sqrt{n})$. This improves on the previously known lower bound of $Ω(\sqrt{n/\log k})$ due to Caragiannis et al. (arXiv:2502.10516). As an application, we show that our result implies improved lower bounds for group fair division.

cs.DM↗
arXiv2026

Upper Bounds for CSP Non-redundancy via Locally Decodable Codes

In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independent. In the last few years, CSP non-redundancy has found a number of applications including in query complexity, sparsification, kernelization and streaming. In this paper, we present a novel technique for upper-bounding the non-redundancy of some relations using locally decodable codes (LDCs) and locally correctable codes (LCCs). More precisely, known limitations on the structure of 2-query LDCs and LCCs can be translated into limitations on the size of certain non-redundant CSP instances. This technique builds on a technique used by Brakensiek and Guruswami [STOC 2025] to bound non-redundancy via techniques from matching vector codes. Using LDCs and LCCs, we give improved upper bounds on non-redundancy of the BCK predicate pioneered by Bessiere, Carbonnel, and Katsirelos [AAAI 2020] as well as its well-studied Boolean variant. We also give the first example of a Boolean predicate whose non-redundancy is provably not of the form $n^{k\pm o(1)}$ for some positive integer $k$.

cs.DM↗
arXiv2026

An Unconditional Lower Bound for the Active-Set Method in Almost-Linear Programming

We prove that, for every fixed $ε\in(0,1]$, the active-set method requires exponentially many iterations in the worst case to maximize a convex objective of the form $(x_1)^{1+ε}+\vec c^{\top}\vec x$ subject to linear constraints, regardless of the pivot rule used. Our lower bound therefore holds for objectives arbitrarily close to the linear case $ε=0$, where the active-set method coincides with the simplex method and a lower bound for all pivot rules would constitute a major breakthrough. The special case $ε=1$ yields a lower bound in convex quadratic maximization. This improves on the best previously known lower bound [IPCO 2025] requiring polynomial objectives of degree $ω(\log d)$ in dimension $d$ and firmly resolves the open question of whether a constant degree suffices. Our result is based on a novel extended formulation, recursively constructed using deformed products. Its key feature is that it projects onto a polygonal approximation of a parabola while preserving all of its exponentially many vertices. We define a convex objective with a single non-linear variable that forces the active-set method to follow the parabolic boundary of this projection, without allowing any shortcuts along chords corresponding to edges of its full-dimensional preimage.

cs.DM↗