Graphs for Pattern Recognition

1Infeasible monotone systems of constraints

In discrete mathematics, the following research subjects are of prime importance: Let := {s1, s2, . . . , sm} be a finite nonempty system of constraints and [m] := {1,2, . . . , m} the set of the indices of constraints with which the elements of the set S are marked. Assigning to the set [m] the Boolean lattice B(m) of all its subsets partially ordered by set-theoretical inclusion, we call an arbitrary element B ∈ B(m) the multiindex of the subsystem {si : i ∈ B} of the system ; in many studies the shorter ...