Results 71 to 80 of about 6,090,423 (307)

A technique of tripled coincidence points for solving a system of nonlinear integral equations in POCML spaces

open access: yesJournal of Inequalities and Applications, 2020
This manuscript aims to initiate some recent theoretical consequences related to tripled coincidence points for non-self mappings via the notion of C-type functions in partially ordered complete metric-like space (for short, POCML space).
Hasanen A. Hammad, Manuel De La Sen
doaj   +1 more source

Between quantum logic and concurrency [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every
Luca Bernardinello   +2 more
doaj   +1 more source

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Total compactness of a-inductive partially ordered sets [PDF]

open access: yes, 1990
A poset (i.e., partially ordered set) P is called A-inductive iff every nonempty well ordered subset W of P has a supremum (i.e., least upper bound) wich need not be an element of ...
Abian, Alexander, Kemp, Paula A.
core  

Graphical partially ordered sets

open access: yesDiscrete Applied Mathematics, 1987
The main results of this paper can be found in a generalization of reconstruction properties to a large class of combinatorial structures by a concept of g-graph. For example in the section 3, the author shows many results about the reconstruction conjecture: many of them are known for graphs, but author's proof generalizes them for digraphs ...
openaire   +2 more sources

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

On chain and antichain families of a partially ordered set [PDF]

open access: yes, 1980
A common generalization of the theorems of Greene and Greene and Kleitman is presented. This yields some insight into the relation of optimal chain and antichain families of a partially ordered set.
Frank, András
core   +1 more source

A construction for partially ordered sets

open access: yesDiscrete Mathematics, 1980
AbstractA construction I(S) is defined which corresponds to the intuitive notion of the set of places in which new elements can be inserted into a given poset S. It is given the minimal possible ordering. It turns out that if the base sets are chains the construction produces the corresponding interval orders.
openaire   +2 more sources

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory

open access: yesOpen Mathematics, 2020
For a partially ordered set (A,≤)(A,\le ), let GA{G}_{A} be the simple, undirected graph with vertex set A such that two vertices a≠b∈Aa\ne b\in A are adjacent if either a≤ba\le b or b≤ab\le a.
Badawi Ayman, Rissner Roswitha
doaj   +1 more source

Home - About - Disclaimer - Privacy