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

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

We prove that metabelian Baumslag$-$Solitar group $BS(1,k)$, $k>1$, is (strongly) regularly bi-interpretable with the ring of integers $\mathbb{Z}$, and describe in algebraic terms all groups that are elementarily equivalent to $BS(1,k)$.

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…

A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this…

We provide a new computation of the K-theory of the group $C^*$-algebra of the solvable Baumslag-Solitar group $BS(1,n)\;(n\neq 1)$; our computation is based on the Pimsner-Voiculescu 6-terms exact sequence, by viewing $BS(1,n)$ as a…

A finitely generated group $G$ acting on a tree with infinite cyclic edge and vertex stabilizers is called a generalized Baumslag--Solitar group ($GBS$ group). We prove that a 1-knot group $G$ is $GBS$ group iff $G$ is a torus-knot group…

In this note we characterise all finitely generated groups elementarily equivalent to a solvable Baumslag-Solitar group BS$(1,n)$. It turns out that a finitely generated group $G$ is elementarily equivalent to BS$(1,n)$ if and only if $G$…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

We prove that for any natural n>1, the abstract commensurator group of the Baumslag - Solitar group BS(1,n) is isomorphic to the group of 2 by 2 upper triangular matrices A over rational numbers with A_{11}=1. We also prove that for any…

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…

We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…

The solvable Baumslag Solitar groups $\text{BS}(1,n)$ each admit a canonical model space, $X_n$. We give a complete classification of lattices in $G_n = \text{Isom}^+(X_n)$ and find that such lattices fail to be strongly…

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…

Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant…