Related papers: Non-Euclidean braced grids
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
Minimal obstructions for embedding 4-regular Eulerian digraphs on the plane are considered in relation to the partial order defined by the cycle removal operation. Their basic properties are provided and all obstructions with parallel arcs…
A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.
We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…
A pancyclic graph is a graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. In this paper, we establish some new sufficient conditions for a graph to be pancyclic in terms of the edge…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
A {\em thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of $n$ vertices has at most $1.3984n$ edges. {\em…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.
For flexibility of an octahedron we find necessary metric conditions in terms of edge lengths. These conditions yield a new description of Bricard's octahedra, suitable for solving some problems in metric geometry of octahedra, in…
For two-component assemblies, an inherent structure diagram (ISD) is the relationship between set inter-subunit energies and the types of kinetic traps (inherent structures) one may obtain from those energies. It has recently been shown…
An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
We study the spectrum of complete noncompact manifolds with bounded curvature and positive injectivity radius. We give general conditions which imply that their essential spectrum has an arbitrarily large finite number of gaps. In…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
This article reveals an analysis of the quadratic systems that hold multiparametric families therefore, in the first instance the quadratic systems are identified and classified in order to facilitate their study and then the stability of…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…