Symbolic Computation of the Orthogonal Projection of Rational Curves onto Rational Parameterized Surfaces

This paper focuses on the orthogonal projection of rational curves onto rational parameterized surface. Three symbolic algorithms are developed and studied. One of them, based on regular systems, is able to compute the exact parametric loci of projection. The one based on Gröbner basis can compute the minimal variety that contains the parametric loci. The remaining one computes a variety that contains the parametric loci via resultant. Examples show that our algorithms are efficient and valuable.

PERMUTATION IDENTITIES AND VARIETIES OF NILSEMIGROUPS

For any variety V of semigroups there exists a smallest semigroup variety PV containing V and closed for the construction of power semigroups. These varieties PV form a countably infinite subset PL(S) of the lattice L(S) of semigroup varieties. Though (PL(S), ⊆) is a complete lattice, it is not a complete sublattice of L(S). There exists however an interval in L(S) consisting of varieties of nilsemigroups which is isomorphic to (PL(S), ⊆). It will be shown that the equivalence classes of the equivalence relation induced by P: L(S)→PL(S), V↦PV, each contain a unique minimal variety consisting of nilsemigroups.

Simple surjective algebras having no proper subalgebras

We prove that every finite, simple, surjective algebra having no proper subalgebras is either quasiprimal or affine or isomorphic to an algebra term equivalent to a matrix power of a unary permutational algebra. Consequently, it generates a minimal variety if and only if it is quasiprimal. We show also that a locally finite, minimal variety omitting type 1 is minimal as a quasivariety if and only if it has a unique subdirectly irreducible algebra.

Minimal varieties and quasivarieties

We prove that every locally finite, congruence modular, minimal variety is minimal as a quasivariety. We also construct all finite, strictly simple algebras generating a congruence distributive variety, such that the sett of unary term perations forms a group. Lastly, these results are applied to a problem in algebraic logic to give a sufficient condition for a deductive system to be structurally complete.