2000 character limit reached
Bhargava factorials and irreducibility of integer-valued polynomials
Published 27 Sep 2021 in math.AC | (2109.12867v1)
Abstract: The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of a polynomial. In this article, we make Bhargava factorials our main tool to check the irreducibility of a given polynomial $f \in \mathrm{Int}(S,\Z ))$. We also generalize our results to arbitrary subsets of a Dedekind domain.
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.