Related papers: Explicit polynomial generators for the ring of qua…
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…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
Let f be a square-free polynomial in Fq[t][x] where Fq is a field of q elements. We view f as a polynomial in the variable x with coefficients in the ring Fq[t]. We study squarefree values of f in sparse subsets of Fq[t] which are given by…
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
We realize the free dendriform trialgebra on one generator, as well as several other examples of dendriform trialgebras, as sub-trialgebras of an algebra of noncommutative polynomials in infinitely many variables.
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 article is devoted to the study of several algebras which are related to symmetric functions, and which admit linear bases labelled by various combinatorial objects: permutations (free quasi-symmetric functions), standard Young…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
Given a square matrix with elements in the group-ring of a group, one can consider the sequence formed by the trace (in the sense of the group-ring) of its powers. We prove that the corresponding generating series is an algebraic…
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
The cyclic group labeled family of quasi-projection operators is used for investigation of decomposition of functions with respect to the cyclic group of order n . Series of new identities thus arising are demonstrated and new perspectives…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…
We study the ring of quasisymmetric polynomials in $n$ anticommuting (fermionic) variables. Let $R_n$ denote the polynomials in $n$ anticommuting variables. The main results of this paper show the following interesting facts about…
The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…
We study the variance of sums of the indicator function of square-full polynomials in both arithmetic progressions and short intervals. Our work is in the context of the ring $F_{q}[T]$ of polynomials over a finite field $F_{q}$ of $q$…
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…