Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in $\mathbb{R}^2$ (2110.00063v2)

Published 30 Sep 2021 in math.CO

Abstract: We study the bar-and-joint frameworks in $\mathbb{R}2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked that the corresponding matroid and its rank function can be characterised by using a submodular function. In this paper, we will transfer this characterisation of the rank function to the form of the value of a ``1-thin cover" and obtain a sufficient connectivity condition for rigidity and global rigidity of these frameworks analogous to the results of Lov\'asz and Yemini (1982).

Summary

We haven't generated a summary for this paper yet.