Results 21 to 30 of about 165,985,528 (155)
International Journal of Mathematical Combinatorics, Vol.7 [PDF]
, 2013 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Partially ordered sets having selfdual system of intervals [PDF]
, 1998 summary:In the present paper we deal with the existence of large homogeneous partially ordered sets having the property described in the ...
Jakubík, Ján
core +1 more source
Order-Sensitive Domination in Partially Ordered Sets and Graphs [PDF]
, 2022 For a (finite) partially ordered set (poset) P, we call a dominating set D in the comparability graph of P, an order-sensitive dominating set in P if either x is an element of D or else a = 2, we associate to G a graded poset P-k(G) of height k, and ...
Mehmet Akif Yetim +5 more
core +1 more source
On generalized derivations of partially ordered sets [PDF]
, 2019 summary:Let $P$ be a poset and $d$ be a derivation on $P$. In this research, the notion of generalized $d$-derivation on partially ordered sets is presented and studied. Several characterization theorems on generalized $d$-derivations are introduced. The
Abdelwanis, Ahmed Y., Boua, Abdelkarim
core +1 more source
Completion of partially ordered sets [PDF]
, 2006 The paper considers a generalization of the standard completion of a partially ordered set through the collection of all its lower ...
Solovyov, Sergey
core +1 more source
Distances between partially ordered sets [PDF]
, 1993 summary:A distance between finite partially ordered sets is studied.
Zelinka, Bohdan
core +1 more source
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
Shaprly transitive partially ordered sets [PDF]
, 1986 We call a partially ordered set Λ sharply transitive if its group of order automorphisms is sharply transitive on Λ, that is, if it is transitive on Λ and every non-trivial automorphism has no fixed points.
Behrendt, Gerhard
core +1 more source
On the Limits of Intransitive Coordination
Ratio, EarlyView.ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley +1 more source
Evaluating Large‐Language Models in Bioinformatics Applications
Advanced Computing, Volume 1, Issue 1, December 2026.This work systematically evaluates advanced large language models across six representative bioinformatics tasks, from drug–drug interaction prediction and molecular optimization to single‐cell annotation and computational biology problem solving. The benchmark quantifies both their promise and limitations, offering practical guidance for prompt design,
Hengchuang Yin +9 more
wiley +1 more source