Related papers: Knapsack and the power word problem in solvable Ba…
Let $G$ be a non-trivial torsion free group and $s(t)=g_{1}t^{\epsilon_{1}}g_{2}t^{\epsilon_{2}} \cdots g_{n}t^{\epsilon_{n}}=1 \; (g_{i} \in G,\ \epsilon_i=\pm 1)$ be an equation over $G$ containing no blocks of the form…
The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…
Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
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…
We determine all generalized Baumslag-Solitar groups (finitely generated groups acting on a tree with all stabilizers infinite cyclic) which are quotients of a given Baumslag-Solitar group BS(m,n), and (when BS(m,n) is not Hopfian) which of…
We investigate the solution sets to equations in the solvable Baumslag-Solitar groups $BS(1,k)$, $k\geq2$, and show that these sets are represented by EDT0L languages in some cases. In particular, we prove that the multiplication table of…
We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…
Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…
All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…
We describe the algebraic ingredients of a proof of the conjecture of Frenkel and Ip that the category of positive representations $\mathcal{P}_\lambda$ of the quantum group $U_q(\mathfrak{sl}_{n+1})$ is closed under tensor products. Our…
The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial identity…
The Knapsack problem is one of the most fundamental NP-complete problems at the intersection of computer science, optimization, and operations research. A recent line of research worked towards understanding the complexity of…
In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…
Let $m$ and $k$ be integers such that $|m|, \, |k| >1$ and $\gcd (m,k)=1$. We show that all Baumslag-Solitar groups $BS(m,mk)$ are non-residually finite groups hyperbolic relative to residually finite subgroups. By a result of Osin (2007),…
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…
The class of generalized gamma convolutions (GGC) is closed with respect to (wrt) change of scales, weak limits and addition and multiplication of independent random variables. Our main result adds the new property that GGC is also closed…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…