2022
DOI: 10.26493/2590-9770.1379.7a4
|View full text |Cite
|
Sign up to set email alerts
|

Bracing frameworks consisting of parallelograms

Abstract: A rectangle in the plane can be continuously deformed preserving its edge lengths, but adding a diagonal brace prevents such a deformation. Bolker and Crapo characterized combinatorially which choices of braces make a grid of squares infinitesimally rigid using a bracing graph: a bipartite graph whose vertices are the columns and rows of the grid, and a row and column are adjacent if and only if they meet at a braced square. Duarte and Francis generalized the notion of the bracing graph to rhombic carpets, pro… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 36 publications
0
9
0
Order By: Relevance
“…(ii) ⇔ (iii): The proof of this for finite P-frameworks (see [12,Theorem 4.5]) extends to countably infinite P-frameworks.…”
Section: Proof Of Theorem 12 ¬(Ii) ⇒ ¬(I)mentioning
confidence: 93%
See 4 more Smart Citations
“…(ii) ⇔ (iii): The proof of this for finite P-frameworks (see [12,Theorem 4.5]) extends to countably infinite P-frameworks.…”
Section: Proof Of Theorem 12 ¬(Ii) ⇒ ¬(I)mentioning
confidence: 93%
“…To determine which braced Penrose frameworks are rigid, we shall study the much larger class of P-frameworks (Definition 4.3). First defined in [12] as the generalization of 1-skeletons of parallelogram tilings, it was shown by Grasegger and Legerský for a finite P-framework (G, ρ) with some parallelograms braced, the following properties are equivalent: (i) (G, ρ) is rigid, (ii) G has a cartesian NAC-coloring (Definition 4.7), and (iii) the bracing graph (Definition 4.5) of (G, ρ) is connected. We shall extend this result to countably infinite P-frameworks, allowing us to give a characterization for rigid braced Penrose frameworks.…”
Section: Theorem 11 a Countably Infinite Connected Graph Admits A Fle...mentioning
confidence: 99%
See 3 more Smart Citations