Related papers: p^q-Catalan Numbers and Squarefree Binomial Coeffi…
In this paper, using the well-known Karlsson-Minton formula, we mainly establish two divisibility results concerning truncated hypergeometric series. Let $n>2$ and $q>0$ be integers with $2\mid n$ or $2\nmid q$. We show that…
In recent years, several efforts have focused on identifying new families of scattered polynomials. Currently, only three families in $\mathbb{F}_{q^n}[X]$ are known to exist for infinitely many values of $n$ and $q$: (i) pseudoregulus-type…
The moments of the Lucas polynomials and of the Chebyshev polynomials of the first kind are (multiples of) central binomial coefficients and the moments of the Fibonacci polynomials and of the Chebyshev polynomials of the second kind are…
We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…
The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…
This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…
It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…
Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…
The solution to the general univariate polynomial equation has been sought for centuries. It is well known there is no general solution in radicals for degrees five and above. The hyper-Catalan numbers $C[m_2,m_3,m_4,\ldots]$ count the ways…
Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…
This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…
We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…
To begin, we find certain formulas $Q(k,\alpha)= G_1^k(\alpha) G_2^k(\alpha)$, for $k = -1, 0, 1,...,9$. These yield that part of the total separability probability, $P(k,\alpha)$, for generalized (real, complex, quaternionic,\ldots)…
We determine the squarefree part of the scalar factor that arises when the quartic invariant of the generic binary form $F$ of odd degree $2n+1$ is expressed as the discriminant of the unique quadratic covariant $(F,F)_{2n}$. This…
The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$.…
For an odd positive integer $n\ge 5$, assuming the truth of the $abc$ conjecture, we show that for a positive proportion of pairs $(a,b)$ of integers the trinomials of the form $t^n+at+b (a,b\in \mathbb Z)$ are irreducible and their…
This note presents new results for the squarefree value sets of quartic polynomials over the integers.
A Catalan word of length $n$ that avoids the pattern $(\geq, \geq)$ is a sequence $w=w_1\cdots w_n$ with $w_1=0$ and $0\leq w_i\leq w_{i-1}+1$ for all $i$, while ensuring that no subsequence satisfies $w_i \geq w_{i+1}\geq w_{i+2}$ for…
Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb…
Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…