Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the correspondinggraph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s and t are replaced by any term operations of A of the appropriate arity, the resulting identities hold in A. In this paper we characterize associative graph algebras, identities in associative graph algebras and hyperidentities in associative graph algebras.
Denecke and Reichel have described a method of studying the lattice of all varieties of a given type by using monoids of hypersubstitutions. In this paper we develop a Galois correspondence between monoids of hypersubstitutions of a given type and lattices of subvarieties of a given variety of that type. We then apply the results obtained to the lattice of varieties of bands (idempotent semigroups), and study the complete sublattices of this lattice obtained through the Galois correspondence.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.