Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On irreducible algebraic sets over linearly ordered semilattices

On irreducible algebraic sets over linearly ordered semilattices Abstract Equations over linearly ordered semilattices are studied. For any equation t ⁢ ( X ) = s ⁢ ( X ) ${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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

On irreducible algebraic sets over linearly ordered semilattices

Groups Complexity Cryptology , Volume 8 (2) – Nov 1, 2016

Loading next page...
 
/lp/de-gruyter/on-irreducible-algebraic-sets-over-linearly-ordered-semilattices-CGpKQVnJDR
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2016-0014
Publisher site
See Article on Publisher Site

Abstract

Abstract Equations over linearly ordered semilattices are studied. For any equation t ⁢ ( X ) = s ⁢ ( X ) ${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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2016

References