Related papers: Equations in nilpotent groups

In this paper, we discuss about finite groups in which, CGH = NGH, for every abelian subgroup H of non prime power order. Also, we classify all such nilpotent and minimal non nilpotent groups.

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…

The semigroup of the homotopy classes of the self-homotopy maps of a finite complex which induce the trivial homomorphism on homotopy groups is nilpotent. We determine the nilpotency of these semigroups of compact Lie groups and finite Hopf…

For a group G and an element a in G let |a|_k denote the cardinality of the set of commutators [a,x_1,...,x_k], where x_1,...,x_k range over G. The main result of the paper states that a group G is finite-by-nilpotent if and only if there…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

In this note, we show that the satisfiability of equations and inequations with recognisable constraints is decidable in groups that are virtually direct products of finitely many hyperbolic groups.

We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

Let $\mathfrak{Nil}$ be the class of nilpotent groups. This article explores the finiteness of meta and para-$\mathfrak{Nil}$-Hamiltonian groups or their derived subgroups when these groups contain a soluble subgroup of finite index or a…

It is shown that the algebraic structure of finite Heisenberg groups associated with the tensor product of two Hilbert spaces leads to a simple demonstration valid in all Hilbert space dimensions of the impossibility of non-contextual…

Not any nonsingular equation over a metabelian group has solution in a larger metabelian group. However, any nonsingular equation over a solvable group with a subnormal series with abelian torsion-free quotients has a solution in a larger…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

We prove that the Heisenberg groups can be distinguished from the other connected and simply connected Lie groups via their group $C^*$-algebras. The main step of the proof is a characterization of the nilpotent Lie groups among the…

A subgroup of a finite group is wide if each prime divisor of the group order divides the subgroup order. We obtain the description of finite soluble groups with no wide subgroups. We also prove that a finite soluble group with nilpotent…

Let $\h_1$ be the one-dimensional Heisenberg group. In this paper, we consider some aspects of discrete dynamical systems on $\h_1$ and give a condition for the solution of a cohomological equations on the group.

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.