The finite basis theorem for relatively normal lattices

This study has as its primary objective to provide an in depth analysis of the structure of relatively normal lattices. A featured result is a purely lattice-theoretic generalization of Conrad'sFinite Basis Theorem for lattice-ordered groups.Dedicated to Paul Conrad on his seventieth birthdayPresented by R. McKenzie.     

A proof of Lyndon's finite basis theorem

A new proof is given of the theorem, originally proved by R.C. Lyndon, that any two element algebra of finite similarity type has a finite basis for its equations. We also provide a new proof of a result of W. Taylor that any equational class generated by a two element algebraic system contains only a finite number of subdirectly irreducible members, each of which is finite. The original proofs of these two theorems relied on E.L. Post's classification of the two element algebraic systems. Our paper uses instead some recent results from universal algebra.     

Congruence meet-semidistributive locally finite varieties and a finite basis theorem

We provide several conditions that, among locally finite varieties, characterize congruence meet-semidistributivity and we use these conditions to give a new proof of a finite basis theorem published by Baker, McNulty, and Wang in 2004. This finite basis theorem extends Willard’s Finite Basis Theorem.     

A structure theorem for finite fields

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive properties in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev polynomials and some formulas with a number-theoretic flavor. This paper is an abridged version of two articles by the author.     

The Tarski irredundant basis theorem and the finite soluble groups

Denote by and , respectively, the smallest and the largest cardinality of a minimal generating set of a finite group G. The Tarski irredundant basis theorem implies that for every k with there exist a minimal generating set , an index and in G such that is again a minimal generating set of G. In this case we say that is an immediate descendant of ω. There are several examples of minimal generating sets of cardinality smaller than which have no immediate descendant and so it appears an interesting problem to investigate under which conditions an immediate descendant exists. In this paper we discuss this problem in the case of finite soluble groups.     

The parameterized local deduction theorem for quasivarieties of algebras and its application

Let be an algebraic type. To each classK of -algebras a consequence relation _K defined on the set of -equations is assigned. Some weak forms of the deduction theorem for _K and their algebraic counterparts are investigated. The (relative) congruence extension property (CEP) and its variants are discussed.CEP is shown to be equivalent to a parameter-free form of the deduction theorem for the consequence _K .CEP has a strong impact on the structure ofK: for many quasivarietiesK,CEP implies thatK is actually a variety. This phenomenon is thoroughly discussed in Section 5. We also discuss first-order definability of relative principal congruences. This property is equivalent to the fact that the deduction theorem for _K is determined by a finite family of finite sets of equations. The following quasivarietal generalization of McKenzie's [26] finite basis theorem is proved:LetK be quasivariety of algebras of finite type in which the principalK-congruences are definable. ThenK is finitely axiomatizable iff either the classK _FSI (of all relatively finitely subdirectly irreducible members ofK) or the class K_SI (of all relatively subdirectly irreducible members ofK) is strictly elementary.Applications of the theory to Heyting, interior, Sugihara, and ukasiewicz algebras are provided.Presented by R. McKenzie.The paper was presented in a talk given to the Conference on Algebraic Logic, Budapest, August 1988.     

A density theorem for matrix-valued radial basis functions

Recently a new class of customized radial basis functions (RBFs) was introduced. We revisit this class of RBFs and derive a density result guaranteeing that any sufficiently smooth divergence-free function can be approximated arbitrarily closely by a linear combination of members of this class. This result has potential applications to numerically solving differential equations, such as fluid flows, whose solution is divergence free. AMS subject classification 41Axx, 41A30, 41A35, 41A60Svenja Lowitzsch: The results are part of the authorss dissertation written at Texas A&M University, College Station, TX 77843, USA.     

Subquasivarieties of implicative locally‐finite quasivarieties

A quasivariety is said to be implicative if it is generated by a class of algebras with equationally‐definable implication of equalities. Implicative finitely‐generated quasivarieties appear naturally within logic, for instance, as equivalent quasivarieties of Gentzen‐style calculi for finitely‐valued propositional logics with equality determinant (cf. [17], [18, Subsection 7.5] and Section A). Furthermore, any discriminator quasivariety is implicative. We prove that, for any implicative locally‐finite quasivariety ? and any skeleton S of the class of all finite ?‐simple members of ?, the image of the first component of a natural Galois connection between the dual poset of subquasivarieties of ? and the poset of all sets of finite subsets of S is the closure system of all U_S‐ideals of the poset 〈S, ?〉, where ? is the embeddability relation and U_S is the up‐set on S constituted by all members of S having a one‐element subalgebra, with closure basis determined by the sets of all principal and non‐empty finitely‐generated up‐sets on S. It is also shown that the first component of the Galois connection under consideration is injective if and only if, for each finite sequence

     

A Beckman-Quarles type theorem for finite desarguesian planes

The characterization theorem given in [2] for Lorentz transformations of the ² is carried over to the case of finite planes.Dedicated to G. Pickert on the occasion of his 65. birthday.     

A canonical structure theorem for finite joining-rank maps

A numerical isomorphism invariant,joining-rank, was introduced in [1] as a quantitative generalization of Rudolph’s property of minimal selfjoinings. Therein, a structure theory was developed for those transformationsT whose joining-rank, jr (T), is finite. Here, we sharpen the theorem and show it to be canonical: If jr (T)<∞ then there is a unique triple 〈e, p, S〉 wheree andp are natural numbers andS is a map with minimal self-joinings, such thatT is ane-point extension ofS ^P. Furthermore, the producte·p equals the joining-rank ofT. This theorem applies to any finite-rank mixing map, since for such maps the rank dominates the joining-rank. Another corollary is that any rank-1 transformation which is partial-mixing has minimal self-joinings. This partially answers a question of [3]. Partially supported by a National Science Foundation Postdoctoral Research Fellowship.     

Decidability of finite quasivarieties generated by certain transformation semigroups

No Abstract. Received January 2, 2000; accepted in final form August 28, 2000.     

A Hall-Higman-Shult type theorem for arbitrary finite groups

We shall extend a fixed point theorem of Shult to arbitrary finite groups. This will have applications to the study of group automorphisms.