Results 31 to 40 of about 1,434,420 (325)
On groups of finite weight [PDF]
A subset S S of a group G G is said to normally generate G G if the smallest normal subgroup of G G which contains S S is G G itself. If α \alpha is minimal with the property that there exist a set of cardinality α \
openaire +2 more sources
Convergence of random walks on double transitive group generated by its permutational character
Let $P$ be a probability on a finite group $G$, $U(g)=\frac{1}{|G|}$ the uniform (trivial) probability on the group $G$, $P^{(n)}=P *\ldots*P$ an $n$-fold convolution of $P$.
Aleksandr L. Vyshnevetskiy
doaj +1 more source
Complete Groups of Order $3p^6$ [PDF]
For each prime number $p$ with $3 | p − 1$, we construct a group of order $3p^5$, whose automorphism group is a complete group of order $3p^6$.
M. John Curran, Rex S. Dark
doaj +1 more source
WZW orientifolds and finite group cohomology
The simplest orientifolds of the WZW models are obtained by gauging a Z_2 symmetry group generated by a combined involution of the target Lie group G and of the worldsheet.
A. Kapustin +27 more
core +1 more source
On σ-Residuals of Subgroups of Finite Soluble Groups
Let σ={σi:i∈I} be a partition of the set of all prime numbers. A subgroup H of a finite group G is said to be σ-subnormal in G if H can be joined to G by a chain of subgroups H=H0⊆H1⊆⋯⊆Hn=G where, for every j=1,⋯,n, Hj−1 is normal in Hj or Hj/CoreHj(Hj−1)
A. A. Heliel +3 more
doaj +1 more source
On Abelian group representability of finite groups
14 ...
Thomas, Eldho K. +2 more
openaire +4 more sources
On forbidden subgraphs of main supergraphs of groups
In this study, we explore the main supergraph $ \mathcal{S}(G) $ of a finite group $ G $, defined as an undirected, simple graph with a vertex set $ G $ in which two distinct vertices, $ a $ and $ b $, are adjacent in $ \mathcal{S}(G) $ if the order of ...
Xiaoyan Xu +3 more
doaj +1 more source
On g-Noncommuting Graph of a Finite Group Relative to Its Subgroups
Let H be a subgroup of a finite non-abelian group G and g∈G. Let Z(H,G)={x∈H:xy=yx,∀y∈G}. We introduce the graph ΔH,Gg whose vertex set is G\Z(H,G) and two distinct vertices x and y are adjacent if x∈H or y∈H and [x,y]≠g,g−1, where [x,y]=x−1y−1xy.
Monalisha Sharma +2 more
doaj +1 more source
Finite groups whose coprime graphs are AT-free
Assume that $ G $ is a finite group. The coprime graph of $ G $, denoted by $ \Gamma(G) $, is an undirected graph whose vertex set is $ G $ and two distinct vertices $ x $ and $ y $ of $ \Gamma(G) $ are adjacent if and only if $ (o(x), o(y)) = 1 $, where
Huani Li, Xuanlong Ma
doaj +1 more source
Metric and strong metric dimension in TI-power graphs of finite groups
Given a finite group $ G $ with the identity $ e $, the TI-power graph (trivial intersection power graph) of $ G $ is an undirected graph with vertex set $ G $, in which two distinct vertices $ x $ and $ y $ are adjacent if $ \langle x\rangle\cap \langle
Chunqiang Cui, Jin Chen, Shixun Lin
doaj +1 more source

