Polynomial maps on the monoid of words
classification
🧮 math.GR
keywords
mapsmathcalmonoidpolynomialmathbbspacewordsalphabet
read the original abstract
We study the space $\mathcal{P}(S,\mathbb{C})$ of polynomial maps $f:S\to \mathbb{C}$, where $S=\mathcal{A}^*$ is the monoid of words based on a finite alphabet $\mathcal{A}$ under concatenation. To motivate the study of this space, we first briefly visit the theory of polynomial and semipolynomial maps defined on an arbitrary monoid, with range a commutative group. Our results are motivated by previous work of Shulman.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.