Related papers: Some Lucas-type congruences for q-trinomial coeffi…

Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…

Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…

Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…

Let $p$ be a prime. In 1878 \'{E}. Lucas proved that the congruence $$ {p-1\choose k}\equiv (-1)^k\pmod{p}$$ holds for any nonnegative integer $k\in\{0,1,\ldots,p-1\}$. The converse statement was given in Problem 1494 of {\it Mathematics…

With the help of El Bachraoui's lemma, the creative microscoping method, and a new form of the Chinese remainder theorem for coprime polynomials, we prove a $q$-supercongruence for double series and a $q$-supercongruence for triple series…

We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.

Balancing numbers $n$ are originally defined as the solution of the Diophantine equation $1+2+\cdots+(n-1)=(n+1)+\cdots+(n+r)$, where $r$ is called the balancer corresponding to the balancing number $n$. By slightly modifying, $n$ is the…

We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

In this paper, we study some properties of the q-Appell polynomials, including the recurrence relations and the q-difference equations which extend some known calssical (q=1) results. We also provide the recurrence relations and the…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

We show that a confluent case of the big q-Jacobi polynomials P_n(x;a,b,c;q), which corresponds to a=b=-c, leads to a discrete orthogonality relation for imaginary values of the parameter a (outside of its commonly known domain 0<a<…

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type continued fraction formula, we proved that the corresponding expansions could be expressed by the polynomials counting permutations on…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Let l>=1 be an arbitrary odd integer and p,q and r primes. We show that there exist infinitely many ternary cyclotomic polynomials \Phi_{pqr}(x) with l^2+3l+5<= p<q<r such that the set of coefficients of each of them consists of the p…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

In this paper, we consider the new q-extension of Frobenius-Euler numbers and polynomials and we derive some interesting identities from the orthogonality type properties for the new q-extension of Frobenius-Euler polynomials. Finally we…