English
Related papers

Related papers: Membership problems in nilpotent groups

200 papers

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Group Theory · Mathematics 2025-03-04 Alexander Buturlakin , Anton Klyachko , Denis Osin

We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent…

Discrete Mathematics · Computer Science 2018-05-10 Sang-Ki Ko , Reino Niskanen , Igor Potapov

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…

Group Theory · Mathematics 2009-12-07 Hung P. Tong-Viet

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii , M. V. Sapir

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

Group Theory · Mathematics 2021-01-19 João Araújo , Michael Kinyon , Janusz Konieczny , António Malheiro

In the spirit of an earlier result of M\"uller on the Heisenberg group we prove a restriction theorem on a certain class of two step nilpotent Lie groups. Our result extends that of M\"uller also in the framework of the Heisenberg group.

Functional Analysis · Mathematics 2023-02-14 Valentina Casarino , Paolo Ciatti

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

Group Theory · Mathematics 2007-05-23 Mark Kambites

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Group Theory · Mathematics 2024-02-29 Hung P. Tong-Viet

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

Discrete Mathematics · Computer Science 2023-09-21 Ruiwen Dong

We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…

Group Theory · Mathematics 2015-12-18 J. Almeida , J. C. Costa , M. Zeitoun

We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore,…

Group Theory · Mathematics 2007-05-23 Daniel Groves , Henry Wilton

Groups acting freely on Z^n-trees (Z^n-free groups) play a key role in the study of non-archimedean group actions. Following Stallings' ideas, we develop graph-theoretic techniques to investigate subgroup structure of Z^n-free groups. As an…

Group Theory · Mathematics 2021-07-14 Andrey Nikolaev , Denis Serbin

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

Computational Complexity · Computer Science 2023-08-22 V. Arvind , Samir Datta , Asif Khan , Shivdutt Sharma , Yadu Vasudev , Shankar Ram Vasudevan

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

Logic · Mathematics 2019-03-01 Cédric Milliet

It was shown by Lubotzky in 2014 that automorphism invariant subsets of finite simple groups which contain identity are always word images. In this article, we study word maps on finite nilpotent groups and show that for arbitrary finite…

Group Theory · Mathematics 2022-06-01 Dilpreet Kaur , Harish Kishnani , Amit Kulshrestha

Following J.S. Rose, a subgroup H of a group G is said contranormal in G if G = H^G . In a certain sense, contranormal subgroups are antipodes to subnormal subgroups. It is well known that a finite group is nilpotent if and only if it has…

Group Theory · Mathematics 2020-06-04 Leonid A. Kurdachenko , Patrizia Longobardi , Mercede MAJ

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Group Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Thomas W. Müller

We present a structural description of finite nilpotent groups of class at most $2$ using a specified number of subdirect and central products of $2$-generated such groups. As a corollary, we show that all of these groups are isomorphic to…

Group Theory · Mathematics 2025-04-08 Dávid R. Szabó

We consider groups $G$ such that the set $[G,\varphi]=\{g^{-1}g^{\varphi}|g\in G\}$ is a subgroup for every automorphism $\varphi$ of $G$, and we prove that there exists such a group $G$ that is finite and nilpotent of class $n$ for every…

Group Theory · Mathematics 2024-05-15 Chiara Nicotera

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov