中文
相关论文

相关论文: No iterated identities satisfied by all finite gro…

200 篇论文

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

群论 · 数学 2017-10-13 A. Abdollahi , M. Zallaghi

We give an affrmative answer to the question whether a residually finite Engel group satisfying an identity is locally nilpotent. More generally, for a residually finite group G with an identity, we prove that the set of right Engel…

群论 · 数学 2018-06-01 Pavel Shumyatsky , Antonio Tortora , Maria Tota

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

群论 · 数学 2014-06-30 Robert Guralnick , Pavel Shumyatsky

A group $G$ is called mixed identity-free if for every $n \in \mathbb{N}$ and every $w \in G \ast F_n$ there exists a homomorphism $\varphi: G \ast F_n \rightarrow G$ such that $\varphi$ is the identity on $G$ and $\varphi(w)$ is…

群论 · 数学 2019-12-17 Bryan Jacobson

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

群论 · 数学 2024-02-13 Doron Shafrir

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…

群论 · 数学 2024-02-26 Pavel Shumyatsky

A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…

群论 · 数学 2024-01-11 Nic Brody , Kasia Jankiewicz

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

群论 · 数学 2008-10-03 Martin R. Bridson

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

群论 · 数学 2022-07-13 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

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. In particular, Olshanskii gave an example of such…

群论 · 数学 2023-07-28 Matteo Pintonello , Pavel Shumyatsky

The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…

群论 · 数学 2018-05-09 Giles Gardam

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

群论 · 数学 2011-02-23 Hung P. Tong-Viet

We give a new proof of Gromov's theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. Unlike the original proof, it does not rely on the Montgomery-Zippin-Yamabe structure theory of locally…

群论 · 数学 2007-12-02 Bruce Kleiner

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

群论 · 数学 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

A result of D. Segal states that every complex irreducible representation of a finitely generated nilpotent group $G$ is monomial if and only if $G$ is abelian-by-finite. A conjecture of A. N. Parshin, recently proved affirmatively by I.V.…

表示论 · 数学 2016-12-04 E. K. Narayanan , Pooja Singla

Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…

群论 · 数学 2025-02-05 Gabriel A. L. Souza

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

动力系统 · 数学 2026-02-03 Chatchai Noytaptim , Xiao Zhong

We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…

群论 · 数学 2025-11-21 Luca Sabatini

We give a construction of a family of locally finite residually finite groups with just-infinite C*-algebra. This answers a question from [2]. Additionally, we show that residually finite groups of finite exponent are never just-infinite.

算子代数 · 数学 2016-06-27 V. Belyaev , R. Grigorchuk , P. Shumyatsky