Related papers: Knapsack problems in products of groups
Groups preserving a distributive product are encountered often in algebra. Examples include automorphism groups of associative and nonassociative rings, classical groups, and automorphism groups of p-groups. While the great variety of such…
In ``A remark about the description of free products of groups'', Proc. Cambgridge Philos. Soc 62(1966), io ha studite lo que occurre in le circumstantia que un gruppo $G$ ha un subensemble $P$ tal que tote elemento de $G$ es representabile…
Given the Hilbert space compression of two groups, we find bounds on the Hilbert space compression of their free product. We also investigate the Hilbert space compression of an HNN-extension of a group relative to a finite normal subgroup…
In this note the usual Goursat lemma, which describes subgroups of the direct product of two groups, is generalized to describing subgroups of a direct product $A_1\times A_2 \times...\times A_n$ of a finite number of groups. Other possible…
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…
The problem of group extension can be divided into two sub-problems. The first is to find all the possible extensions of $H$ by $K$. The second is to find the different ways a group $G$ can arise as an extension of $H$ by $K$. Here we prove…
We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.
We give two slight generalizations of results of Poizat about elementary theories of groups obtained by free constructions. The first-one concerns the non-superstability of such groups in most cases, and the second-one concerns the…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to…
Several techniques together with some partial answers are given to the questions of factoriality, type classification and fullness for amalgamated free product von Neumann algebras.
In [BB] Benjamin Baumslag proved that being fully residually free is equivalent to being residually free and commutative transitive (CT). Gaglione and Spellman [GS] and Remeslennikov [Re] showed that this is also equivalent to being…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
Root-class residuality of free product of root-class residual groups is demonstrated. A sufficient condition for root-class residuality of generalized free product $G$ of groups $A$ and $B$ amalgamating subgroups $H$ and $K$ through the…
Simplicity is held by many to be the key to general intelligence. Simpler models tend to "generalise", identifying the cause or generator of data with greater sample efficiency. The implications of the correlation between simplicity and…
The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence. Against this background, we study the expressive power of neural networks through…
Categorical constructions on heaps and modules over trusses are considered and contrasted with the corresponding constructions on groups and rings. These include explicit description of free heaps and free Abelian heaps, coproducts or…
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
We prove that the free product of two finitely presented locally tame groups is locally tame and describe many examples of tame subgroups of finitely presented groups. We also include some open problems related to tame subgroups.