English
Related papers

Related papers: Membership problems in nilpotent groups

200 papers

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

Group Theory · Mathematics 2020-05-18 Rachel D. Camina , Ainhoa Iniguez , Anitha Thillaisundaram

It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…

Group Theory · Mathematics 2015-09-22 Markus Lohrey , Georg Zetzsche

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…

Group Theory · Mathematics 2018-02-23 V. S. Monakhov , I. L. Sokhor

We construct examples of two-step and three-step nilpotent Lie groups whose automorphism groups are `small' in the sense of either not having a dense orbit for the action on the Lie group, or being nilpotent (the latter being stronger).…

Dynamical Systems · Mathematics 2007-05-23 S. G. Dani

Radical subgroups play an important role in both finite group theory and representation theory. This is the first of a series of papers of ours in classifying radical $p$-subgroups of finite reductive groups and in verifying the inductive…

Representation Theory · Mathematics 2024-11-06 Zhicheng Feng , Jun Yu , Jiping Zhang

Exploring Bass' Triangulability Problem on unipotent algebraic subgroups of the affine Cremona groups, we prove a triangulability criterion, the existence of nontriangulable connected solvable affine algebraic subgroups of the Cremona…

Algebraic Geometry · Mathematics 2015-10-16 Vladimir L. Popov

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Group Theory · Mathematics 2007-05-23 Seymour Bachmuth

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

Group Theory · Mathematics 2015-03-09 Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. We provide a complete classification of a finite group $G$ in which every maximal $A$-invariant subgroup containing the normalizer of some $A$-invariant…

Group Theory · Mathematics 2024-08-05 Jiangtao Shi , Fanjie Xu

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Group Theory · Mathematics 2020-03-25 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

Logic · Mathematics 2024-03-28 Gianluca Paolini

Let $\mathcal{V}$ be a congruence permutable variety generated by a finite nilpotent algebra $\mathbf{A}$. If $\mathbf{A}$ is a product of algebras of prime power order, then the class $\mathcal{V}_\text{si}$ of subdirectly irreducible…

Logic · Mathematics 2023-09-01 Joshua Grice

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

Representation Theory · Mathematics 2024-12-30 Anatolii V. Tushev

We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…

Group Theory · Mathematics 2024-04-29 Robert D. Gray , Mark Kambites

A nilpotent quandle is a quandle whose inner automorphism group is nilpotent. Such quandles have been called reductive in previous works, but it turns out that their behaviour is in fact very close to nilpotency for groups. In particular,…

Geometric Topology · Mathematics 2022-07-19 Jacques Darné

This paper is about nilpotent orbits of reductive groups over local non-Archimedean fields. In this paper we will try to identify for which groups there are only finitely many nilpotent orbits, for which groups the nilpotent orbits are…

Representation Theory · Mathematics 2015-09-14 Julius Witte

We study groups, all maximal nilpotent subgroups of class at most $k$ in which are malnormal. We show that such groups share many similar properties with the ordinary CSA groups. Similarly, we introduce the class of {\em nilpotency…

Group Theory · Mathematics 2023-10-31 M. Shahryari

Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler , Bettina Eick

Given a graph $G = (V, E)$ and an integer $k$, the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$, $1 \leq |N[v] \cap S| \leq k$. The problem is known to be NP-complete even on…

Data Structures and Algorithms · Computer Science 2024-08-05 Sangam Balchandar Reddy , Anjeneya Swami Kare