Results 21 to 30 of about 99,568 (264)
Core-EP-Nilpotent Decomposition and Its Applications
Journal of Mathematics, 2023 We give the illustration of a new decomposition: the core-EP-nilpotent decomposition, which is on the basis of the core-EP decomposition and EP-nilpotent decomposition for some square matrices in this thesis.
Yang Zhang, Zongyang Jiang
doaj +1 more source
Axioms, 2019 We present new results in interval analysis (IA) and in the calculus for interval-valued functions of a single real variable. Starting with a recently proposed comparison index, we develop a new general setting for partial order in the (semi linear ...
Luciano Stefanini +2 more
doaj +1 more source
Some Characterizations and Properties of a New Partial Order
Journal of Mathematics, 2020 On the basis of Löwner partial order and core partial order, we introduce a new partial order: LC partial order. By applying matrix decomposition, core inverse, core partial order, and Löwner partial order, we give some characteristics of LC partial ...
Xiaoji Liu, Fang Gui
doaj +1 more source
Partial coupling delay induced multiple spatiotemporal orders in a modular neuronal network. [PDF]
PLoS ONE, 2017 The influence of partial coupling delay on the spatiotemporal spiking dynamics is explored in a modular neuronal network. The modular neuronal network is composed of two subnetworks which present the small-world property and scale-free property ...
XiaoLi Yang, HuiDan Li, ZhongKui Sun
doaj +1 more source
The Annals of Probability, 1978 A probability measure $P$ on a partially ordered Polish space $E$ is called stochastically smaller than $Q$ (notation: $P \leqslant Q$) if $\int f dP \leqslant \int f dQ$ holds for all bounded increasing measurable $f$. We investigate the question when for a stochastically increasing family $\{P_t, t \in \mathbb{R}\}$ there exists an increasing process
Kamae, T., Krengel, U.
openaire +3 more sources
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source
Tree-Automatic Well-Founded Trees [PDF]
Logical Methods in Computer Science, 2013 We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega.
Martin Huschenbett +3 more
doaj +1 more source
Lexicographic Partial Order [PDF]
Transactions of the American Mathematical Society, 1978 Given a (partially) ordered set P with the descending chain condition, and an ordered set Q, the set Q P {Q^P} of functions from P to Q has a natural lexicographic order, given by f ⩽ g f \leqslant g if and only if f ( y )
openaire +1 more source
Aggregating Partially Ordered Preferences [PDF]
Journal of Logic and Computation, 2008 Preferences are not always expressible via complete inear orders: sometimes it is more natural to allow for the presence of incomparable outcomes. This may hold both in the agents' preference ordering and in the social order. In this article, we consider this scenario and study what properties it may have. In particular, we show that, despite the added
PINI, MARIA SILVIA +3 more
openaire +2 more sources
On the use of partial orders in uniform spaces
Applied General Topology, 2003 We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditions and four different convergence conditions yield 36 completeness properties, each of which turns out to be equivalent to a known form of completeness ...
Bruce S. Burdick
doaj +1 more source