Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 23 tok/s
GPT-5 High 24 tok/s Pro
GPT-4o 93 tok/s
GPT OSS 120B 457 tok/s Pro
Kimi K2 212 tok/s Pro
2000 character limit reached

Mobility of geometric constraint systems with extrusion symmetry (2304.12740v2)

Published 25 Apr 2023 in math.MG and math.CO

Abstract: If we take a (bar-joint) framework, prepare an identical copy of this framework, translate it by some vector $\tau$, and finally join corresponding points of the two copies, then we obtain a framework with extrusion' symmetry in the direction of $\tau$. This process may be repeated $t$ times to obtain a framework whose underlying graph has $\mathbb{Z}_2^t$ as a subgroup of its automorphism group and which has$t$-fold extrusion' symmetry. We show that while $t$-fold extrusion symmetry is not a point-group symmetry, the rigidity matrix of a framework with $t$-fold extrusion symmetry can still be transformed into a block-decomposed form in the analogous way as for point-group symmetric frameworks. This allows us to use Fowler-Guest-type character counts to analyse the mobility of such frameworks. We show that this entire theory also extends to the more general point-hyperplane frameworks with $t$-fold extrusion symmetry. Moreover, we show that under suitable regularity conditions the infinitesimal flexes we detect with our symmetry-adapted counts extend to finite (continuous) motions. Finally, we establish an algorithm that checks for finite motions via linearly displacing framework points along velocity vectors of infinitesimal motions.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)