English
Related papers

Related papers: Powerfully solvable and powerfully simple groups

200 papers

We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.

Group Theory · Mathematics 2024-07-26 Cai Heng Li , Lei Wang , Binzhou Xia

In this note we show that for any powerful $p$-group $G$, the subgroup $\Omega_{i}(G^{p^{j}})$ is powerfully nilpotent for all $i,j\geq1$ when $p$ is an odd prime, and $i\geq1$, $j\geq2$ when $p=2$. We provide an example to show why this…

Group Theory · Mathematics 2019-07-24 James Williams

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Group Theory · Mathematics 2020-11-17 Timothy C. Burness , Cai Heng Li

The classification of finite simple strongly real groups is complete. It is easy to see that strong reality for every nonabelian finite simple group is equivalent to the fact that each element can be written as a product of two involutions.…

Group Theory · Mathematics 2010-09-07 E. P. Vdovin , A. A. Gal't

We show that for every positive integer $n$ there exists a simple group that is of type $\mathrm{F}_{n-1}$ but not of type $\mathrm{F}_n$. For $n\ge 3$ these groups are the first known examples of this kind. They also provide infinitely…

Group Theory · Mathematics 2018-10-23 Rachel Skipper , Stefan Witzel , Matthew C. B. Zaremsky

We show that various properties of unipotent elements in a reductive group over the complex numbers can be recovered purely in terms of the affine Weyl group of the dual group.

Representation Theory · Mathematics 2020-10-06 G. Lusztig

We first show that every group-theoretical category is graded by a certain double coset ring. As a consequence, we obtain a necessary and sufficient condition for a group-theoretical category to be nilpotent. We then give an explicit…

Quantum Algebra · Mathematics 2010-01-08 Shlomo Gelaki , Deepak Naidu

Let $G$ be a polycyclic, metabelian or soluble of type (FP)$_{\infty}$ group such that the class $Rat(G)$ of all rational subsets of $G$ is a boolean algebra. Then $G$ is virtually abelian. Every soluble biautomatic group is virtually…

Group Theory · Mathematics 2020-10-19 Vitaly Roman'kov

We show that first-order formulae are concise in acylindrically hyperbolic groups and certain extensions thereof. We study further classes of groups, including Burnside groups, icc groups, groups with the `Big Powers' condition, torus knot…

Group Theory · Mathematics 2026-05-08 Laura Ciobanu , Martina Conte

Recently, the authors gave some conditions under which a direct product of finitely many groups is $\mathcal{V}-$capable if and only if each of its factors is $\mathcal{V}-$capable for some varieties $\mathcal{V}$. In this paper, we extend…

Group Theory · Mathematics 2017-02-23 Hanieh Mirebrahimi , Behrooz Mashayekhy

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Group Theory · Mathematics 2010-12-09 A. Myasnikov , D. Osin

A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…

Group Theory · Mathematics 2016-07-05 Satvik Goswami , Ashish Gupta

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…

Group Theory · Mathematics 2022-07-14 Tobias Moede , Matthias Neumann-Brosig

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Computational Complexity · Computer Science 2020-10-23 Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski , Armin Weiß

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every algebraic isomorphism from the $S$-ring in question to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial…

Group Theory · Mathematics 2019-12-17 Grigory Ryabov

We give a characterization of connected solvable groups in terms of the existence of representations with certain geometric properties. The existence of such representations for the group of upper triangular matrices played an important…

Algebraic Geometry · Mathematics 2016-09-07 Dan Edidin , William Graham

Strongly dependent ordered abelian groups have finite dp-rank. They are precisely those groups with finite spines and $|\{p\text{ prime}:[G:pG]=\infty\}|<\infty$. We apply this to show that if $K$ is a strongly dependent field, then $(K,v)$…

Logic · Mathematics 2024-04-09 Yatir Halevi , Assaf Hasson

We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…

Group Theory · Mathematics 2009-01-19 Arturo Magidin

We prove that non-abelian definable, definably simple groups in 1-h-minimal henselian valued fields are essentially already linear algebraic groups. Here, the group is assumed to live in the home sort. We have a similar result in pure…

Logic · Mathematics 2026-01-14 Jakub Gismatullin , Immanuel Halupczok , Dugald Macpherson

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Group Theory · Mathematics 2018-10-02 Jonas Deré , Mark Pengitore