Related papers: Compressed word problems in HNN-extensions and ama…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
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…
The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Sigma-2-complete under Turing reductions, but restricted versions are…
The Thompson group $V$, as well as the Brin-Thompson group $2V$, is finitely generated and can be defined as a monoid acting on bitstrings, respectively pairs of bitstrings. Therefore evaluation problems can be defined for $V$ and $2V$. We…
In this paper we study conditions under which, for an inclusion of finite von Neumann algebras $N \subseteq M$, we have the reduced amalgamated free product $\ast_N M$ is embeddable into $(R \bar{\otimes} N_1)^\omega$ for some other finite…
Different (fibrewise) amalgamated products of continuous C*-bundles have been studied over the last years, one of the main question being to know when these amalgamated products are continuous C*-bundles. In order to gather these approaches…
When two boundary-parabolic representations of knot groups are given, we introduce the connected sum of these representations and show several natural properties including the unique factorization property. Furthermore, the complex volume…
We show for bicommutative graded connected Hopf algebras that a certain distributive (Laplace) subgroup of the convolution monoid of 2-cochains parameterizes certain well behaved Hopf algebra deformations. Using the Laplace group, or its…
In this paper, a compressed membership problem for finite automata, both deterministic and non-deterministic, with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free…
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it…
For any positive integer $n$, $\mathcal{A}_n$ is the class of all groups $G$ such that, for $0\leq i\leq n$, $H^i(\hat{G},A)\cong H^i(G,A)$ for every finite discrete $\hat{G}$-module $A$. We describe certain types of free products with…
We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…
The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
We show, in particular, that, if a finite group $H$ is a retract of any finite group containing $H$ as a verbally closed subgroup, then the centre of $H$ is a direct factor of $H$.
In this paper we proved a pro-$\mathcal{C}$ version of the Rips-Sela Theorems on splittings as an amalgamated free product or HNN-extension over a cyclic subgroup, where $\mathcal{C}$ is a class of finite groups closed for subgroups,…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
In this paper we propose a generalization of the extension complexity of a polyhedron $Q$. On the one hand it is general enough so that all problems in $P$ can be formulated as linear programs with polynomial size extension complexity. On…
We show that free products of sofic groups with amalgamation over monotileably amenable subgroups are sofic. Consequently, so are HNN extensions of sofic groups relative to homomorphisms of monotileably amenable subgroups. We also show that…