Results 21 to 30 of about 17,115,327 (210)
Neutrino mixing from finite modular groups [PDF]
We study the lepton flavor models, whose flavor symmetries are finite subgroups of the modular group such as $S_3$ and $A_4$. In our models, couplings are also nontrivial representations of these groups and modular functions of the modulus.
Tatsuo C. Kobayashi +2 more
semanticscholar +1 more source
Brauer relations in finite groups [PDF]
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 Shunkov Groups Saturated with Finite Groups
The structure of the group consisting of elements of finite order depends to a large extent on the structure of the finite subgroups of the group under consideration. One of the effective conditions for investigating an infinite group containing elements
A.A. Shlepkin
doaj +1 more source
Rokhlin dimension for actions of residually finite groups [PDF]
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
Finite groups of units of finite characteristic rings [PDF]
In \cite[Problem 72]{Fuchs60} Fuchs asked the following question: which groups can be the group of units of a commutative ring? In the following years, some partial answers have been given to this question in particular cases.
Del Corso, I., Dvornicich, R.
core +2 more sources
Two new criteria for solvability of finite groups
We prove the following two new criteria for the solvability of finite groups. Theorem 1: Let G be a finite group of order n containing a subgroup A of prime power index p s .
M. Herzog, P. Longobardi, M. Maj
semanticscholar +1 more source
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
F^ω-injectors of finite groups [PDF]
Only finite groups and classes of finite groups are considered. $\frak F$-injectors (B. Fischer, W. Gaschutz, B. Hartley, 1967) and $\frak F$-projectors (W.
Sorokina, Marina M., Novikova, Diana G.
doaj +1 more source
Finite groups with 4p2q elements of maximal order
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
On finite totally $2$-closed groups
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

