Related papers: Knapsack problem for nilpotent groups
We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…
It is proved that for any prime $p$ a finitely generated nilpotent group is conjugacy separable in the class of finite $p$-groups if and only if the torsion subgroup of it is a finite $p$-group and the quotient group by the torsion subgroup…
In this paper we extend the algorithm for extraspecial groups in \cite{iss07}, and show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure. The…
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…
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…
In this manuscript, a solution to Problem 18.91(b) in the Kourovka Notebook is given by proving the following theorem. Let $P$ be a Sylow $p$-subgroup of a group $G$ with $|P| = p^n$. Suppose that there is an integer $k$ such that $1 < k <…
We give an algorithm that decides whether a single equation in a group that is virtually a class $2$ nilpotent group with a virtually cyclic commutator subgroup, such as the Heisenberg group, admits a solution. This generalises the work of…
We prove the solvability and nilpotency of Kac--Paljutkin's finite quantum group and Sekine quantum groups and we classify the solvable series of Kac--Paljutkin's finite quantum group via Cohen--Westreich's Burnside theorem. Some semisimple…
We show that the subset sum problem, the knapsack problem and the rational subset membership problem for permutation groups are NP-complete. Concerning the knapsack problem we obtain NP-completeness for every fixed $n \geq 3$, where $n$ is…
We first show that every group-theoretical category is graded by a certain double coset ring. As a consequence, we obtain a necessary and sufficient condition for a group-theoretical category to be nilpotent. We then give an explicit…
0-1 Knapsack is a fundamental NP-complete problem. In this article we prove that it remains NP-complete even when the weights of the objects in the packing constraints and their values in the objective function satisfy specific stringent…
In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…
A group is called capable if it is a central factor group. We consider the capability of certain nilpotent products of cyclic groups, and obtain a generalisation of a theorem of Baer for the small class case. The approach may also be used…
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
We introduce a special class of powerful $p$-groups that we call powerfully nilpotent groups that are finite $p$-groups that possess a central series of a special kind. To these we can attach the notion of a powerful nilpotence class that…
A group is called capable if it is a central factor group. We consider the capability of nilpotent products of cyclic groups, and obtain a generalization of a theorem of Baer for the metabelian small class case. The approach is also used to…
We prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated: We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated, and on the…
Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.
A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…