Related papers: Affine Rigidity and Conics at Infinity
It is shown that any smooth strictly convex global solution of $$\det(\frac{\partial^{2}u}{\partial \xi_{i}\partial \xi_{j}}) = \exp \left\{-\sum_{i=1}^n d_i \frac{\partial u}{\partial \xi_{i}} - d_0\right\},$$ where $d_0$, $d_1$,...,$d_n$…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
We consider a class of foliations on the complex projective plane that are determined by a quadratic vector field in a fixed affine neighborhood. Such foliations, as a rule, have an invariant line at infinity. Two foliations with…
We study pairs $(f, \Gamma)$ consisting of a non-Archimedean rational function $f$ and a finite set of vertices $\Gamma$ in the Berkovich projective line, under a certain stability hypothesis. We prove that stability can always be attained…
Consider a closed connected hypersurface in $\mathbb{R}^n$ with constant signature (k,l) of the second quadratic form, and approaching a quadratic cone at infinity. This hypersurface divides $\mathbb{R}^n$ into two pieces. We prove that one…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine invariant arclength for surfaces in R^3 in order to extend the set of existing…
A configuration p in r-dimensional Euclidean space is a finite collection of points (p^1,...,p^n) that affinely span R^r. A bar framework, denoted by G(p), in R^r is a simple graph G on n vertices together with a configuration p in R^r. A…
A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…
We show rigidity results for the operator equations T(f.g) = Tf.Tg, T(f*g) = Tf.Tg and T(f.g) = Tf*Tg for bijective operators T acting on sufficently large spaces of smooth functions. Typically a condition like |T(f.g) - Tf.Tg| < a for all…
Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
We prove that a closed convex subset of a Banach space is (super-)weakly compact if and only if it is (super)-ergodic. As a consequence we deduce that super weakly compact sets are characterized by the fixed point property for continuous…
Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite…