English
Related papers

Related papers: Equations in nilpotent groups

200 papers

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

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

A composite quantum system comprising a finite number k of subsystems which are described with position and momentum variables in Z_{n_{i}}, i=1,...,k, is considered. Its Hilbert space is given by a k-fold tensor product of Hilbert spaces…

Mathematical Physics · Physics 2012-10-24 M. Korbelar , J. Tolar

For a finite group $G$ and an element $x\in G$, the subset $$ nil_G(x)=\{y\in G \mid <x,y>~~ is ~~ nilpotent\}$$ is called nilpotentizer of $x$ in $G$. In this paper, we give two solvabilty criteria for a finite group by the structure and…

Group Theory · Mathematics 2024-02-27 N. Ahmadkhah , M. Zarrin

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…

Group Theory · Mathematics 2024-05-29 Doron Shafrir

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

Group Theory · Mathematics 2019-06-07 Vincent Guirardel , Gilbert Levitt

In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…

Group Theory · Mathematics 2008-02-03 Olga Kharlampovich , Alexey Myasnikov

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

Group Theory · Mathematics 2020-12-21 A. Yu. Olshanskii , M. V. Sapir

We prove that one variable equations in the lamplighter group $\MZ_2\wr \MZ$ are decidable and describe an algorithm for solving such equations. The algorithm has super-exponential time complexity in the worst case. We also show that, for…

Group Theory · Mathematics 2025-12-01 Alexander Ushakov , Yankun Wang

Hans Zassenhaus conjectured that every torsion unit of the integral group ring of a finite group $G$ is conjugate within the rational group algebra to an element of the form $\pm g$ with $g\in G$. This conjecture has been disproved recently…

Group Theory · Mathematics 2019-02-19 Mauricio Caicedo , Ángel del Río

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

Group Theory · Mathematics 2009-03-19 Francois Dahmani , Daniel Groves

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

General Mathematics · Mathematics 2024-08-23 Petar P. Petrov

The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…

Quantum Physics · Physics 2023-05-05 Hefeng Wang

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

Group Theory · Mathematics 2007-05-23 Kevin Wortman

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.

Quantum Physics · Physics 2023-11-27 Martin Roetteler , Thomas Beth

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

Group Theory · Mathematics 2026-01-01 Omar Hatem , Daoud Siniora

In this short note, we provide an inequality that holds in any finite group, only involving the orders of the elements; we prove that equality holds if and only if the group is nilpotent.

Group Theory · Mathematics 2012-12-04 Tom De Medts , Marius Tărnăuceanu

We generalize a result of Tao which extends Freiman's theorem to the Heisenberg group. We extend it to simply connected nilpotent Lie groups of arbitrary step.

Combinatorics · Mathematics 2009-01-13 David Fisher , Nets Hawk Katz , Irine Peng

We show that for every finitely presented pro-$p$ nilpotent-by-abelian-by-finite group $G$ there is an upper bound on $\dim_{\mathbb{Q}_p} (H_1(M, \mathbb{Z}_p) \otimes_{\mathbb{Z}_p} \mathbb{Q}_p )$, as $M$ runs through all pro-$p$…

Group Theory · Mathematics 2016-04-14 Martin R Bridson , Dessislava H. Kochloukova