相关论文: Strong shortcuts, generating sets, and isometric c…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

We exhibit an infinite family of snowflake groups all of whose asymptotic cones are simply connected. Our groups have neither polynomial growth nor quadratic Dehn function, the two usual sources of this phenomenon. We further show that each…

We construct a group (an HNN extension of a free group) with polynomial isoperimetric function, linear isodiametric function and non-simply connected asymptotic cones.

We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…

Gromov asked whether an asymptotic cone of a finitely generated group was always simply connected or had uncountable fundamental group. We prove that Gromov's dichotomy holds for asympotic cones with cut points, as well as, HNN extensions…

In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities of sets relative to distributions on F that come naturally…

We define the strong shortcut property for rough geodesic metric spaces, generalizing the notion of strongly shortcut graphs. We show that the strong shortcut property is a rough similarity invariant. We give several new characterizations…

Let G be a connected semisimple Lie group with at least one absolutely simple factor S such that R-rank(S) is at least 2, and let $\Gamma$ be a uniform lattice in G. (a) If $CH$ holds, then $\Gamma$ has a unique asymptotic cone up to…

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

We show that for any metric space $M$ satisfying certain natural conditions, there is a finitely generated group $G$, an ultrafilter $\omega $, and an isometric embedding $\iota $ of $M$ to the asymptotic cone ${\rm Cone}_\omega (G)$ such…

If a class of finitely generated groups Curly(G) is closed under isometric amalgamations along free subgroups, then every G in Curly(G) can be quasi-isometrically embedded in a group Hat(G) in Curly(G) that has no proper subgroups of finite…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We introduce cone bilipschitz equivalences between metric spaces. These are maps, more general than quasi-isometries, that induce a bilipschitz homeomorphism between asymptotic cones. Non-trivial examples appear in the context of Lie…

Let G be a finitely presented group, and G' its commutator subgroup. Let C be the Cayley graph of G' with all commutators in G as generators. Then C is large scale simply connected. Furthermore, if G is a torsion-free nonelementary…

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…