群论

We propose the systematic study of presentations that can be generalised over a continuous open group monomorphism. Presentations with this property can turn well-known presentations such as those for as orientable surface groups, Artin…

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

By the classic results of Fricke and Klein, for every word $w$ in the free group $F(a,b)$ there exists a unique integer \it{trace polynomial} $f_w(x,y,z)\in Z[x,y,z]$ such that $Tr(w(A,B))=f_w(Tr A,Tr B,Tr AB)$. for all $A,B\in SL(2,C)$. We…

Let \(\nu_p(G)\) be the number of Sylow \(p\)-subgroups of a finite group \(G\), let \(\sigma_p(G)\) be their common order, and set \[ \gamma(G)=\int_0^1\sum_{p\in\pi(G)}\nu_p(G)x^{\sigma_p(G)}\,dx…

We study the interplay between the algebraic and dynamical properties of groups that admit a general type action on a $\delta$-hyperbolic space such that the induced action on the limit set of the Gromov boundary is faithful. We divide the…

Coset geometries are incidence geometries constructed from a group $G$ and a system of subgroups $(G_i)_{i \in I}$ of subgroups of $G$. For any algebraic group operation, it is then natural to wonder whether it can be extended to the…

A skew brace $A = (A,\cdot,\circ)$ is said to be \textit{left-simple} if $A\neq1$ and it has no left ideal other than $1$ and $A$. The purpose of this paper is to give a partial classification of the finite left-simple skew braces. A result…

It is shown that a probabilistic identity on a $\sigma$-compact $K$-analytic group $G$, $K$ a non-archimedean local field, is a coset identity. As an application, one concludes that compact $K$-analytic groups and various pro-$p$ groups…

In a former paper we introduced partial infinitary noncommutative semigroups and showed, among other, that significant differences arise in comparison with the commutative case, previously studied in the literature. For example, in the…

Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…

We consider a question of Edjvet and Vdovina concerning which groups defined by special presentations are large. For each integer $n \ge 3$, we construct an $n$-generator one-relator presentation whose star graph is the complete bipartite…

In this article, we show the surjectivity of word maps w from SU(2)* SU(2) to SU(2) induced by several families of words in the free group of rank 2. Also, we prove the surjectivity of certain word maps on SL(2,C).

The goal of this paper is to understand the set $\mathrm{End}(W)$ of endomorphisms of an irreducible spherical reflection group $W$. We do this in two ways: numerically, by deriving an explicit formula for $|\mathrm{End}(W)|$; and…

Let $M$ be a cancellative commutative monoid and call a submonoid $S$ of $M$ an undermonoid if $\G(S)=\G(M)$ inside the Grothendieck group of $M$. Gotti and Li asked whether the finite factorization property is hereditary once it is known…

In this paper, we investigate Polish semigroup topologies on the endomorphism monoids $\operatorname{End}(\mathbb{N},\leq)$ and $\operatorname{End}(\mathbb{Z},\leq)$. We introduce a new structural condition, property $\mathbb{XX}$, which…

The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…

There are 123,650 partial groups of order at most 9 and 178,937,003 partial groups of order 10. We explain a computer enumeration of these results and provide a complete list of indecomposable partial groups of order at most 5. We also…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

We prove that the Brin-Thompson group $nV$ is torsion locally finite for $ n \geq 1$ which is known only when $n = 1$, and $nV$ contains continuum many copies of the additive group of the rationals $\mathbb{Q}$ for $n \geq 2$ which is known…

An RGD system $\mathcal{D}$ is called \emph{linear w.r.t. a root basis $\mathcal{B}$} if the commutation relations between the root groups of $\mathcal{D}$ are `linear' in a certain sense. Moreover, $\mathcal{D}$ is called…