Using a CAS/DGS to Analyze Computationally the Configuration of Planar Bar Linkage Mechanisms Based on Partial Latin Squares

Abstract

Currently, the study of new isotopism invariants of partial Latin squares constitutes an open and active problem. This paper delves into this topic by analyzing computationally the configuration of planar bar linkage mechanisms for which the array formed by the lengths of their bars constitutes an empty-diagonal symmetric partial Latin square such that each one of its rows and columns has at least two non-empty cells. These assumptions enable one to define a series of algebraic and geometric constraints that can be readily implemented in any Computer Algebra or Dynamic Geometry System. In order to illustrate the different concepts and results introduced throughout the paper, it is explicitly determined and characterized the distribution of planar bar linkage mechanisms based on partial Latin squares of order up to five.