Results 41 to 50 of about 30,248 (245)
Most primitive groups are full automorphism groups of edge-transitive hypergraphs
, 2014 We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞.
Cameron, Peter Jephson +2 more
core +1 more source
Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs
Advanced Intelligent Discovery, EarlyView.Structure motifs in materials are used to construct a bipartite material–motif network that links each material to its constituent motifs and establishes connectivity among materials sharing common motifs. Network analysis reveals material clusters associated with different functional applications and supports motif‐guided screening of materials.
Anoj Aryal +3 more
wiley +1 more source
Limit Average Shadowing and Dominated Splitting
پژوهشهای ریاضی, 2020 Introduction The influence of persistence behavior of a dynamical system on tangent bundle of a manifold is always a challenge in dynamical systems. Persistence properties have been studied on whole manifold or on some pieces with independent dynamics ...
Khosro Tajbakhsh
doaj
American Journal of Hematology, EarlyView.Our meta‐analysis showed significant improvement of PFS with lenalidomide, proteasome inhibitors, and CD38‐based therapies. A significant OS benefit was noted only with lenalidomide in transplant‐eligible (TE) patients, while CD38‐directed therapy showed a trend toward improved OS.
Heinz Ludwig +25 more
wiley +1 more source
Some Remarks On The Structure Of Strong K-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2014 A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense.
Hernández-Cruz César +1 more
doaj +1 more source
Characterization of perfect matching transitive graphs
Electronic Journal of Graph Theory and Applications, 2018 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Reaching global net‐zero targets has become an urgent priority as businesses and nations face increasing pressure to reduce greenhouse gas emissions. Achieving carbon neutrality in manufacturing supply chains requires comprehensive systemic changes across business processes.
Vimal K. E. K. +5 more
wiley +1 more source
Supply Chain Network, ESG Scores and Financial Performance
Business Strategy and the Environment, EarlyView.ABSTRACT This paper provides novel evidence on the role of supply chain networks in influencing firms' environmental, social and governance (ESG) scores and financial performance. Our analysis employs financial, board, ESG and supply chain data, resulting in an unbalanced panel of over 16,000 firm‐year observations from 3028 publicly traded US firms ...
Michail Filippidis +2 more
wiley +1 more source
Prime order derangements in primitive permutation groups
, 2011 Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M. +10 more
core +1 more source
Epilepsia, EarlyView.Abstract Objective Epilepsy affects ~1% of the global population and often requires lifelong antiseizure medication (ASM) therapy. Valproic acid (VPA) is a commonly prescribed first‐line ASM, yet only approximately half of patients achieve sustained seizure freedom. Treatment selection remains largely empirical.
Simeon Platte +15 more
wiley +1 more source