Related papers: Virtually abelian quotients of random groups

We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…

In this paper we study elimination of imaginaries in some classes of pure ordered abelian groups. For the class of ordered abelian groups with bounded regular rank (equivalently with finite spines) we obtain weak elimination of imaginaries…

The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable…

We show that countable non-abelian free groups admit uncountably many mutually singular elementwise conservative non-singular random subgroups, which are supported on infinite subgroups of infinite index and singular with respect to every…

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…

Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…

Using exceptional theta correspondences, we prove that certain Weil representations of $p$-adic groups are multiplicity free and determine irreducible quotients.

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…

In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds…

A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies…

The main result is a general approximation theorem for normalised Betti numbers for Farber sequences of lattices in totally disconnected groups. Further, we contribute some computations and complements to the general theory of $L^2$-Betti…

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 give a short proof of Chevalley's theorem that every algebraic group is an extension of an Abelian variety by a linear algebraic group. Along the way we treat Bertini's irreducibility theorem.

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Let $G$ be a higher rank semisimple linear algebraic group over a non-Archimedean local field. The simplicial complexes corresponding to any sequence of pairwise non-conjugate irreducible lattices in $G$ are Benjamini-Schramm convergent to…

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…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.