Related papers: Higher rank arithmetic groups which are not invari…

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

In this paper, we construct a family of reductive groups, including all reductive groups up to a given rank. We also construct a similar versal family of quasi-split reductive groups. This result generalizes a former result of N.Avni and…

The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed…

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…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Consider the kernel Mag_g of the Magnus representation of the Torelli group and the kernel Bur_n of the Burau representation of the braid group. We prove that for g >= 2 and for n >= 6 the groups Mag_g and Bur_n have infinite rank first…

A logarithm representation of operators is introduced as well as a concept of pre-infinitesimal generator. Generators of invertible evolution families are represented by the logarithm representation, and a set of operators represented by…

The main theorem of Galois theory states that there are no finite group-subgroup pairs with the same invariants. On the other hand, if we consider complex linear reductive groups instead of finite groups, the analogous statement is no…

We give here a simple proof of the centrality of the congruence subgroup kernel in the higher rank isotropic case.

Let R be any ring (with 1), \Gamma a group and R\Gamma the corresponding group ring. Let H be a subgroup of \Gamma of finite index. Let M be an R\Gamma -module, whose restriction to RH is projective. Moore's conjecture: Assume for every…

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

Let G be a finite group acting by automorphism on a lattice A, and hence on the group algebra S=k[A]. The algebra of G-invariants in S is called an algebra of multiplicative invariants. We investigate when algebras of multiplicative…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

Let $\Gamma < \mathrm{GL}_n(F)$ be a countable non-amenable linear group with a simple, center free Zariski closure, $\mathrm{Sub}(\Gamma)$ the space of all subgroups of $\Gamma$ with the, compact, metric, Chabauty topology. An invariant…

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

The Houghton groups $H_1, H_2, \ldots$ are a family of infinite groups. In 1975 Wiegold showed that $H_3$ was invariably generated (IG) but $H_1\le H_3$ was not. A natural question is then whether the groups $H_2, H_3, \ldots$ are all IG.…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

A group is surjunctive if every injective cellular automaton on it is also surjective. Gottschalk famously conjectured that all groups are surjunctive. This remains a central open problem in symbolic dynamics and descriptive set theory.…