Related papers: Knapsack and subset sum problems in nilpotent, pol…

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.…

Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

Let $\H= < a,b | a[a,b]=[a,b]a \wedge b[a,b]=[a,b]b>$ be the discrete Heisenberg group, equipped with the left-invariant word metric $d_W(\cdot,\cdot)$ associated to the generating set ${a,b,a^{-1},b^{-1}}$. Letting $B_n= {x\in \H:…

We prove interior boundedness and H\"{o}lder continuity for the weak solutions of nonlocal double phase equations in the Heisenberg group $\mathbb{H}^n$. This solves a problem raised by Palatucci and Piccinini et. al. in 2022 and 2023 for…

In 2005, Borisov and Sapir proved that ascending HNN extensions of finitely generated linear groups are residually finite. Subsequently, Dru\c{t}u and Sapir noted the existence of finitely generated non-linear residually finite groups based…

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

The Liebeck-Nikolov-Shalev conjecture [LNS12] asserts that, for any finite simple non-abelian group $G$ and any set $A\subseteq G$ with $|A|\geq 2$, $G$ is the product of at most $N\frac{\log|G|}{\log|A|}$ conjugates of $A$, for some…

Relying on the techniques and ideas from our recent paper [13], we prove several anti-classification results for various rigidity conditions in countable abelian and nilpotent groups. We prove three main theorems: (1) the rigid abelian…

We compute the group homology, the topological K-theory of the reduced C^*-algebra, the algebraic K-theory and the algebraic L-theory of the group ring of the semi-direct product of the three-dimensional discrete Heisenberg group by Z/4.…

We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the virtually free groups, i.e. finite groups, and…

We show that every effectively closed action of a finitely generated group $G$ on a closed subset of $\{0,1\}^{\mathbb{N}}$ can be obtained as a topological factor of the $G$-subaction of a $(G \times H_1 \times H_2)$-subshift of finite…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Two non-discrete Hausdorff group topologies $\tau, \delta$ on a group $G$ are called {\it transversal} if the least upper bound $\tau\vee \delta$ of $\tau$ and $\delta$ is the discrete topology. In this paper, we discuss the existence of…

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

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 article we provide simple and provable bounds on the size and shape of the locus of discrete subgroups of $\mathsf{PSL}(2,\mathbb{C})\cong \operatorname{Isom}^+(\mathbb{H}^3)$ which split as a free product of cyclic groups…

Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…

The 0/1 knapsack problem is weakly NP-hard in that there exist pseudo-polynomial time algorithms based on dynamic programming that can solve it exactly. There are also the core branch and bound algorithms that can solve large randomly…