English
Related papers

Related papers: Constructing arithmetic subgroups of unipotent gro…

200 papers

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

Group Theory · Mathematics 2023-06-14 Andrea Lucchini , Dhara Thakkar

We say that a subgroup $H$ is isolated in a group $G$ if for every $x\in G$ we have either $x\in H$ or $\langle x\rangle\cap H=1$. In this short note, we describe the set of isolated subgroups of a finite abelian group. The technique used…

Group Theory · Mathematics 2021-02-10 Marius Tărnăuceanu

Given a connected linear algebraic group $G$, we descrive the subgroup of $G$ generated by all semisimple elements.

Group Theory · Mathematics 2024-12-17 Ivan Arzhantsev

This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.

Group Theory · Mathematics 2019-04-03 John L. Rhodes , Benjamin Steinberg , J. C. Birget

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

Representation Theory · Mathematics 2017-03-06 Stan Onypchuk

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Group Theory · Mathematics 2011-05-31 Valery Bardakov , Vladimir Tolstykh , Vladimir Vershinin

A subgroup H of a group G is called inert if for each $g\in G$ the index of $H\cap H^g$ in $H$ is finite. We give a classification of soluble-by-finite groups $G$ in which subnormal subgroups are inert in the cases where $G$ has no…

Group Theory · Mathematics 2015-04-10 Ulderico Dardano , Silvana Rinauro

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Group Theory · Mathematics 2011-11-10 David J. Buckley , Derek F. Holt

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…

Group Theory · Mathematics 2011-08-02 Robert Gray , Nik Ruskuc

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

Group Theory · Mathematics 2014-11-11 Guo-An Diao , Mark Feighn

For a continuous action of a countable discrete group $G$ on a Polish space $X$, a countable Borel partition $P$ of $X$ is called a generator if $G \cdot P := \{ gC : g \in G, C \in P \}$ generates the Borel $\sigma$-algebra of $X$. For $G…

Logic · Mathematics 2014-11-12 Anush Tserunyan

We first give a short group theoretic proof of the following result of Lackenby. If $G$ is a large group, $H$ is a finite index subgroup of $G$ admitting an epimorphism onto a non--cyclic free group, and $g$ is an element of $H$, then the…

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii , D. V. Osin

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

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.

Group Theory · Mathematics 2026-04-07 Andrea Lucchini

A subgroup $H$ of a finite group $G$ is said to satisfy $\Pi$-property in $G$ if for every chief factor $L/K$ of $G$, $|G/K:N_{G/K}(HK/K\cap L/K)|$ is a $\pi(HK/K\cap L/K)$-number. A subgroup $H$ of $G$ is called to be $\Pi$-supplemented in…

Group Theory · Mathematics 2014-01-08 Xiaoyu Chen , Wenbin Guo

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Representation Theory · Mathematics 2007-05-23 Jeb F. Willenbring , Gregg J. Zuckerman

In this paper, we formulate the notion of split elements of a unipotent class in a connected reductive group $G$. Generalized Green functions of $G$ can be computed by using Lusztig's algorithm, if split elements exist for any unipotent…

Representation Theory · Mathematics 2024-09-02 Frank Lübeck , Toshiaki Shoji

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.

Group Theory · Mathematics 2015-12-18 Gilbert Baumslag , Charles F. Miller , Gretchen Ostheimer

Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…

Group Theory · Mathematics 2020-07-28 Heiko Dietrich , Darren Low

In 1904, Issai Schur proved the following result. If $G$ is an arbitrary group such that $G/\Z(G)$ is finite, where $\Z(G)$ denotes the center of the group $G$, then the commutator subgroup of $G$ is finite. A partial converse of this…

Group Theory · Mathematics 2018-07-10 Manoj K. Yadav