Related papers: The complexity of knapsack problems in wreath prod…
We consider exponent equations in finitely generated groups. These are equations, where the variables appear as exponents of group elements and take values from the natural numbers. Solvability of such (systems of) equations has been…
We study relationship among versions of the Knapsack Problem where variables take values in Z and the number of them is fixed. In particular, we construct a finitely presented group where the problem of solvability of exponential equations…
Recently, Macdonald et. al. showed that many algorithmic problems for finitely generated nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of subgroup…
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range $R$, and these instances can be referred to as the unbounded knapsack problem with bounded…
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…
Given an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(\alpha(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to…
The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
Let $G = X \wr H$ be the wreath product of a nontrivial finite group $X$ with $k$ conjugacy classes and a transitive permutation group $H$ of degree $n$ acting on the set of $n$ direct factors of $X^n$. If $H$ is semiprimitive, then $k(G)…
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…
By a construction of Vaughan Jones, the bipartite graph $\Gamma(A)$ associated with the natural inclusion of $\mathbb C$ inside a finite-dimensional $C^*$-algebra $A$ gives rise to a planar algebra $\mathcal P^{\Gamma(A)}$. We prove that…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…
Let G be a finite group. A complete system of pairwise orthogonal idempotents is constructed for the wreath product of G by the symmetric group by means of a fusion procedure, that is by consecutive evaluations of a rational function with…
We introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting…
We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…
Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimization problems. It was shown recently that, over finite domains, every VCSP is in P or NP-complete, depending on the admitted cost functions.…
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…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…