Related papers: Dembowski-Ostrom polynomials and Dickson polynomia…
The polynomial algebra is a deformed SU(2) algebra. Here, we use polynomial algebra as a method to solve a series of deformed oscillators. Meanwhile, we find a series of physics systems corresponding with polynomial algebra with different…
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…
This paper surveys recent developments in the sampling discretization of integral and uniform norms for functions in general finite-dimensional spaces. These results generalize the classical Marcinkiewicz-Zygmund inequalities for…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…
We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…
In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.
We show a method to construct isospectral deformations of classical orthogonal polynomials. The construction is based on confluent Darboux transformations, and it allows to construct Sturm-Liouville problems with polynomial eigenfunctions…
We introduce endomorphisms of special jacobians and show that they satisfy polynomial equations with all integer roots which we compute. The eigen-abelian varieties for these endomorphisms are generalizations of Prym-Tjurin varieties and…
This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…
Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…