Pseudo-free families of computational universal algebras

Let Ω be a finite set of finitary operation symbols. We initiate the study of (weakly) pseudo-free families of computational Ω-algebras in arbitrary varieties of Ω-algebras. A family (Hd | d ∈ D) of computational Ω-algebras (where D ⊆ {0, 1}*) is called polynomially bounded (resp., having exponential size) if there exists a polynomial η such that for all d ∈ D, the length of any representation of every h ∈ Hd is at most $\eta (|d|)\left( \text{ resp}\text{., }\left| {{H}_{d}} \right|\le {{2}^{\eta (|d|)}} \right).$ First, we prove the following trichotomy: (i) if Ω consists of nullary operation symbols only, then there exists a polynomially bounded pseudo-free family; (ii) if Ω = Ω0 ∪ {ω}, where Ω0 consists of nullary operation symbols and the arity of ω is 1, then there exist an exponential-size pseudo-free family and a polynomially bounded weakly pseudo-free family; (iii) in all other cases, the existence of polynomially bounded weakly pseudo-free families implies the existence of collision-resistant families of hash functions. In this trichotomy, (weak) pseudo-freeness is meant in the variety of all Ω-algebras. Second, assuming the existence of collision-resistant families of hash functions, we construct a polynomially bounded weakly pseudo-free family and an exponential-size pseudo-free family in the variety of all m-ary groupoids, where m is an arbitrary positive integer.

Mapping Extension of an Algebra

A new construction of algebras called a mapping extension of an algebra is here introduced. The construction yields a generalization of some classical constructions such as the nilpotent extension of an algebra, inflation of a semigroup but also the square extension construction introduced recently for idempotent groupoids. The mapping extension construction is defined for algebras of any fixed type, however nullary operation symbols are here not admitted. It is based on the notion of a retraction and some system of mappings. A mapping extension of a given algebra is constructed as a counterimage algebra by a specially defined retraction. Varieties of algebras satisfying an identity φ(x) ≈ x for a term φ not being a variable (such as varieties of lattices, Boolean algebras, groups and rings) are especially interesting because for such a variety [Formula: see text], all mapping extensions by φ of algebras from [Formula: see text] form an equational class. In the last section, combinatorial properties of the mapping extension construction are considered.

The Ascending and Descending Varietal Chains of a Variety

Let F be a variety (equational class) of algebras. For n ≧ 0, Vn is the variety generated by the F-free algebra on n free generators while Vn is the variety of all algebras satisfying each identity of V which has no more than n variables. (Equivalently, Vn is the class of all algebras, , such that every n-generated subalgebra of is in V.) Note that unless nullary operation symbols are specified by the similarity type of V, V0 is the variety of all one element algebras while V° is the variety of all algebras.

A note on commutative Baer rings

The class of commutative rings known as Baer rings was first discussed by J. Kist [4], where many interesting properties of these rings were established. Not necessarily commutative Baer rings had previously been studied by I. Kaplansky [3], and by R. Baer himself [1]. In this note we show that commutative Baer rings, which generalize Boolean rings and p-rings, satisfy the Birkhoff conditions for a variety. Next we give a set of equations characterising this variety involving + and * as binary operations, – and as unary operations, and 0 as nullary operation. Finally we describe Baer-subdirectly irreducible commutative Baer rings and state the appropriate representation theorem.

On Single Equational-Axiom Systems for Abelian Groups

It is a fascinating problem in the axiomatics of any mathematical system to reduce the number of axioms, the number of variables used in each axiom, the length of the various identities, the number of concepts involved in the system etc. to a minimum. In other words, one is interested finding systems which are apparently ‘of different structures’ but which represent the same reality. Sheffer's stroke operation and. Byrne's brief formulations of Boolean algebras [1], Sholander's characterization of distributive lattices [7] and Sorkin's famous problem of characterizing lattices by means of two identities are all in the same spirit. In groups, when defined as usual, we demand a binary, unary and a nullary operation respectively, say, a, b →a·b; a→a−1; the existence of a unit element). However, as G. Rabinow first proved in [6], groups can be made as a subvariety of groupoids (mathematical systems with just one binary operation) with the operation * where a * b is the right division, ab−1. [8], M. Sholander proved the striking result that a mathematical system closed under a binary operation * and satisfying the identity S: x * ((x *z) * (y *z)) = y is an abelian group. Yet another identity, already known in the literature, characterizing abelian groups is HN: x * ((z * y) * (z * a;)) = y which is due to G. Higman and B. H. Neumann ([3], [4])*. As can be seen both the identities are of length six and both of them belong to the same ‘bracketting scheme’ or ‘bracket type’.