Related papers: Rigidity property of diagram groups

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

The main result of this paper is a convexity theorem for momentum mappings of certain hamiltonian actions of noncompact semisimple Lie groups. The image is required to fall within a certain open subset D of the (dual of the) Lie algebra,…

Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

This article continues the study of diagrams in the bicategory of \'etale groupoid correspondences. We prove that any such diagram has a groupoid model and that the groupoid model is a locally compact \'etale groupoid if the diagram is…

We study the interaction between the group law on an abelian variety and the additive structure induced on its image under a morphism to projective space. Let $A/F$ be a simple abelian variety, $f:A \rightarrow \mathbb{P}^n$ be a morphism…

In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…

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…

A subcomplex $X\leq \mathcal{C}$ of a simplicial complex is strongly rigid if every locally injective, simplicial map $X\to\mathcal{C}$ is the restriction of a unique automorphism of $\mathcal{C}$. Aramayona and the second author proved…

A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on…

We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of…

There is a map, defined and studied by Jones, from Thompson's group $F$ to knots. Jones proved that every knot is in the image of this map -- that is, that every knot can be seen as the "knot closure" of a Thompson group element. We…

Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

The article establishes a long list of rigidity properties of lattices in G = SO(n,1) with n>=3 and G = SU(n,1) with n>=2 that are analogous to superrigidity of lattices in higher-rank Lie groups. The arguments are set in the context of…

Let $D$ be a strongly connected digraph. An arc set $S$ of $D$ is a \emph{restricted arc-cut} of $D$ if $D-S$ has a non-trivial strong component $D_{1}$ such that $D-V(D_{1})$ contains an arc. The \emph{restricted arc-connectivity}…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…