Related papers: Non-unitarisable representations and random forest…

We prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated: We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated, and on the…

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

We construct the first example of a lattice on an irreducible Euclidean building that is not residually finite. Conjecturally, the normal subgroup theorem extends to this lattice making it virtually simple.

In \cite[Problem 72]{Fuchs60} Fuchs posed the problem of characterizing the groups which are the groups of units of commutative rings. In the following years, some partial answers have been given to this question in particular cases. In a…

We prove that if a group possesses a deficiency 1 presentation where one of the relators is a commutator then it is the integers times the integers, is large, or is as far as possible from being residually finite. Then we use this to show…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We prove an analogue of the Approximation Theorem of L^2-Betti numbers by Betti numbers for arbitrary coefficient fields and virtually torsionfree amenable groups. The limit of Betti numbers is identified as the dimension of some module…

We confirm the Jamneshan-Tao conjecture for finite abelian groups of rank at most a fixed integer $R$ (i.e. finite abelian groups generated by at most $R$ elements), by proving an inverse theorem for 1-bounded functions of non-trivial…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

We construct a continuum sized family $\{G_x\}_{x\in\{0,1\}^{\mathbb N}}$ of pairwise non-measure equivalent countable groups which have property (T) (hence are finitely generated), have zero $\ell^2$-Betti numbers of all orders, and are…

We establish three independent results on groups acting on trees. The first implies that a compactly generated locally compact group which acts continuously on a locally finite tree with nilpotent local action and no global fixed point is…

We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…

We study the computability degree of real numbers arising as $L^2$-Betti numbers or $L^2$-torsion of groups, parametrised over the Turing degree of the word problem.

Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first $\ell^2$-Betti number of the group. Our main aim, however, is…

It is shown that $2\beta_1(\G)\leq h(\G)$ for any countable group $\G$, where $\beta_1(\G)$ is the first $\ell^2$-Betti number and $h(\G)$ the uniform isoperimetric constant. In particular, a countable group with non-vanishing first…

This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…

We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…

We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…