We study the structure of the partially ordered set of minors of an arbitrary function of several variables. We give an abstract characterization of such “minor posets” in terms of colorings of partition lattices, and we also present infinite families of examples as well as some constructions that can be used to build new minor posets
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
We find necessary and separate sufficient conditions for the difference between two labeled partiall...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
peer reviewedThe C-minor partial orders determined by the clones generated by a semilattice operatio...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
peer reviewedWe study the minor relation for algebra homomorphims in finitely generated quasivarieti...
Deletion and contraction operations on lattices enriched with a generating set were introduced by th...
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the lit...
peer reviewedWe find sufficient conditions for a subclone C of Burle's clone and for a subclone of t...
AbstractWe study the posets (partially ordered sets) Pn of partitions of an integer n, ordered by re...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
AbstractA partial ordering is defined for monotone projections on a lattice, such that the set of th...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
We find necessary and separate sufficient conditions for the difference between two labeled partiall...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
peer reviewedThe C-minor partial orders determined by the clones generated by a semilattice operatio...
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit...
peer reviewedWe study the minor relation for algebra homomorphims in finitely generated quasivarieti...
Deletion and contraction operations on lattices enriched with a generating set were introduced by th...
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the lit...
peer reviewedWe find sufficient conditions for a subclone C of Burle's clone and for a subclone of t...
AbstractWe study the posets (partially ordered sets) Pn of partitions of an integer n, ordered by re...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
AbstractA partial ordering is defined for monotone projections on a lattice, such that the set of th...
peer reviewedEach clone C on a fixed base set A induces a quasi-order on the set of all operations o...
AbstractEach clone C on a fixed base set A induces a quasi-order on the set of all operations on A b...
We find necessary and separate sufficient conditions for the difference between two labeled partiall...