Results 21 to 30 of about 1,269,847 (220)
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
A survey on projectively equivalent representations of finite groups [PDF]
The paper is a survey type article in which we present some results on projectively equivalent representations of finite groups.
Tania Luminiţa Costache
doaj
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 the σ-Length of Maximal Subgroups of Finite σ-Soluble Groups
Let σ={σi:i∈I} be a partition of the set P of all prime numbers and let G be a finite group. We say that G is σ-primary if all the prime factors of |G| belong to the same member of σ. G is said to be σ-soluble if every chief factor of G is σ-primary, and
Abd El-Rahman Heliel +2 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
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 connected components and perfect codes of proper order graphs of finite groups [PDF]
Let G be a finite group with the identity element e. The proper order graph of G, denoted by â* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj +1 more source
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani +14 more
wiley +1 more source

