- In mathematics, in the area of
order theory, an
antichain is a
subset of a
partially ordered set such that any two
distinct elements in the
subset are...
-
subset A of a
partially ordered set P is a
strong downwards antichain if it is an
antichain in
which no two
distinct elements have a
common lower bound...
-
satisfy the
countable chain condition, or to be ccc, if
every strong antichain in X is countable.
There are
really two conditions: the
upwards and downwards...
- on the size of an
antichain, the
sizes of the
largest antichain and of the
smallest chain decomposition are
again equal. An
antichain in a
partially ordered...
-
monotone Boolean functions of n variables. Equivalently, it is the
number of
antichains of
subsets of an n-element set, the
number of
elements in a free distributive...
- sets is a
strict subset of
another is
called a
Sperner family, or an
antichain of sets, or a clutter. For example, the
family of k-element
subsets of...
- is that
every tree of
height ω1
either has a
branch of
length ω1 or an
antichain of
cardinality ℵ1. The
generalized Suslin hypothesis says that for every...
-
binomial (disambiguation). Abel's
binomial theorem Alternating factorial Antichain Beta
function Bhargava factorial Binomial coefficient Pascal's triangle...
-
ordered set in
terms of a
partition of the
order into a
minimum number of
antichains. It is
named for Leon Mirsky (1971) and is
closely related to Dilworth's...
- the two
additional values ± ∞ {\displaystyle \pm \infty } . If S is an
antichain (a set of
elements no two of
which are comparable) then the Dedekind–MacNeille...
