Related papers: Rational cross-sections, bounded generation and or…

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…

The aim of this paper is to compare and contrast the class of residually finite groups with the class of equationally Noetherian groups - groups over which every system of coefficient-free equations is equivalent to a finite subsystem. It…

Let $S(\infty)$ denote the infinite symmetric group formed by the finitary permutations of the set of natural numbers; this is a countable group. We introduce its virtual group algebra, a completion of the conventional group algebra…

We classify all non-degenerate skew-hermitian forms defined over certain local rings, not necessarily commutative, and study some of the fundamental properties of the associated unitary groups, including their orders when the ring in…

We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…

A group $G$ is called hereditarily non-topologizable if, for every $H\le G$, no quotient of $H$ admits a non-discrete Hausdorff topology. We construct first examples of infinite hereditarily non-topologizable groups. This allows us to prove…

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

We classify $\mathcal{R}$- and $\mathcal{L}$-cross-sections of partial wreath product of inverse semigroups. As a corollary, we get the description of $\mathcal{R}$- and $\mathcal{L}$-cross-sections of the semigroupof partial automorphisms…

The classical result, due to Jordan, Burnside, Dickson, says that every normal subgroup of $GL(n, K)$ ($K$ - a field, $n \geq 3$) which is not contained in the center, contains $SL(n, K)$. A. Rosenberg gave description of normal subgroups…

We study a family of finitely generated residually finite groups. These groups are doubles $F_2*_H F_2$ of a rank-$2$ free group $F_2$ along an infinitely generated subgroup $H$. Varying $H$ yields uncountably many groups up to isomorphism.

We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…

We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…

Let k be a finite base field. In this note, making use of topological periodic cyclic homology and of the theory of noncommutative motives, we prove that the numerical Grothendieck group of every smooth proper dg k-linear category is a…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…