The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 261 –
280 of
448
We prove that every clone of operations on a finite set , if it contains a Malcev operation, is finitely related – i.e., identical with the clone of all operations respecting for some finitary relation over . It follows that for a fixed finite set , the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few...
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular, we give an interpretation of the height function in terms of the Hilbert-Samuel polynomial, and we compute bounds on the maximal order type.
In the present paper we deal with the existence of large homogeneous partially ordered sets having the property described in the title.
Currently displaying 261 –
280 of
448