نتایج جستجو برای: kopkas d posets
تعداد نتایج: 579465 فیلتر نتایج به سال:
We study two kinds of segment orders, using definitions first proposed by Farhad Shahrokhi. Although the two kinds of segment orders appear to be quite different, we prove several results suggesting that the are very much the same. For example, we show that the following classes belong to both kinds of segment orders: (1) all posets having dimension at most 3; (2) interval orders; and for n ≥ 3...
We present a categorical approach to the extension of probabilities, i.e. normed σ-additive measures. J. Novák showed that each bounded σ-additive measure on a ring of sets is sequentially continuous and pointed out the topological aspects of the extension of such measures on over the generated σ-ring σ( ): it is of a similar nature as the extension of bounded continuous functions on a complete...
In 2001, S. Bulman-Fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts AS over a monoid S that can be described by means of when the functor AS ⊗ − preserves pullbacks. In this paper, we extend these results to S-posets and present equivalent descriptions of weakly kernel po-flat, principally...
We consider the class Pn of labeled posets on n elements which avoid certain three-element induced subposets. We show that the number of posets in Pn is (n+1) by exploiting a bijection between Pn and the set of regions of the arrangement of hyperplanes in R of the form xi&xj=0 or 1 for 1 i< j n. It also follows that the number of posets in Pn with i pairs (a, b) such that a<b is equal to the nu...
We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of two-dimensional countable subshifts with interesting properties. We present an SFT whose iterated derivatives are maximally complex from the computational point ...
One of central issues in extremal set theory is Sperner's theorem and its generalizations. Among such generalizations is the best-known BLYM inequality and the Ahlswede--Zhang (AZ) identity which surprisingly generalizes the BLYM into an identity. Sperner's theorem and the BLYM inequality has been also generalized to a wide class of posets. Another direction in this research was the study of mo...
We introduce a special type of graph embedding called book embedding and apply it to posets. A book embedding scheme for bipartite graphs is given, and is used to extend the embeddings to general k-partite graphs. Finally, we view the Hasse diagram of a poset as a directed k-partite graph and use this scheme to derive a book embedding for arbitrary posets. Using this book embedding scheme, we a...
In this paper we attempt to find and investigate the most general class of posets which satisfy a properly generalized version of the Hofmann-Mislove theorem. For that purpose, we generalize and study some notions (like compactness, the Scott topology, Scott open filters, prime elements, the spectrum etc.), and adjust them for use in general posets instead of frames. Then we characterize the po...
The closure of the convex cone generated by all flag f -vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of posets. These are in one-to-one correspondence with antichains of intervals on the set of ranks and thus are counted by Catalan numbers. Furthermore, we prove ...
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset with a nontrivial non-Hausdorff topology. Their ability to reproduce important topological information of the continuum has been the main motivation for the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید