Results 81 to 90 of about 1,050,506 (284)
Existence of continuous utility functions for arbitrary binary relations: some sufficient conditions [PDF]
We present new sufficient conditions for the existence of a continuous utility function for an arbitrary binary relation on a topological space. Such conditions are basically obtained by using both the concept of a weakly continuous binary relation on a ...
Bosi, Gianni +2 more
core +1 more source
The Ran-Reurings fixed point theorem without partial order: a simple proof
The purpose of this note is to generalize the celebrated Ran and Reurings fixed point theorem to the setting of a space with a binary relation that is only transitive (and not necessarily a partial order) and a relation-complete metric.
Ben-El-Mechaiekh, Hichem
core +1 more source
Non-unique fixed-point theorems play a pivotal role in the mathematical modeling to solve certain typical equations, which admit more than one solution. In such situations, traditional outcomes fail due to uniqueness of fixed points.
Doaa Filali, Faizan Ahmad Khan
doaj +1 more source
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
GREEN'S RELATIONS ON THE SEMIGROUP OF BINARY RELATIONS
\(\beta\) \({}_ X\) is the semigroup of all binary relations on the set X. The author associates with certain binary relations, subrelations called right and left skeletons. He then determines whether or not the original relations are \({\mathcal L}\), \({\mathcal R}\), \({\mathcal D}\) or \({\mathcal J}\)-equivalent (where these represent, as usual ...
openaire +2 more sources
A theorem on the semigroup of binary relations [PDF]
PROOF. Necessity. Let p =p5p, where 5 ESx. Let o = 6p, then o2 = andp =po-. It is known in [1] that L(of) and L(p) are complete lattices in which joins are unions and, moreover, L(of) is completely distributive. If A CX, then it is easy to show that {t(A) =4t(4(A)) and +(A) =x(+1(A)) where c(A)EL(o-), ql(A)EL(p) and X(A)EL(a). Define the mapping 0 of L(
openaire +2 more sources
Impact of Asymptomatic Intracranial Hemorrhage on Outcome After Endovascular Stroke Treatment
ABSTRACT Background Endovascular treatment (EVT) achieves high rates of recanalization in acute large‐vessel occlusion (LVO) stroke, but functional recovery remains heterogeneous. While symptomatic intracranial hemorrhage (sICH) has been well studied, the prognostic impact of asymptomatic intracranial hemorrhage (aICH) after EVT is less certain ...
Shihai Yang +22 more
wiley +1 more source
Vestibular Patient Journey: Insights From Vestibular Disorders Association (VeDA) Registry
ABSTRACT Objective Vestibular symptoms impose a high burden of disability. Understanding real‐world diagnostic and treatment pathways can identify care gaps and guide interventions. We aimed to characterize symptom profiles, diagnostic trends, provider involvement, and treatment patterns in vestibular disorders.
Ali Rafati +10 more
wiley +1 more source
On the dimension of the core of the assignment game [PDF]
The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation.
Carlos Rafels Pallarola +1 more
core +1 more source
ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown +6 more
wiley +1 more source

