Submonoids of the formal power series

From MaRDI portal
Publication:4604231

zbMATH Open1382.16043arXiv1510.05984MaRDI QIDQ4604231FDOQ4604231


Authors: E. Enochs, Overtoun M. G. Jenda, Furuzan Ozbek Edit this on Wikidata


Publication date: 23 February 2018

Abstract: Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x Rx consisting of formal power series with zero constant term. This subset forms a monoid with the composition operation on series. We classify the sets T of strictly positive integers for which the set of formal power series, Rx^T={all formal power series consisting of terms whose power is from T}, forms a monoid with composition as the operation. We prove that in order for Rx^T to be a monoid, T itself has to be a submonoid of N. Unfortunately, this condition is not enough to guarantee the desired result. But if a monoid is strongly closed, then we get the desired result. We also consider an analogous problem for power series in several variables.


Full work available at URL: https://arxiv.org/abs/1510.05984




Recommendations









This page was built for publication: Submonoids of the formal power series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604231)