Related papers: Subset sum problem in polycyclic groups

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

If $G$ and $H$ are finitely generated residually nilpotent groups, then $G$ and $H$ are in the same nilpotent genus if they have the same lower central quotients (up to isomorphism). A stronger condition is that $H$ is para-$G$ if there…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

Let $H$ be a subgroup of a group $G$. The permutizer $P_G(H)$ is the subgroup generated by all cyclic subgroups of $G$ which permute with $H$. A subgroup $H$ of a group $G$ is strongly permutable in $G$ if $P_U(H)=U$ for every subgroup $U$…

We consider the problem of discovering subgroup $H$ of permutation group $S_{n}$. Unlike the traditional $H$-invariant networks wherein $H$ is assumed to be known, we present a method to discover the underlying subgroup, given that it…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…

Given $(a_1, \dots, a_n, t) \in \mathbb{Z}_{\geq 0}^{n + 1}$, the Subset Sum problem ($\mathsf{SSUM}$) is to decide whether there exists $S \subseteq [n]$ such that $\sum_{i \in S} a_i = t$. There is a close variant of the $\mathsf{SSUM}$,…

Consider a pseudogroup on (C,0) generated by two local diffeomorphisms having analytic conjugacy classes a priori fixed in Diff(C,0). We show that a generic pseudogroup as above is such that every point has (possibly trivial) cyclic…

Ulam asked whether every connected Lie group can be represented on a countable structure. This is known in the linear case. We establish it for the first family of non-linear groups, namely in the nilpotent case. Further context is…

For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations…

Let ${\cal N}_c$ be the variety of nilpotent groups of class at most $c\ \ (c\geq 2)$ and $G=Z_r\oplus Z_s $ be the direct sum of two finite cyclic groups. It is shown that if the greatest common divisor of $r$ and $s$ is not one, then $G$…

Given a probability measure on a finitely generated group, the local limit problem consists in finding asymptotics of $p_n(e,e)$, the probability that the random walk at time $n$ is at the origin. We give the classification of all possible…

The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…

This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well…

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

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…

In the paper autonilpotent groups were characterized as groups $G$ such that $\mathrm{Aut}G$ stabilizes some chain of subgroups of $G$. It was shown that a $p$-group is autonilpotent if and only if its group of automorphisms is also a…

It is proved that, if $(P_n)$ is a sequence of polynomials with complex coefficients having unbounded valences and tending to infinity at sufficiently many points, then there is an infinite dimensional closed subspace of entire functions,…