2000 character limit reached
The Polypermutation Group of an Associative Ring
Published 2 Jul 2017 in math.RA | (1707.00241v2)
Abstract: We study permutation polynomials through the device of the \emph{polypermutation group} of an associative ring $R$, denoted by ${\rm Pgr}(R)$. We derive some basic properties and compute the cardinality of ${\rm Pgr}(\mathbb{Z}/pk)$ when $p\geq k$. We use this computation to determine the structure of ${\rm Pgr}(\mathbb{Z}/p2)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.