Results 21 to 30 of about 1,435,485 (270)
Speed of convergence of complementary probabilities on finite group
Visnik Harkivsʹkogo Nacionalʹnogo Universitetu im. V.N. Karazina. Cepiâ Matematika, Prikladna Matematika i Mehanika, 2021 Let function P be a probability on a finite group G, i.e. $P(g)\geq0\ $ $(g\in G),\ \sum\limits_{g}P(g)=1$ (we write $\sum\limits_{g}$ instead of $\sum\limits_{g\in G})$.
Alexander Vyshnevetskiy
doaj +1 more source
Finite Groups whose Cyclic Subnormal Subgroups Satisfy Certain Permutability Conditions [PDF]
Advances in Group Theory and Applications, 2016 Finite groups in which each cyclic subnormal subgroup is semipermutable, S-semipermutable or seminormal are investigated.
A. Ballester-Bolinches +2 more
doaj +1 more source
Integral forms in vertex operator algebras, a survey [PDF]
International Journal of Group Theory, 2020 We give a brief survey of recent work on integral forms in vertex operator algebras (VOAs).
Robert Griess
doaj +1 more source
Extraspecially Irreducible Groups [PDF]
Advances in Group Theory and Applications, 2016 Given distinct prime numbers $q$ and $r$, we construct a semidirect product $CR$ with $R\vartriangleleft CR$, where $C$ is a cyclic group of order $q$, and $R$ is an extraspecial $r$-group, such that $C$ centralizes $R'$, and $R$ is minimal among the ...
R. Dark, A.D. Feldman, M.D. Pérez-Ramos
doaj +1 more source
A new approach to character-free proof for Frobenius theorem [PDF]
AUT Journal of Mathematics and Computing, 2023 Let G be a Frobenius group. Using character theory, it is proved that the Frobenius kernel of G is a normal subgroup of G, which is well-known as a Frobenius theorem. There is no known character-free proof for Frobenius theorem. In this note, we prove it,
Seyedeh Fatemeh Arfaeezarandi +1 more
doaj +1 more source
Functional renormalisation group in a finite volume [PDF]
, 2015 We study a $\phi^4$-theory at finite temperature in a finite volume. Quantum, thermal and volume fluctuations are treated with the functional renormalisation group.
Fister, Leonard, Pawlowski, Jan Martin
core +3 more sources
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
Smith equivalence and finite Oliver groups with Laitinen number 0 or 1 [PDF]
, 2002 In 1960, Paul A. Smith asked the following question. If a finite group G acts smoothly on a sphere with exactly two fixed points, is it true that the tangent G-modules at the two points are always isomorphic? We focus on the case G is an Oliver group and
Bak +34 more
core +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
Finite Groups as Isometry Groups [PDF]
Transactions of the American Mathematical Society, 1976 We show that given any finite group G of cardinality k + 1 k + 1 , there is a Riemannian sphere S k − 1 {S^{k - 1}} (imbeddable isometrically as a hypersurface in R
openaire +2 more sources