On strongly quasiconvex subgroups
نویسندگان
چکیده
منابع مشابه
Separation of Relatively Quasiconvex Subgroups
Suppose that all hyperbolic groups are residually finite. The following statements follow: In relatively hyperbolic groups with peripheral structures consisting of finitely generated nilpotent subgroups, quasiconvex subgroups are separable; Geometrically finite subgroups of non-uniform lattices in rank one symmetric spaces are separable; Kleinian groups are subgroup separable. We also show that...
متن کاملQuasiconvex Subgroups and Nets in Hyperbolic Groups
Consider a hyperbolic group G and a quasiconvex subgroup H ⊂ G with [G : H] = ∞. We construct a set-theoretic section s : G/H → G of the quotient map (of sets) G → G/H such that s(G/H) is a net in G; that is, any element of G is a bounded distance from s(G/H). This section arises naturally as a set of points minimizing word-length in each fixed coset gH. The left action of G on G/H induces an a...
متن کاملOn Products of Quasiconvex Subgroups in Hyperbolic Groups
An interesting question about quasiconvexity in a hyperbolic group concerns finding classes of quasiconvex subsets that are closed under finite intersections. A known example is the class of all quasiconvex subgroups [1]. However, not much is yet learned about the structure of arbitrary quasiconvex subsets. In this work we study the properties of products of quasiconvex subgroups; we show that ...
متن کاملCommensurability and separability of quasiconvex subgroups
We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building associated to a graph product of finite groups, a uniform lattice is commensurable with the graph product provided all of its quasiconvex subgroups are separable. W...
متن کاملA Strongly Quasiconvex PAC-Bayesian Bound
We propose a new PAC-Bayesian bound and a way of constructing a hypothesis space, so that the bound is convex in the posterior distribution and also convex in a trade-off parameter between empirical performance of the posterior distribution and its complexity. The complexity is measured by the Kullback-Leibler divergence to a prior. We derive an alternating procedure for minimizing the bound. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2019
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2019.23.1173