Papers
Topics
Authors
Recent
Search
2000 character limit reached

Systems of equations over the group ring of Thompson's group FF

Published 7 Jan 2022 in math.GR | (2201.02308v1)

Abstract: Let R=K[G]R=K[G] be a group ring of a group GG over a field KK. It is known that if GG is amenable then RR satisfies the Ore condition: for any a,b∈Ra,b\in R there exist u,v∈Ru,v\in R such that au=bvau=bv, where u≠0u\ne0 or v≠0v\ne0. It is also true for amenable groups that a non-zero solution exists for any finite system of linear equations over RR, where the number of unknowns exceeds the number of equations. Recently Bartholdi proved the converse. As a consequence of this theorem, Kielak proved that R.\,Thompson's group FF is amenable if and only if it satisfies the Ore condition. The amenability problem for FF is a long-standing open question. In this paper we prove that some equations or their systems have non-zero solutions in the group rings of FF. We improve some results by Donnelly showing that there exist finite sets Y⊂FY\subset F with the property $|AY| < \frac43|Y|$, where A=x0,x1,x2A={x_0,x_1,x_2}. This implies some result on the systems of equations. We show that for any element bb in the group ring of FF, the equation (1−x0)u=bv(1-x_0)u=bv has a non-zero solution. The corresponding fact for 1−x11-x_1 instead of 1−x01-x_0 remains open. We deduce that for any m≥1m\ge1 the system (1−x0)u0=(1−x1)u1=⋯=(1−xm)um(1-x_0)u_0=(1-x_1)u_1=\cdots=(1-x_m)u_m has nonzero solutions in the group ring of FF. We also analyze the equation (1−x0)u=(1−x1)v(1-x_0)u=(1-x_1)v giving a precise explicit description of all its solutions in K[F]K[F]. This is important since to any group relation between x0x_0, x1x_1 in FF one can naturally assign such a solution. So this can help to estimate the number of relations of a given length between generators.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.