Related papers: Super Stable Tensegrities and the Colin de Verdi\`…
A tensegrity is a structure made from cables, struts and stiff bars. A $d$-dimensional tensegirty is universally rigid if it is rigid in any dimension $d'$ with $d'\geq d$. The celebrated super stability condition due to Connelly gives a…
A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…
A discrete tensegrity framework can be thought of as a graph in Euclidean n-space where each edge is of one of three types: an edge with a fixed length (bar) or an edge with an upper (cable) or lower (strut) bound on its length. Roth and…
Many mechanical structures, both engineered and biological, combine heavy rigid elements such as bones and beams with lightweight flexible ones such as cables and membranes. These are referred to as tensegrities, reflecting that cables can…
In this small note, we collect several observations pertaining to the famous spectral graph parameter $\mu$ introduced in 1990 by Y. Colin de Verdi\`ere. This parameter is defined as the maximum corank among certain matrices akin to…
Tensegrity structures have been extensively studied over the last years due to their potential applications in modern engineering like metamaterials, deployable structures, planetary lander modules, etc. Many of the form-finding methods…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
The Colin de Verdi\`ere number $\mu(G)$ of a graph $G$ is the maximum corank of a Colin de Verdi\`ere matrix for $G$ (that is, of a Schr\"odinger operator on $G$ with a single negative eigenvalue). In 2001, Lov\'asz gave a construction that…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We construct infinite periodic versions of the stress matrix and establish sufficient conditions for periodic tensegrity frameworks to be globally rigid in $\mathbb{R}^d$ in the cases when the lattice is either fixed, fully flexible, or…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G…
We study the maximum number of edges in an $n$ vertex graph with Colin de Verdi\`{e}re parameter no more than $t$. We conjecture that for every integer $t$, if $G$ is a graph with at least $t$ vertices and Colin de Verdi\`{e}re parameter at…
This paper is concerned with the structure of the set of Riemannian metrics on a connected manifold such that the corresponding Laplace--Beltrami operator has an eigenvalue of a given multiplicity. The starting point of our investigation is…
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…
Recently, it has been proven that a tensegrity framework that arises from coning the one-skeleton of a convex polytope is rigid. Since such frameworks are not always infinitesimally rigid, this leaves open the question as to whether they…
The irregularity strength of a graph $G$, $s(G)$, is the least $k$ such that there exists a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ attributing distinct weighted degrees to all vertices, or equivalently the least $k$ enabling…
Two-dimensional string theory is known to contain the set of discrete states that are the SU(2) multiplets generated by the lowering operator of the SU(2) current algebra.Their structure constants are defined by the area preserving…
A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…
For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…