English
Related papers

Related papers: Words and characters in finite p-groups

200 papers

Let $G$ be any group. The quotient group $T(G)$ of the multiple holomorph by the holomorph of $G$ has been investigated for various families of groups $G$. In this paper, we shall take $G$ to be a finite $p$-group of class two for any odd…

Group Theory · Mathematics 2022-12-07 A. Caranti , Cindy Tsang

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing the element $x$. A famous theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the derived group…

Group Theory · Mathematics 2021-09-20 Cristina Acciarri , Pavel Shumyatsky

We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…

Group Theory · Mathematics 2017-10-31 A. Lucchini

Let $G$ be an odd order nilpotent group with class 2 and $e$ denotes the exponent of its commutator subgroup. Let $e=p_1^{r_1}p_2^{r_2}... p_s^{r_s}$, where $p_i$'s are odd primes and $r_i$'s are non-negative integers. Then there are at…

Group Theory · Mathematics 2011-12-26 Vivek Kumar Jain

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We…

Group Theory · Mathematics 2011-07-19 Michael Larsen , Aner Shalev , Pham Huu Tiep

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

Group Theory · Mathematics 2011-11-08 Alexander Olshanskii

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

Combinatorics · Mathematics 2015-02-25 Amy Glen , Florence Levé

The power word problem for a group $G$ asks whether an expression $u_1^{x_1} \cdots u_n^{x_n}$, where the $u_i$ are words over a finite set of generators of $G$ and the $x_i$ binary encoded integers, is equal to the identity of $G$. It is a…

Group Theory · Mathematics 2023-01-13 Markus Lohrey , Florian Stober , Armin Weiß

Let $w$ be a multilinear commutator word. In the present paper we describe recent results that show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely (or in some cases countably) many subgroups…

Group Theory · Mathematics 2017-03-06 Cristina Acciarri , Pavel Shumyatsky

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

Let $B$ be a $p$-block of a finite group, and set $m=$ $\sum \chi(1)^2$, the sum taken over all height zero characters of $B$. Motivated by a result of M. Isaacs characterising $p$-nilpotent finite groups in terms of character degrees, we…

Representation Theory · Mathematics 2014-02-25 Radha Kessar , Markus Linckelmann , Gabriel Navarro

Let $G$ be a finite group acting faithfully on a finite set $\Omega$. For a positive integer $k$, $G$ acts naturally on the Catesian product $\Omega^k := \Omega \times ...\times \Omega$. In this paper, we prove that finite nilpotent group…

Group Theory · Mathematics 2024-02-28 Jiawei He , Xiaogang Li

For a Baumslag-Solitar group $G$ we calculate the intersection $\gamma_w(G)$ of all terms of the lower central sequence of $G$.Using this we are able to show that $[\gamma_w(G),G]=\gamma_w(G)$ thus answering a question of Bardakov and…

Group Theory · Mathematics 2022-08-16 C. E. Kofinas , V. Metaftsis , A. I. Papistas

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

Geometric Topology · Mathematics 2019-07-01 Denis Fedoseev , Andrey Karpov , Vassily Manturov

We prove several results detecting ciclicity or nilpotency of a finite group $G$ in terms of inequalities involving the orders of the elements of $G$ and the orders of the elements of the cyclic group of order $|G|$. We prove that, among…

Group Theory · Mathematics 2015-12-29 Martino Garonzi , Massimiliano Patassini

If $G$ is a finite group, an irreducible complex-valued character $\chi$ is called rational if $\chi(g)$ is rational for all $g\in G$. Also, a conjugacy class $x^G$ is called rational, if for all irreducible complex-valued character $\chi$,…

Group Theory · Mathematics 2025-03-27 Dilpreet Kaur , Saikat Panja

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

Group Theory · Mathematics 2024-02-26 Pavel Shumyatsky

We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations…

Group Theory · Mathematics 2011-11-08 Alexander Olshanskii

For a finite group $G,$ $\mathsf{D}(G)$ is defined as the least positive integer $k$ such that for every sequence $S=g_1\bdot g_2\bdot \dotsc \bdot g_k$ of length $k$ over $G$, there exist $1 \le i_1 < i_2 <\cdots < i_m \le k $ such that…

Combinatorics · Mathematics 2025-11-25 Naveen K. Godara , Renu Joshi , Eshita Mazumdar