5,963 research outputs found
On the Number of Embeddings of Minimally Rigid Graphs
Rigid frameworks in some Euclidian space are embedded graphs having a unique
local realization (up to Euclidian motions) for the given edge lengths,
although globally they may have several. We study the number of distinct planar
embeddings of minimally rigid graphs with vertices. We show that, modulo
planar rigid motions, this number is at most . We also exhibit several families which realize lower bounds of the order
of , and .
For the upper bound we use techniques from complex algebraic geometry, based
on the (projective) Cayley-Menger variety over the complex numbers . In this context, point configurations
are represented by coordinates given by squared distances between all pairs of
points. Sectioning the variety with hyperplanes yields at most
zero-dimensional components, and one finds this degree to be
. The lower bounds are related to inductive
constructions of minimally rigid graphs via Henneberg sequences.
The same approach works in higher dimensions. In particular we show that it
leads to an upper bound of for the number of spatial embeddings
with generic edge lengths of the 1-skeleton of a simplicial polyhedron, up to
rigid motions
Symplectic fillings of Seifert fibered spaces
We give finiteness results and some classifications up to diffeomorphism of
minimal strong symplectic fillings of Seifert fibered spaces over S^2
satisfying certain conditions, with a fixed natural contact structure. In some
cases we can prove that all symplectic fillings are obtained by rational
blow-downs of a plumbing of spheres. In other cases, we produce new manifolds
with convex symplectic boundary, thus yielding new cut-and-paste operations on
symplectic manifolds containing certain configurations of symplectic spheres.Comment: 39 pages, 21 figures, v2 a few minor corrections and citations, v3
added clarifications in the proof of Lemma 2.8, plus some minor change
A theorem of Hrushovski-Solecki-Vershik applied to uniform and coarse embeddings of the Urysohn metric space
A theorem proved by Hrushovski for graphs and extended by Solecki and Vershik
(independently from each other) to metric spaces leads to a stronger version of
ultrahomogeneity of the infinite random graph , the universal Urysohn metric
space \Ur, and other related objects. We show how the result can be used to
average out uniform and coarse embeddings of \Ur (and its various
counterparts) into normed spaces. Sometimes this leads to new embeddings of the
same kind that are metric transforms and besides extend to affine
representations of various isometry groups. As an application of this
technique, we show that \Ur admits neither a uniform nor a coarse embedding
into a uniformly convex Banach space.Comment: 23 pages, LaTeX 2e with Elsevier macros, a significant revision
taking into account anonymous referee's comments, with the proof of the main
result simplified and another long proof moved to the appendi
- β¦