ترغب بنشر مسار تعليمي؟ اضغط هنا

Problems on automorphism groups of nonpositively curved polyhedral complexes and their lattices

101   0   0.0 ( 0 )
 نشر من قبل Anne Thomas
 تاريخ النشر 2008
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

The goal of this paper is to present a number of problems about automorphism groups of nonpositively curved polyhedral complexes and their lattices, meant to highlight possible directions for future research.



قيم البحث

اقرأ أيضاً

65 - Olga Varghese 2019
We show that word hyperbolicity of automorphism groups of graph products $G_Gamma$ and of Coxeter groups $W_Gamma$ depends strongly on the shape of the defining graph $Gamma$. We also characterized those $Aut(G_Gamma)$ and $Aut(W_Gamma)$ in terms of $Gamma$ that are virtually free.
The superextension $lambda(X)$ of a set $X$ consists of all maximal linked families on $X$. Any associative binary operation $*: Xtimes X to X$ can be extended to an associative binary operation $*: lambda(X)timeslambda(X)tolambda(X)$. In the paper w e study isomorphisms of superextensions of groups and prove that two groups are isomorphic if and only if their superextensions are isomorphic. Also we describe the automorphism groups of superextensions of all groups of cardinality $leq 5$.
111 - Gareth A. Jones 2018
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where the autom orphism group of an object is the centraliser of its monodromy group. An alternative form of the theorem, valid for finite objects, is discussed, with counterexamples based on Baumslag--Solitar groups to show how it fails more generally. The automorphism groups of objects with primitive monodromy groups are described, as are those of non-connected objects.
We show that the automorphism group of a graph product of finite groups $Aut(G_Gamma)$ has Kazhdans property (T) if and only if $Gamma$ is a complete graph.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا