Related papers: Characterization of Polynomials as solutions of ce…
We characterize the rational solutions to a KdV-like equation which are generated from polynomial solutions to the corresponding generalized bilinear equation. We use a particular class of polynomials satisfying a quadratic difference…
The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…
We present an elementary identity for the cyclotomic polynomials $\Phi_n(X)$ which reflects a kind of multiplicative property of $\Phi_n(X)$ as a function of $n$, and we explore its connections with the properties of other arithmetical…
Let $f(t)=\sum_{n=0}^{+\infty}\frac{C_{f,n}}{n!}t^n$ be an analytic function at $0$, and let $C_{f, n}(x)=\sum_{k=0}^{n}\binom{n}{k}C_{f,k} x^{n-k}$ be the sequence of Appell polynomials, referred to as $\textit{C-polynomials associated to…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
We study seminormalization of affine complex varieties. We show that polynomials on the seminormalization correspond to the rational functions which are continuous for the Euclidean topology. We further study this type of functions which…
Solutions of nonlinear functional equations are generally not expressed as a finite number of combinations and compositions of elementary and known special functions. One of the approaches to study them is, firstly, to find formal solutions…
We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
In 1922 Ritt described polynomial solutions of the functional equation P(f)=Q(g). In this paper we describe solutions of the equation above in the case when P,Q are polynomials while f,g are allowed to be arbitrary entire functions. In…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
We study piecewise polynomial functions $\gamma_k(c)$ that appear in the asymptotics of averages of the divisor sum in short intervals. Specifically, we express these polynomials as the inverse Fourier transform of a Hankel determinant that…
Generalized Jacobi polynomials are orthogonal polynomials related to a weight function which is smooth and positive on the whole interval of orthogonality up to a finite number of points, where algebraic singularities occur. The influence…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
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…
Here we introduce a way to construct generalized trigonometric functions associated with any complex polynomials, and the well known trigonometric functions can be seen to associate with polynomial $x^2-1$. We will show that those…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…