Gumm's theorem and the structure of minimal algebras
The author calls an algebra \(A\) 1-Abelian if for any binary polynomial \(f(x, y)\) and \(a, b, c, d\in A\), \(f(a, c)= f(a, d)\) implies \(f(b, c)= f(b, d)\). That is, 1-Abelian algebras are required to satisfy the term condition for binary polynomials only. The author proves the following stronger version of Gumm's Theorem. Theorem 1: For an algebra \(A\) the following conditions are equivalent: (1) \(A\) is Mal'tsev and 1-Abelian. (2) \(A\) is polynomially equivalent to a module over a ring. A minimal algebra is an algebra in which every unary polynomial is either constant or bijective. Theorem 2: Let \(A\) be a finite minimal algebra with more than 2 elements. Then every binary polynomial which depends on both arguments is a quasigroup operation and \(A\) is 1-Abelian. Theorems 1 and 2 lead to Pálfy's Theorem stating that a finite non-unary minimal algebra of at least 3 elements is polynomially equivalent to a finite vector space.
- On minimal Auslander-Gorenstein algebras and standardly stratified algebras
- The Gumm level equals the Alvin level in congruence distributive varieties
- Kumpera-Ruiz algebras in Goursat flags are optimal in small lengths
- On the minimal gershgorin domain
- An Easy Way to Minimal Algebras
- scientific article; zbMATH DE number 822095 (Why is no real title available?)
- The polynomial functions of certain algebras that are simple modulo their center
- Examples of minimal \(G\)-structures
This page was built for publication: Gumm's theorem and the structure of minimal algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344848)
