Related papers: Equations in nilpotent groups

We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…

In this paper we describe an algorithm for finding the nilpotency class, and the upper central series of the maximal normal p-subgroup N(G) of the automorphism group, Aut(G) of a bounded (or finite) abelian p-group G. This is the first part…

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

We study both the Submonoid Membership problem and the Rational Subset Membership problem in finitely generated nilpotent groups. We give two reductions with important applications. First, Submonoid Membership in any nilpotent group can be…

We show that inductive limits of virtually nilpotent groups have strongly quasidiagonal C*-algebras, extending results of the first author on solvable virtually nilpotent groups. We use this result to show that the decomposition rank of the…

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…

We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.

In this paper, we investigate nilpotent and unimodular solvable Lie groups that admit quasi-Einstein metrics $(M,g,X)$ with $X$ a left-invariant vector field, which we call totally left-invariant quasi-Einstein metrics. We give a complete…

We give a new, geometric proof of the section conjecture for fixed points of finite group actions on projective curves of positive genus defined over the field of complex numbers, as well as its natural nilpotent analogue. As a part of our…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

By a result of Horv\'ath the equation solvability problem over finite nilpotent groups and rings is in P. We generalize his result, showing that the equation solvability over every finite supernilpotent Mal'cev algebra is in P. We also give…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

In this paper, we investigate the compactness of nonnegative solutions to a critical sub-elliptic equation with a nonnegative potential on the Heisenberg group. We establish that the solution set is compact provided the potential satisfies…

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

We prove rationality of the quotient $\mathbb{C}^n / H_n$ for the finite Heisenberg group $H_n$, any $n \ge 1$, acting on $\mathbb{C}^n$ via its irreducible representation.

It is known that an abelian group $A$ and a $2$-cocycle $c:A \times A \to C$ yield a group ${\mathscr{H}}(A,C,c)$ which we call a Heisenberg group. This group, a central extension of $A$, is the archetype of a class~$2$ nilpotent group. In…

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…

It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…

In this paper, we prove a Liouville theorem for the $2$-Hessian equation on the Heisenberg group $\mathbb{H}^n$. The result is obtained by choosing a suitable test function and using integration by parts to derive the necessary integral…