Related papers: On the Ring of Integer-valued Quasi-polynomials

We review the definition of D-rings introduced by H. Gunji & D. L. MacQuillan. We provide an alternative characterization for such rings that allows us to give an elementary proof of that a ring of algebraic integers is a D-ring. Moreover,…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

This book is a rigorous and conceptually oriented introduction to ring theory. The emphasis is on structural understanding rather than encyclopedic coverage: rings are studied through ideals, homomorphisms, quotients, and universal…

Let $D$ be a domain with fraction field $K$, and let $M_n(D)$ be the ring of $n \times n$ matrices with entries in $D$. The ring of integer-valued polynomials on the matrix ring $M_n(D)$, denoted ${\rm Int}_K(M_n(D))$, consists of those…

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…

Given a ring object $A$ in a symmetric monoidal category, we investigate what it means for the extension $\mathbb{1}\rightarrow A$ to be (quasi-)Galois. In particular, we define splitting ring extensions and examine how they occur.…

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…

The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a…

In this paper, we consider graded near-rings over a monoid $G$ as a generalizations of graded rings over groups. We introduce certain innovative graded prime ideals and study some of its basic properties over graded near-rings.