Results 251 to 260 of about 87,663 (288)
Correction for Taeb et al., Model selection over partially ordered sets. [PDF]
Proc Natl Acad Sci U S Aeuropepmc +1 more source
Comparative transcriptomics reveal the common anteroposterior molecular blueprint of adult bilaterian guts. [PDF]
PLoS BiolVianello SD +11 more
europepmc +1 more source
Biocatalytic 3D binary crystals formed through the self-assembly of enzyme-embedded ferritin.
NanoscaleZhou Y +3 more
europepmc +1 more source
Squamous cell carcinoma diagnosed as a suspected neuroendocrine tumor by gallium-68 DOTA-Tyr<sup>3</sup>-octreotate positron emission tomography scan: A case report. [PDF]
SAGE Open Med Case RepJohnson T +3 more
europepmc +1 more source
Minimum flow decomposition in graphs with cycles using integer linear programming. [PDF]
J Glob OptimDias FHC +3 more
europepmc +1 more source
Regular and semi-regular points of Cohen-Macaulay partially ordered sets
, 1987 孝之 日比
openalex +1 more source
On some topological-type properties of certain elements of a partially ordered set
, 1979 Domenico Lenzi
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2008
We introduce the notion of a partially ordered set (poset) we and define several types of special elements associated with partial orders.
Dan A. Simovici, Chabane Djeraba
openaire +2 more sources
We introduce the notion of a partially ordered set (poset) we and define several types of special elements associated with partial orders.
Dan A. Simovici, Chabane Djeraba
openaire +2 more sources
1986
Partially ordered sets, or posets, appear in many branches of mathematics, but they are fundamental in combinatorics. For example, many of the important enumeration techniques (generating functions, inclusion-exclusion) have their theoretical foundation in some underlying poset.
Dennis Stanton, Dennis White
openaire +2 more sources
Partially ordered sets, or posets, appear in many branches of mathematics, but they are fundamental in combinatorics. For example, many of the important enumeration techniques (generating functions, inclusion-exclusion) have their theoretical foundation in some underlying poset.
Dennis Stanton, Dennis White
openaire +2 more sources
Endomorphisms of Partially Ordered Sets
Combinatorics, Probability and Computing, 1998It is shown that every partially ordered set with n elements admits an endomorphism with an image of a size at least n1/7 but smaller than n. We also prove that there exists a partially ordered set with n elements such that each of its non-trivial endomorphisms has an image of size O((n log n)1/3).
Duffus, Dwight +3 more
openaire +2 more sources