Related papers: On subset sum problem in branch groups

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously…

A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends…

Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$, the subgroup sum graph $\Gamma_{G,H}$ (resp. extended subgroup sum graph $\Gamma_{G,H}^+$) of $G$ with respect to $H$ is the graph with vertex set $G$, in which…

We study the Cantor--Bendixson rank of the space of subgroups for members of a general class of finitely generated self-replicating branch groups. In particular, we show for $G$ either the Grigorchuk group or the Gupta--Sidki $3$ group, the…

Let $k$ be a nonperfect separably closed field. Let $G$ be a (possibly non-connected) reductive group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In our previous work, we…

Let $Z$ be a closed subscheme of a smooth complex projective complete intersection variety $Y\subseteq \Ps^N$, with $dim Y=2r+1\geq 3$. We describe the N\'eron-Severi group $NS_r(X)$ of a general smooth hypersurface $X\subset Y$ of…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…

We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…

Let $G(V,E)$ be a simple, undirected and connected graph. A dominating set $S \subseteq V(G)$ is called a $2$-\textit{secure dominating set} ($2$-SDS) in $G$, if for every pair of distinct vertices $u_1,u_2 \in V(G)$ there exists a pair of…

Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when does a hard problem become easy? What is the minimum…

In this note, we lay the groundwork for a new approach to the problem of group-signature classification of group actions on closed Riemann surfaces. This new approach first focuses on analyzing the low level arithmetic conditions on…

We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.

In this paper we propose a conjecture concerning partial sums of an arbitrary finite subset of an abelian group, that naturally arises investigating simple Heffter systems. Then, we show its connection with related open problems and we…

Let $H$ be a subgroup of a finite group $G$. We say that $H$ satisfies partial $\Pi$-property in $G$ if there exists a chief series $\mathit{\Gamma}_G:1=G_0<G_1<\cdots<G_n=G$ of $G$ such that for every $G$-chief factor $G_i/G_{i-1}$ ($1\leq…