English
Related papers

Related papers: Combing nilpotent and polycyclic groups

200 papers

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Group Theory · Mathematics 2025-02-11 Costantino Delizia , Michele Gaeta , Mark L. Lewis , Carmine Monetta

A group is called capable if it is a central factor group. We consider the capability of nilpotent products of cyclic groups, and obtain a generalization of a theorem of Baer for the metabelian small class case. The approach is also used to…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…

Group Theory · Mathematics 2015-11-25 Cristina Acciarri , Pavel Shumyatsky

This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely…

Group Theory · Mathematics 2012-05-16 Martin Bridson , Jose Burillo , Murray Elder , Zoran Sunic

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Combinatorics · Mathematics 2025-04-29 Ramesh Prasad Panda , Papi Ray

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

Combinatorics · Mathematics 2011-11-29 Ebrahim Ghaderpour , Dave Witte Morris

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.

Group Theory · Mathematics 2022-01-12 Luca Sabatini

The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler

Let P be a finite metacyclic 2-group and F a fusion system on P. We prove that F is nilpotent unless P has maximal class or P is homocyclic, i.e. P is a direct product of two isomorphic cyclic groups. As a consequence we obtain the…

Group Theory · Mathematics 2010-10-20 Benjamin Sambale

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…

Rings and Algebras · Mathematics 2019-06-07 Mikhail V. Zaicev , Dušan D. Repovš

We show that the definition of unipotent (resp. nilpotent) pieces for classical groups given by Lusztig (resp. Lusztig and the author) coincides with the combinatorial definition using closure relations on unipotent classes (resp. nilpotent…

Representation Theory · Mathematics 2018-05-25 Ting Xue

We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function.

Group Theory · Mathematics 2010-08-12 S. M. Gersten , D. F. Holt , T. R. Riley

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…

Group Theory · Mathematics 2013-09-19 Maggie Habeeb , Delaram Kahrobaei

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

Group Theory · Mathematics 2021-08-18 Dmitry Berdinsky , Murray Elder , Prohrak Kruengthomya

Suppose that a metacyclic Frobenius group $FH$, with kernel $F$ and complement $H$, acts by automorphisms on a finite group $G$, in such a way that $C_G(F)$ is trivial and $C_G(H)$ is nilpotent. It is known that $G$ is nilpotent and its…

Group Theory · Mathematics 2018-06-15 Valentina Iusa

A composite quantum system comprising a finite number k of subsystems which are described with position and momentum variables in Z_{n_{i}}, i=1,...,k, is considered. Its Hilbert space is given by a k-fold tensor product of Hilbert spaces…

Mathematical Physics · Physics 2012-10-24 M. Korbelar , J. Tolar

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

A group is called capable if it is a central factor group. We consider the capability of certain nilpotent products of cyclic groups, and obtain a generalisation of a theorem of Baer for the small class case. The approach may also be used…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

Group Theory · Mathematics 2024-06-25 Jason Behrstock , Mark Hagen , Alexandre Martin , Alessandro Sisto