On irreducible algebraic sets over linearly ordered semilattices (Q338845): Difference between revisions

In the paper under review, the author defines a notion of an equation over a linearly ordered semilattice \(L_{l}\). A set \(Y\) is algebraic if it is the solution set of some system of equations over \(L_{l}\). Consider an equation \(t(X)=s(X)\) over \(L_{l}\), and let \(Y\) be the solution set of \(t(X)=s(X)\). Then \(Y\) can be decomposed into irreducible algebraic sets \(Y_{1}\), \dots, \(Y_{m}\) such that \(Y=\cup_{i=1}^{m}Y_{i}\) (the sets \(Y_{i}\) are called the irreducible components of \(Y\)). The author studies the properties of the irreducible components of the solution set \(Y\) of an equation \(t(X)=s(X)\). More precisely, he proves that the union of irreducible algebraic sets \(Y=\cup_{i=1}^{m}Y_{i}\) is redundant, i.e. the intersections \(\cap_{i \in I}Y_{i}\) (\(|I|<m\)) consists of many points. Moreover, for any equation \(t(X)=s(X)\) in \(n\) variables he counts the number \(m\) of irreducible components, and he also counts the average number of irreducible components of the solution sets of equations in \(n\) variables.