اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPresentations on standard generators for classical groups
105
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
Here we provide three new presentations of Coxeter groups type $A$, $B$, and $D$ using prefix reversals (pancake flips) as generators. We prove these presentations are of their respective groups by using Tietze transformations on the presentations to
recover the well known presentations with generators that are adjacent transpositions.
We show that the algebraic fundamental group of a smooth projective curve over a finite field admits a finite topological presentation where the number of relations does not exceed the number of generators.
For each natural number $d$ we construct a $3$-generated group $H_d$, which is a subdirect product of free groups, such that the cohomological dimension of $H_d$ is $d$. Given a group $F$ and a normal subgroup $N lhd F$ we prove that any right angled
Artin group containing the special HNN-extension of $F$ with respect to $N$ must also contain $F/N$. We apply this to construct, for every $d in mathbb{N}$, a $4$-generated group $G_d$, embeddable into a right angled Artin group, such that the cohomological dimension of $G_d$ is $2$ but the cohomological dimension of any right angled Artin group, containing $G_d$, is at least $d$. These examples are used to show the non-existence of certain universal right angled Artin groups. We also investigate finitely presented subgroups of direct products of limit groups. In particular we show that for every $nin mathbb{N}$ there exists $delta(n) in mathbb{N}$ such that any $n$-generated finitely presented subgroup of a direct product of finitely many free groups embeds into the $delta(n)$-th direct power of the free group of rank $2$. As another corollary we derive that any $n$-generated finitely presented residually free group embeds into the direct product of at most $delta(n)$ limit groups.
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 finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the classificati
on of the maximal factorisations of almost simple groups. As a first application of these results we classify all point-transitive subgroups of automorphisms of finite thick generalised quadrangles.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
