Antichains of Multisets
نویسندگان
چکیده
The problem of enumeration of m-antichains of k-bounded multisets on an n-set is considered. A formula for calculating the cardinality of the corresponding family in terms of the graph theory was obtained. A more general case of multiantichains is also considered. As an illustration the corresponding explicit formulas are given for the case when 1 ≤ m ≤ 4, k ≥ 1 and n ≥ 0.
منابع مشابه
General relations between partially ordered multisets and their chains and antichains
In this paper we begin with the basics of multisets and their operations introduced in [5, 22] and define a multiset relation, an equivalence multiset relation and explore some of their basic properties. We also define a partially ordered multiset as a multiset relation being reflexive, antisymmetric and transitive, chains and antichains of a partially ordered multiset, and extend Dilworth’s Th...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملAn Inequality for Kruskal-macaulay Functions
for some N ≥ k + 1, then the equality in (1.2) occurs only when a = 0. Kruskal-Macaulay functions are relevant for their applications to the study of antichains in multisets (see for example [11, 2]), posets, rings and polyhedral combinatorics (see [5] and the survey [3]). In particular, they play and important role in proving results, extensions and generalizations of classical problems concer...
متن کاملON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION
An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...
متن کاملComputing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes a fixed point over the lattice of contravariant antichains. Here contravariant antichains are antichains over pairs consisting of an information set and an allow set representing the associated move. We demonstrate how...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004