We discuss the role of additive polynomials and $p$-polynomials in the theory of valued fields of positive characteristic and in their model theory. We outline the basic properties of rings of additive polynomials and discuss properties of valued fields of positive characteristic as modules over such rings. We prove the existence of Frobenius-closed bases of algebraic function fields $F|K$ in one variable and deduce that $F/K$ is a free module over the ring of additive polynomials with coefficients in $K$. Finally, we prove that every minimal purely wild extension of a henselian valued field is generated by a $p$-polynomial.
The ring of integer-valued polynomials on an arbitrary integral domain is well-studied. In this paper we initiate and provide motivation for the study of integer-valued polynomials on commutative rings and modules. Several examples are computed, including the integer-valued polynomials over the ring $R[T_1,\ldots, T_n]/(T_1(T_1-r_1), \ldots, T_n(T_n-r_n))$ for any commutative ring $R$ and any elements $r_1, \ldots, r_n$ of $R$, as well as the integer-valued polynomials over the Nagata idealization $R(+)M$ of $M$ over $R$, where $M$ is an $R$-module such that every non-zerodivisor on $M$ is a n…
To study the question of whether every two-dimensional Prüfer domain possesses the stacked bases property, we consider the particular case of the Prüfer domains formed by integer-valued polynomials. The description of the spectrum of the rings of integer-valued polynomials on a subset of a rank-one valuation domain enables us to prove that they all possess the stacked bases property. We also consider integer-valued polynomials on rings of integers of number fields and we reduce in this case the study of the stacked bases property to questions concerning $2\times 2$-matrices.
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.
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove several properties.
Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose powers factor uniquely, and non-absolutely irreducible elements. We completely and constructively characterize the absolutely irreducible elements among split integer-valued polynomials. They correspond bijectively to finite sets, which we call \emph{balanced}, characterized by a combinatorial property regarding the distribution of their elements among residue…
Let $§$ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $§,$ denoted by Int$(§,R)$, is defined as the set of the polynomials of $\K[\x],$ which maps $§$ to $R$. In this article, we study the irreducibility of the polynomials of Int$(§,R)$ for the first time in the case when $R$ is a Unique Factorization Domain. We also show that our results remain valid when $R$ is a Dedekind domain or sometimes any domain.
In this paper, we address various aspects of divisibility by irreducibles in rings consisting of integer-valued polynomials. An integral domain is called atomic if every nonzero nonunit factors into irreducibles. Atomic domains that do not satisfy the ascending chain condition on principal ideals (ACCP) have proved to be elusive, and not many of them have been found since the first one was constructed by A. Grams in 1974. Here we exhibit the first class of atomic rings of integer-valued polynomials without the ACCP. An integral domain is called a finite factorization domain (FFD) if it is simu…
Let $R$ be a finite commutative ring with $1\ne 0$. The set $\mathcal{F}(R)$ of polynomial functions on $R$ is a finite commutative ring with pointwise operations. Its group of units $\mathcal{F}(R)^\times$ is just the set of all unit-valued polynomial functions, that is the set of polynomial functions which map $R$ into its group of units. We show that $\mathcal{P}_R(R[x]/(x^2))$ the group of polynomial permutations on the ring $R[x]/(x^2)$, consisting of permutations represented by polynomials over $R$, is embedded in a semidirect product of $\mathcal{F}(R)^\times$ by $\mathcal{P}(R)$ the gr…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$, of integer-valued polynomials on a principal ideal domain $D$ with quotient field $K$, we give an easy to verify graph-theoretic sufficient condition for an element to be absolutely irreducible and show a partial converse: the condition is necessary and sufficient for polynomials with square-free denominator.
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\ \forall\ a \in S \}.$ This article is an effort to study the irreducibility of integer-valued polynomials over arbitrary subsets of a unique factorization domain. We give a method to construct special kinds of sequences, which we call $d$-sequences. We then use these sequences to obtain a criteria for the irreducibility of the polynomials in $\mathrm{Int}(S,R).$…
We prove a necessary and sufficient criterion for the ring of integer-valued polynomials to behave well under localization. Then, we study how the Picard group of $\mathrm{Int}(D)$ and the quotient group $\mathcal{P}(D):=\mathrm{Pic}(\mathrm{Int}(D))/\mathrm{Pic}(D)$ behave in relation to Jaffard, weak Jaffard and pre-Jaffard families; in particular, we show that $\mathcal{P}(D)\simeq\bigoplus\mathcal{P}(T)$ when $T$ ranges in a Jaffard family of $D$, and study when similar isomorphisms hold when $T$ ranges in a pre-Jaffard family. In particular, we show that the previous isomorphism holds whe…
Let $D$ be a Dedekind domain with infinitely many maximal ideals, all of finite index, and $K$ its quotient field. Let $\operatorname{Int}(D) = \{f\in K[x] \mid f(D) \subseteq D\}$ be the ring of integer-valued polynomials on $D$. Given any finite multiset $\{k_1, \ldots, k_n\}$ of integers greater than $1$, we construct a polynomial in $\operatorname{Int}(D)$ which has exactly $n$ essentially different factorizations into irreducibles in $\operatorname{Int}(D)$, the lengths of these factorizations being $k_1$, \ldots, $k_n$. We also show that there is no transfer homomorphism from the multipl…
Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is irreducible in $R$ but for some $n>1$, $r^n$ has other factorizations distinct from $r^n = r \cdots r$, then $r$ is called non-absolutely irreducible. In this paper, we construct non-absolutely irreducible elements in the ring $\text{Int}(\mathbb{Z}) = \{f\in \mathbb{Q}[x] \mid f(\mathbb{Z}) \subseteq \mathbb{Z}\}$ of integer-valued polynomials. We also give general…
We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator polynomials of all different additive cyclic codes. A minimum distance lower bound for additive cyclic codes will also be provided using linear cyclic codes over $\mathbb{F}_p$. We classify all the symplectic self-dual, self-orthogonal, and nearly self-orthogonal additive cyclic codes over $\mathbb{F}_{p^2}$. Finally, we present ten record-breaking binary quantum …
In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive integer, $\mathbb{F}\subset \mathbb{C}$ is a field, $f_{i}, g_{i}\colon \mathbb{F}\to \mathbb{C}$ are additive functions and $p_i, q_i$ are positive integers for all $i=1, \ldots, n$. Using the theory of decomposable functions we describe the solutions as compositions of higher order derivations and field homomorphisms. In many cases we also give a tight uppe…
A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices, with sign patterns as an important special case. A number of corollaries and applications of this formula are given.
