English
Related papers

Related papers: Knapsack and the power word problem in solvable Ba…

200 papers

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

Geometric Topology · Mathematics 2019-07-01 Denis Fedoseev , Andrey Karpov , Vassily Manturov

We classify the finite-dimensional irreducible linear representations of the Baumslag-Solitar groups BS(p,q) = < a, b | a b^p = b^q a > for relatively prime p and q. The general strategy of the argument is to consider the matrix group given…

Group Theory · Mathematics 2012-09-19 Daniel McLaury

We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$…

Computational Complexity · Computer Science 2017-09-12 Alexei Miasnikov , Svetla Vassileva , Armin Weiß

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Discrete Mathematics · Computer Science 2018-02-27 Dominik Wojtczak

In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…

Group Theory · Mathematics 2023-05-02 Olga Kharlampovich , Laura Lopez , Alexei Miasnikov

The word problem for products of symmetric groups (WPPSG) is a well-known NP-complete problem. An input instance of this problem consists of ``specification sets'' $X_1,\ldots,X_m \seq \{1,\ldots,n\}$ and a permutation $\tau$ on…

Computational Complexity · Computer Science 2025-06-17 Hans U. Simon

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

Group Theory · Mathematics 2016-12-15 Thibault Godin

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…

Group Theory · Mathematics 2016-08-30 Andrei Bulatov , Marcin Kozik , Peter Mayr , Markus Steindl

We study the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, of weakly compressible monoids, as defined by Adian & Oganesian. We show that if $\mathcal{C}$ is a reversal-closed super-$\operatorname{AFL}$,…

Group Theory · Mathematics 2022-02-08 Carl-Fredrik Nyberg-Brodda

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…

Group Theory · Mathematics 2011-03-04 Oleg Bogopolski , Andreas Zastrow

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…

Group Theory · Mathematics 2008-03-12 Seymour Bachmuth

We show that Submonoid Membership is decidable in n-dimensional lamplighter groups $(\mathbb{Z}/p\mathbb{Z}) \wr \mathbb{Z}^n$ for any prime $p$ and integer $n$. More generally, we show decidability of Submonoid Membership in semidirect…

Group Theory · Mathematics 2025-05-29 Ruiwen Dong

We give a classification of irreducible metabelian representations from a knot group into SL(n,C) and GL(n,C). If the homology of the n-fold branched cover of the knot is finite, we show that every irreducible metabelian SL(n,C)…

Geometric Topology · Mathematics 2021-03-16 Hans U. Boden , Stefan Friedl

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

Group Theory · Mathematics 2022-07-14 Tobias Moede , Matthias Neumann-Brosig

Given a finite abelian group $G$ and $t\in \mathbb{N}$, there are two natural types of subsets of the Cartesian power $G^t$; namely, Cartesian powers $S^t$ where $S$ is a subset of $G$, and (cosets of) subgroups $H$ of $G^t$. A basic…

Group Theory · Mathematics 2025-07-01 Pim Spelier

In this paper we classify Baumslag-Solitar groups up to commensurability. In order to prove our main result we give a solution to the isomorphism problem for a subclass of Generalised Baumslag-Solitar groups.

Group Theory · Mathematics 2019-10-08 Montserrat Casals-Ruiz , Ilya Kazachkov , Alexander Zakharov

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…

Group Theory · Mathematics 2022-08-16 Carl-Fredrik Nyberg-Brodda

In this paper we describe some properties of groups $G$ that contain a solvable subgroup of finite prime-power index (Theorem 1 and Corollaries 2--3). We prove that if $G$ is a non-solvable group that contains a solvable subgroup of index…

Group Theory · Mathematics 2026-01-12 Raimundo Bastos , Csaba Schneider

In this article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…

Group Theory · Mathematics 2025-08-07 Oorna Mitra , Mallika Roy , Enric Ventura

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov