These are sketchy lecture notes intended to show that the concepts of divisibility, prime elements and prime-decompositions are most efficiently treated in the framework of monoids. The results then apply both to the multiplicative monoid of the natural numbers and that of the monic polynomials over a field.</p
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the ...
We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. ...
Communicated by L. Márki In this paper we study the arithmetic of strongly primary monoids. Nu-meri...
the multiplicative monoids 1 + 4N0, 1 + pN0 for some prime number p, and 2N [ f1g. They are multipli...
We study the problem of learning an unknown function represented as an expression or a program over ...
This thesis treats combinatorial and topological properties of monoids with absorbing elements and t...
Abstract. Kleene's theorem on recognizable languages in free monoids is considered to be of emi...
Abstract. A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative i...
We extend both Dobbertin's characterization of primely generated regular refinement monoids and Pier...
Contains fulltext : 147272.pdf (preprint version ) (Open Access)19 p
A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative integers to...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
We study the problem of learning an unknown function represented as an expression or a program over ...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the ...
We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. ...
Communicated by L. Márki In this paper we study the arithmetic of strongly primary monoids. Nu-meri...
the multiplicative monoids 1 + 4N0, 1 + pN0 for some prime number p, and 2N [ f1g. They are multipli...
We study the problem of learning an unknown function represented as an expression or a program over ...
This thesis treats combinatorial and topological properties of monoids with absorbing elements and t...
Abstract. Kleene's theorem on recognizable languages in free monoids is considered to be of emi...
Abstract. A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative i...
We extend both Dobbertin's characterization of primely generated regular refinement monoids and Pier...
Contains fulltext : 147272.pdf (preprint version ) (Open Access)19 p
A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative integers to...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
We study the problem of learning an unknown function represented as an expression or a program over ...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
Research into the factorization properties of monoids has its roots in the study of the multiplicati...
AbstractA monoid presented by a single relation has elements ≠ 1 of finite order if and only if the ...
DOI
Add to ORKG