اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSystolic complexes and group presentations
51
0
0.0
(
0
)
تأليف
Mireille Soergel
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give conditions on a presentation of a group, which imply that its Cayley complex is simplicial and the flag complex of the Cayley complex is systolic. We then apply this to Garside groups and Artin groups. We give a classification of the Garside groups whose presentation using the simple elements as generators satisfy our conditions. We then also give a dual presentation for Artin groups and identify in which cases the flag complex of the Cayley complex is systolic.
قيم البحث
اقرأ أيضاً
We introduce a new method for computing the word length of an element of Thompsons group F with respect to a consecutive generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F. We use this me
thod to show that (F,X_n) is not almost convex, and has pockets of increasing, though bounded, depth dependent on n.
This is a survey of results on random group presentations, and on random subgroups of certain fixed groups. Being a survey, this paper does not contain new results, but it offers a synthetic view of a part of this very active field of research.
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these representation
s: here we assume that they are represented by tuples of reduced words (generators of a subgroup) or of cyclically reduced words (relators). Classical models consider fixed size tuples of words (e.g. the few-generator model) or exponential size tuples (e.g. Gromovs density model), and they usually consider that equal length words are equally likely. We generalize both the few-generator and the density models with probabilistic schemes that also allow variability in the size of tuples and non-uniform distributions on words of a given length.Our first results rely on a relatively mild prefix-heaviness hypothesis on the distributions, which states essentially that the probability of a word decreases exponentially fast as its length grows. Under this hypothesis, we generalize several classical results: exponentially generically a randomly chosen tuple is a basis of the subgroup it generates, this subgroup is malnormal and the tuple satisfies a small cancellation property, even for exponential size tuples. In the special case of the uniform distribution on words of a given length, we give a phase transition theorem for the central tree property, a combinatorial property closely linked to the fact that a tuple freely generates a subgroup. We then further refine our results when the distribution is specified by a Markovian scheme, and in particular we give a phase transition theorem which generalizes the classical results on the densities up to which a tuple of cyclically reduced words chosen uniformly at random exponentially generically satisfies a small cancellation property, and beyond which it presents a trivial group.
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set in any copy
of the group, our presentations can be used to verify claimed isomorphisms between representations of the classical group. The presentations are available in Magma.
We develop a theory of equivariant group presentations and relate them to the second homology group of a group. Our main application says that the second homology group of the Torelli subgroup of the mapping class group is finitely generated as an $Sp(2g,mathbb{Z})$-module.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
