Related papers: General position stresses
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
In this paper we consider the question of determining the geometric genera of irreducible curves lying on a very general surface $S$ of degree $d$ at least 5 in $\mathbb{P}^3$ (the cases $d \leqslant 4$ are well known). We introduce the set…
In this paper, we give a complete self-contained proof that the rigidity matrix of a symmetric bar and joint framework (as well as its transpose) can be transformed into a block-diagonalized form using techniques from group representation…
Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…
We characterize the rank of edge connection matrices of partition functions of real vertex models, as the dimension of the homogeneous components of the algebra of $G$-invariant tensors. Here $G$ is the sub- group of the real orthogonal…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…
Generalized diagonal matrices are matrices that have two ladders of entries that are zero in the upper right and bottom left corners. The minors of generic generalized diagonal matrices have square-free initial ideals. We give a description…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
Normal matrices, or matrices which commute with their adjoints, are of fundamental importance in pure and applied mathematics. In this paper, we study a natural functional on the space of square complex matrices whose global minimizers are…
Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each…
We call a finite-dimensional K-algebra A geometrically irreducible if for all d, all connected components of the affine scheme of d-dimensional A-modules are irreducible. We show that the geometrically irreducible algebras without loops…
We develop a novel approach to gravity that we call `matrix general relativity' (MGR) or `gravitational chromodynamics' (GCD or GQCD for quantum version). Gravity is described in this approach not by one Riemannian metric (i.e. a symmetric…
We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…
A subset $R\subseteq V(G)$ of a graph $G$ is a general position set if any triple set $R_0$ of $R$ is non-geodesic in $G$, that is, no vertex of $R_0$ lies on any geodesic between the other two vertices of $R_0$ in $G$. Let $\mathcal{R}$ be…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
Let $\mathcal{F}$ be written as $ f^{*}(\mathcal{G})$, where $\mathcal{G}$ is a $1$-dimensional foliation on $ {\mathbb P^{n-1}}$ and $f:{\mathbb P^n}--->{\mathbb P^{n-1}}$ a non-linear generic rational map. We use local stability results…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…