Related papers: Polynomials whose reducibility is related to the G…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…
We study a natural analogue of Collatz's Conjecture for polynomials over $\mathbb{F}_2$.
By means of a dynamical process we provide a characterization of the Goldbach Conjecture in an infinite set of even numbers that depends on time.
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…
We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to…
The aim of this paper is to further study some properties and identities on the degenerate Fubini and the degenerate Bell polynomials which are degenerate versions of the Fubini and the Bell polynomials, respectively. Especially, we find…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
Given integers $\ell > m >0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $\mu$ is a zero of $X_n$ if and only if the triple $(\mu,\mu+m,\mu+\ell)$ satisfies $x^n + y^n = z^n$. It is shown that the…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
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…
In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.
The golden binomials, introduced in the golden quantum calculus, have expansion determined by Fibonomial coefficients and the set of simple zeros given by powers of Golden ratio. We show that these golden binomials are equivalent to Carlitz…
In a recent paper by the authors, a bounded version of Goellnitz's (big) partition theorem was established. Here we show among other things how this theorem leads to nontrivial new polynomial analogues of certain fundamental identities of…