Related papers: Knapsack problem for nilpotent groups

We compute the characteristic varieties and the Alexander polynomial of a finitely generated nilpotent group. We show that the first characteristic variety may be used to detect nilpotence. We use the Alexander polynomial to deduce that the…

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of $G$. We prove that if $G$ is a $p$-group of order $p^n$ and nilpotence class $l$, then $\eta (G)$ is bounded below by a linear function in…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Let G be a finite group, p a fixed prime and P a Sylow p-subgroup of G. In this short note we prove that if p is odd, G is p-nilpotent if and only if P controls fusion of cyclic groups of order p. For the case p=2, we show that G is…

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

We compute the algebraic Picard group of the category of $K(n)$-local spectra, for all heights $n$ and all primes $p$. In particular, we show that it is always finitely generated over $\mathbb{Z}_p$ and, whenever $n \geq 2$, is of rank $2$,…

We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into classes of colors and the packed items need to be ordered such…

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 show that every product of f.g.\ submonoids of a group $G$ is a section of a f.g.\ submonoid of $G{\times}H_5(\mathbb{Z})$, where $H_5(\mathbb{Z})$ is a Heisenberg group. This gives us a converse of a reduction of Bodart, and a new…

Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…

In this note we study packing or covering integer programs with at most k constraints, which are also known as k-dimensional knapsack problems. For any integer k > 0 and real epsilon > 0, we observe there is a polynomial-sized LP for the…

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

Knapsack problem (KP) is a representative combinatorial optimization problem that aims to maximize the total profit by selecting a subset of items under given constraints on the total weights. In this study, we analyze a generalized version…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

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…