اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn trivial words in finitely presented groups
397
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to the set of such groups by finding the cogrowth series for Baumslag-Solitar groups $mathrm{BS}(N,N) = < a,b | a^N b = b a^N >$ and prove that their cogrowth rates are algebraic numbers.
قيم البحث
اقرأ أيضاً
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann distribution be
gin{align*}pi(w) &= (|w|+1)^{alpha} beta^{|w|} cdot Z^{-1} end{align*} where $|w|$ is the length of a word $w$, $alpha$ and $beta$ are parameters of the algorithm, and $Z$ is a normalising constant. It follows that words of the same length are sampled with the same probability. The distribution can be expressed in terms of the cogrowth series of the group, which then allows us to relate statistical properties of words sampled by the algorithm to the cogrowth of the group, and hence its amenability. We have implemented the algorithm and applied it to several group presentations including the Baumslag-Solitar groups, some free products studied by Kouksov, a finitely presented amenable group that is not subexponentially amenable (based on the basilica group), and Richard Thompsons group $F$.
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$ is amenable
, e.g. of intermediate growth, (iii) any finitely presented group $E$ with a quotient isomorphic to $G$ contains non-abelian free subgroups, or the stronger (iii) any finitely presented group with a quotient isomorphic to $G$ is large.
The isoperimeric spectrum consists of all real positive numbers $alpha$ such that $O(n^alpha)$ is the Dehn function of a finitely presented group. In this note we show how a recent result of Olshanskii completes the description of the isoperimetric s
pectrum modulo the celebrated Computer Science conjecture (and one of the seven Millennium Problems) $mathbf{P=NP}$ and even a formally weaker conjecture.
We exhibit explicit infinite families of finitely presented, Kazhdan, simple groups that are pairwise not measure equivalent. These groups are lattices acting on products of buildings. We obtain the result by studying vanishing and non-vanishing of their $L^2$-Betti numbers.
In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also show that
every wreath product of a free abelian group of finite rank with a finitely generated abelian group can be embedded into a metabelian group with exponential Dehn function.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
