On irreducible algebraic sets over linearly ordered semilattices II

2017/03/29 by Аrtеm N. Shevlyakov, Shevlyakov, Artem N.
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Optimization Algorithms Research #FOS: Mathematics #Polynomial and algebraic computation #Rings and Algebras (math.RA)

paper · pdf · doi:10.48550/arxiv.1703.09904

openalex publication_date 2017/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Equations over linearly ordered semilattices are studied. For any equation t(X)=s(X) we find irreducible components of its solution set and compute the average number of irreducible components of all equations in n variables.

Related

• On irreducible algebraic sets over linearly ordered semilattices
• Algebraic geometry over free semilattice
• Equationally extremal semilattices
• The algebraicity of ill-distributed sets
• Solutions of polynomial equation over \mathbbF_p and new bounds of additive energy