Related papers: Rigidity property of diagram groups

For a non-compact n-manifold M let H(M) denote the group of homeomorphisms of M endowed with the Whitney topology and H_c(M) the subgroup of H(M) consisting of homeomorphisms with compact support. It is shown that the group H_c(M) is…

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an induced subgraph $H$ of a graph $G$ is $f$-heavy if for…

We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

Let A be a $\mathfrak Q$-domain, K=frac(A), B=A^{[n]} and D\in \lnd_A(B). Assume rank D= rank D_K=r, where D_K is the extension of D to K^{[n]}. Then we show that (i) If D_K is rigid, then D is rigid. (ii) Assume n=3, r=2 and B=A[X,Y,Z]…

We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

In this paper we define a relative rigid fundamental group, which associates to a section $p$ of a smooth and proper morphism $f:X\rightarrow S$ in characteristic $p$, a Hopf algebra in the ind-category of overconvergent $F$-isocrystals on…

Consider a countable group Gamma acting ergodically by measure preserving transformations on a probability space (X,mu), and let R_Gamma be the corresponding orbit equivalence relation on X. The following rigidity phenomenon is shown: there…

We show that the mapping class group of a compact orientable surface with higher complexity has the following extreme rigidity in the sense of measure equivalence: if the mapping class group is measure equivalent to a discrete group, then…

We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

Generalizing Chv\'atal's classic 1972 result, Ho\`ang proposed in 1995 the following conjecture, which strengthens Chv\'atal's result in terms of toughness: Let $t\ge 1$ be a positive integer and $G$ be a $t$-tough graph on $n \ge 3$…

A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…

Let $V$ be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. A classical conjecture predicts that $V^{\reg}$ is a…

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

A \emph{generalized dunce hat} is a 2-dimensional polyhedron created by attaching the boundary of a disk $\Delta$ to a circle $J$ via a map $f:\partial \Delta \to J$ with the property that there is a point $v \in J$ such that…

Let $M$ be a model set meeting two simple conditions: (1) the internal space $H$ is a product of $R^n$ and a finite group, and (2) the window $W$ is a finite union of disjoint polyhedra. Then any point pattern with finite local complexity…

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…