Results 21 to 30 of about 15,277,946 (359)
Automorphism groups of polycyclic-by-finite groups and arithmetic groups [PDF]
, 2005 We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of the algebraic
A. Borel +40 more
core +2 more sources
Rokhlin dimension for actions of residually finite groups [PDF]
Ergodic Theory and Dynamical Systems, 2014 We introduce the concept of Rokhlin dimension for actions of residually finite groups on $\text{C}^{\ast }$ -algebras, extending previous such notions for actions of finite groups and the integers by Hirshberg, Winter and the third author. We are able to
G. Szabó, Jianchao Wu, J. Zacharias
semanticscholar +1 more source
A Study On the Kernels of Irreducible Characters of Finite Groups
Cumhuriyet Science Journal, 2022 Let G be a finite group and χ∈Irr(G), where Irr(G) denotes the set of all irreducible characters of G. The kernel of χ is defined by ker(χ)={ g∈G ┤| χ(g)=χ(1)}, where χ(1) is the character degree of χ. The irreducible character χ of G is called as
Temha Erkoç, Burcu Çınarcı
doaj +1 more source
Finite groups with 4p2q elements of maximal order
Open Mathematics, 2021 It is an interesting and difficult topic to determine the structure of a finite group by the number of elements of maximal order. This topic is related to Thompson’s conjecture, that is, if two finite groups have the same order type and one of them is ...
Tan Sanbiao, Chen Guiyun, Yan Yanxiong
doaj +1 more source
Finite Groups Having Monolithic Characters of Prime Degree
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2021 Let G be a finite group. An irreducible character χ is called monolithic when the factor group G/ker(χ) has unique minimal normal subgroup. In this paper, we prove that for the smallest prime q dividing the order of G if G has a faithful imprimitive ...
Temha Erkoç, Burcu Çınarcı
doaj +1 more source
Brauer relations in finite groups [PDF]
, 2015 If G is a non-cyclic finite group, non-isomorphic G-sets X, Y may give rise to isomorphic permutation representations C[X] and C[Y]. Equivalently, the map from the Burnside ring to the representation ring of G has a kernel. Its elements are called Brauer
Bartel, Alex, Dokchitser, Tim
core +4 more sources
On finite totally $2$-closed groups
Comptes Rendus. Mathématique, 2022 An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega }$ for any set $\Omega $ with $G\cong H\le \mathrm{Sym}(\Omega )$, where $H^{(2),\Omega }$ is the largest subgroup of $\mathrm{Sym}(\Omega )$ whose orbits on $\Omega \times \Omega ...
Abdollahi, Alireza +2 more
doaj +1 more source
Journal of Pure and Applied Algebra, 2011 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 properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially ...
Myasnikov, Alexei, Osin, Denis
openaire +2 more sources
FINITELY ANNIHILATED GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 AbstractIn 1976, Wiegold asked if every finitely generated perfect group has weight 1. We introduce a new property of groups,finitely annihilated, and show that this might be a possible approach to resolving Wiegold’s problem. For finitely generated groups, we show that in several classes (finite, solvable, free), being finitely annihilated is ...
openaire +3 more sources
On Polish Groups of Finite Type [PDF]
, 2011 Sorin Popa initiated the study of Polish groups which are embeddable into the unitary group of a separable finite von Neumann algebra. Such groups are called of finite type.
Ando, Hiroshi, Matsuzawa, Yasumichi
core +2 more sources