Related papers: On a sequence of polynomials with hypothetically i…
Szmytkowski derived a certain integral with Gegenbauer polynomials. A natural generalization is to derive lookalike integrals with Jacobi polynomials. Six methods are treated to derive the first integral. The first method should be enough…
The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…
We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…
We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…
In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…
This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.
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\…
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…
We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…
The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].