Results 101 to 110 of about 12,824,044 (290)
On the diameter of the intersection graph of a finite simple group [PDF]
summary:Let $G$ be a finite group. The intersection graph $\Delta _G$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of $G$, and two distinct vertices $X ...
Ma, Xuanlong
core +1 more source
A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
Electrostatic Superlattices Beyond 1:1 Stoichiometry
Polymer‐mediated charge regulation drives two hierarchical routes to higher‐stoichiometry nanoparticle superlattices. Tuning the polymer's molecular weight promotes progressive interstitial filling, transforming ZnS into the fully occupied CaF2${\rm CaF}_2$ lattice. Exchanging polymer assignment between large and small nanoparticles instead breaks CsCl
Binay P. Nayak +7 more
wiley +1 more source
A field‐driven transition from chiral stripes to an achiral fan state is observed in a tetragonal magnet and linked to a temperature‐dependent rotation of the effective Dzyaloshinskii–Moriya interaction axis. This interplay generates pronounced in‐plane anisotropy and provides a new route for controlling chiral spin textures in noncentrosymmetric ...
Victor Ukleev +19 more
wiley +1 more source
On derangements in simple permutation groups
Let $G \leqslant \mathrm {Sym}(\Omega )$ be a finite transitive permutation group and recall that an element in G is a derangement if it has no fixed points on $\Omega $ . Let $\Delta (G)$ be the set of derangements in G and define
Timothy Burness, Marco Fusari
doaj +1 more source
Spectral properties of the commuting graphs of certain groups
Let be a finite group. The commuting graph is a simple graph with vertex set and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +1 more source
A gradient‐engineered all‐paper sensor is fabricated by integrating MXene and in situ grown AgNPs within hierarchical cellulose networks. The device breaks the sensitivity–detection range trade‐off through cascaded conductive pathways, enabling ultrahigh pressure sensitivity, humidity–pressure decoupled dual‐mode sensing, and outstanding EMI shielding,
Ao Li +7 more
wiley +1 more source
Non-Solvable Groups whose all Vanishing Class Sizes are Odd-Square-Free [PDF]
Given a finite group G, a vanishing element is an element x ∈ G for which there exists χ ∈ Irr(G) such that χ(x) = 0. The conjugacy class of a vanishing element is called a vanishing class of G. Considering G as a finite non-solvable group with Sol(G) as
Roghayeh Hafezieh, Gülsemin Çonoğlu
doaj +1 more source
Exchange‐Coupled Two‐Dimensional MOFs
Graphene mediates ferromagnetic coupling between two‐dimensional metal‐organic frameworks and cobalt. Fe‐tetracyanobenzene develops a remanent magnetic response whose orientation follows the cobalt magnetization direction and persists up to room temperature, whereas Ni‐TCNB remains only field‐polarized.
Iulia Cojocariu +5 more
wiley +1 more source
Group rings of finite simple groups
Let G be a finite non-abelian simple group. In the first part we consider the question whether CG determines G up to isomorphism. This question is closely related to a recent conjecture of B.
Kimmerle, W.
core +1 more source

