4,826 research outputs found
On the area of constrained polygonal linkages
We study configuration spaces of linkages whose underlying graph are polygons
with diagonal constrains, or more general, partial two-trees. We show that
(with an appropriate definition) the oriented area is a Bott-Morse function on
the configuration space. Its critical points are described and Bott-Morse
indices are computed. This paper is a generalization of analogous results for
polygonal linkages (obtained earlier by G. Khimshiashvili, G. Panina, and A.
Zhukova)
Characterizing the universal rigidity of generic frameworks
A framework is a graph and a map from its vertices to E^d (for some d). A
framework is universally rigid if any framework in any dimension with the same
graph and edge lengths is a Euclidean image of it. We show that a generic
universally rigid framework has a positive semi-definite stress matrix of
maximal rank. Connelly showed that the existence of such a positive
semi-definite stress matrix is sufficient for universal rigidity, so this
provides a characterization of universal rigidity for generic frameworks. We
also extend our argument to give a new result on the genericity of strict
complementarity in semidefinite programming.Comment: 18 pages, v2: updates throughout; v3: published versio
Network and Seiberg Duality
We define and study a new class of 4d N=1 superconformal quiver gauge
theories associated with a planar bipartite network. While UV description is
not unique due to Seiberg duality, we can classify the IR fixed points of the
theory by a permutation, or equivalently a cell of the totally non-negative
Grassmannian. The story is similar to a bipartite network on the torus
classified by a Newton polygon. We then generalize the network to a general
bordered Riemann surface and define IR SCFT from the geometric data of a
Riemann surface. We also comment on IR R-charges and superconformal indices of
our theories.Comment: 28 pages, 28 figures; v2: minor correction
- …