Discriminator or dual discriminator? (Q1771857)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Discriminator or dual discriminator? |
scientific article; zbMATH DE number 2158730
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discriminator or dual discriminator? |
scientific article; zbMATH DE number 2158730 |
Statements
Discriminator or dual discriminator? (English)
0 references
19 April 2005
0 references
A semidiscriminator on a set \(S\) is a ternary function \(f\) such that for every pair \((a,c)\) of elements of \(S\), \(f\) is either the discriminator for both pairs \((a,c)\) and \((c,a)\), or it is the dual discriminator for both of these pairs. The author characterizes semidiscriminator varieties. In the general case a continuum of non-finitely based semidiscriminator subvarieties is presented. A graph-theoretical picture leads to a variety of groupoids connecting the left-zero and the right-zero semigroups. For this variety some open problems are presented.
0 references
finite basis
0 references
dual discriminator
0 references
semidiscriminator
0 references
variety
0 references
groupoid
0 references
colored graph
0 references