Results 61 to 70 of about 5,167,602 (281)

Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105

open access: yesMathematics, 2018
Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi   +2 more
doaj   +1 more source

An approach to Quillen’s conjecture via centralisers of simple groups

open access: yesForum of Mathematics, Sigma, 2021
For any given subgroup H of a finite group G, the Quillen poset ${\mathcal {A}}_p(G)$ of nontrivial elementary abelian p-subgroups is obtained from ${\mathcal {A}}_p(H)$ by attaching elements via their centralisers in H.
Kevin Iván Piterman
doaj   +1 more source

Simple Current Actions of Cyclic Groups

open access: yes, 2004
Permutation actions of simple currents on the primaries of a Rational Conformal Field Theory are considered in the framework of admissible weighted permutation actions. The solution of admissibility conditions is presented for cyclic quadratic groups: an
A.N. Schellekens   +12 more
core   +1 more source

Structural biology of ferritin nanocages

open access: yesFEBS Letters, EarlyView.
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley   +1 more source

3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs

open access: yesMathematical and Computational Applications, 2017
The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block ...
Xiaolian Liao, Guohua Chen, Shangzhao Li
doaj   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

Characterization of A5 and PSL(2,7) by sum of elements orders [PDF]

open access: yesInternational Journal of Group Theory, 2013
Let $G$ be a finite group. We denote $psi(G)=sum_{gin G}o(g)$ where $o(g)$ denotes the order of $g in G$. Here we show that $psi(A_5)< psi(G)$ for every nonsimple group $G$ of order 60. Also we prove that $psi(PSL(2,7))groups $G$ of order 168.
Seyyed Majid Jafarian Amiri
doaj  

LOCALLY NORMAL SUBGROUPS OF TOTALLY DISCONNECTED GROUPS. PART II: COMPACTLY GENERATED SIMPLE GROUPS

open access: yesForum of Mathematics, Sigma, 2017
We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr{S}$ consisting of compactly generated ...
PIERRE-EMMANUEL CAPRACE   +2 more
doaj   +1 more source

A methionine‐lined active site governs carbocation stabilization and product specificity in a bacterial terpene synthase

open access: yesFEBS Letters, EarlyView.
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel   +13 more
wiley   +1 more source

On the number of connected components of divisibility graph for certain simple groups [PDF]

open access: yesTransactions on Combinatorics, 2016
The divisibility graph D(G) D(G) for a finite group G G is a graph with vertex set cs(G)∖{1} cs(G)∖{1}‎ ‎where cs(G) cs(G) is the set of conjugacy class sizes of G G‎. ‎Two vertices a a and b b are adjacent whenever a a divides‎ ‎b b or b b divides a a‎.
Adeleh Abdolghafourian   +1 more
doaj  

Home - About - Disclaimer - Privacy