Results 71 to 80 of about 500,030 (282)
Existence and Uniqueness of Ordinal Nash Outcomes [PDF]
Journal of Economic Theory, 2000 The authors study the problem -- the extent to which the ordinal Nash solution is well defined. They suggest a solution to this problem by identifying necessary and sufficient conditions for the ordinal Nash outcomes. Then they present necessary and sufficient conditions for the existence of a unique ordinal Nash outcome.
Eran Hanany, Zvi Safra
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Existence and uniqueness theorems on certain difference-differential equations
Electronic Journal of Differential Equations, 2009 In the present paper, existence and uniqueness theorems for the solutions of certain nonlinear difference-differential equations are established. The main tools employed in the analysis are based on the applications of the Leray-Schauder alternative ...
Baburao G. Pachpatte
doaj
On the existence of uniquely partitionable graphs
Electronic Notes in Discrete Mathematics, 2002 Abstract Let P be a property of graphs. A vertex ( P , n)-partition of a graph G is a partition {V1, V2, …, Vn} of its vertex set V(G) into n classes such that each Vi induces a subgraph G[Vi] with property P . A graph G is said to be uniquely ( P , n)-partitionable, n ≥ 2, if G has exactly one (P, n)-partition.
openaire +1 more source
Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM
FEBS Letters, EarlyView.Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley +1 more source
Existence of a unique zero of nonlinear systems
Journal of Numerical Mathematics, 2007 Existence statements for zeros of nonlinear equations are established via the interval Newton method generalizing previous theorems requiring regularity of the inclusion for the Jacobian.
Paul G. Bao +2 more
openaire +2 more sources
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
FEBS Letters, EarlyView.Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
The existence of uniquely −G colourable graphs
Discrete Mathematics, 1998 Given graphs \(F\) and \(G\) and a nonnegative integer \(k\), a function \(\pi :V(F)\rightarrow \{1,\ldots ,k\}\) is a \(-G\) \(k\)-colouring of \(F\) if no induced copy of \(G\) is monochromatic; \(F\) is \(-G\) \(k\)-chromatic if \(F\) has a \(-G\) \(k\)-colouring but no \(-G\) \((k-1)\)-colouring.
Dimitris Achlioptas +3 more
openaire +1 more source