Searcharxiv⌕ Search

arXiv subjects

Victor J. W. Guo

Publications and source records attributed to Victor J. W. Guo.

At least 55 records · Page 3Linked to original sources
arXiv2017

Proof of Sun's conjectures on integer-valued polynomials

Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to prove that certain rational sums involving even powers of those polynomials are integers whenever they are evaluated at integers. This confirms two conjectures of Z.-W. Sun. We also conjecture that many of these results have neat $q$-analogues.

math.NT↗
arXiv2017

A recursive algorithm for trees and forests

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\{1,2,\ldots,n\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.

math.CO↗
arXiv2016

Proof of a recent conjecture of Z.-W. Sun

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*} \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(-\frac{1}{4}\right)^2 &\equiv \begin{cases} 2(-1)^{\frac{p-1}{4}}x,&\text{if $p=x^2+y^2$ with $x\equiv 1\pmod{4}$,} 0,&\text{if $p\equiv 3\pmod{4}$,} \end{cases} [5pt] \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(-\frac{1}{6}\right)^2 &\equiv 0, \quad\text{if $p>3$,} [5pt] \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(\frac{1}{4}\right)^2 &\equiv \begin{cases} 0,&\text{if $p\equiv 1\pmod{4}$,} (-1)^{\frac{p+1}{4}}{\frac{p-1}{2}\choose \frac{p-3}{4}},&\text{if $p\equiv 3\pmod{4}$.} \end{cases} \sum_{k=0}^{p-1}\frac{2k\choose k}{4^k} d_k\left(\frac{1}{6}\right)^2 &\equiv 0, \quad\text{if $p>5$.} \end{align*} The $p\equiv 3\pmod{4}$ case of the first one confirms a conjecture of Z.-W. Sun, while the second one confirms a special case of another conjecture of Z.-W. Sun.

math.NT↗
arXiv2015

Proof of a conjecture involving Sun polynomials

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x) \in\mathbb{Z}[x],\quad\text{and}\\ &\sum_{k=0}^{n-1}(8k^2+12k+5)g_k(-1)\equiv 0\pmod{n}. \end{align*} The first one confirms a recent conjecture of Z.-W. Sun, while the second one partially answers another conjecture of Z.-W. Sun. We give three different proofs of the former. One of them depends on the following congruence: $$ {m+n-2\choose m-1}{n\choose m}{2n\choose n}\equiv 0\pmod{m+n}\quad\text{for $m,n\geqslant 1$.} $$

math.NT↗
arXiv2015

Proof of a congruence on sums of powers of $q$-binomial coefficients

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 $[n]=\frac{1-q^n}{1-q}$, $[n]!=[n][n-1]\cdots[1]$, and ${a\brack b}=\prod_{k=1}^b\frac{1-q^{a-k+1}}{1-q^k}$. The $a_1=\cdots=a_m$ case confirms a recent conjecture of Z.-W. Sun. We also show that, if $p>\max\{a,b\}$ is a prime, then \begin{align*} \frac{[a+b+1]!}{[a]![b]!}\sum_{h=0}^{p-1}q^h{h\brack a}{h\brack b} \equiv (-1)^{a-b} q^{ab-{a\choose 2}-{b\choose 2}}[p]\pmod{[p]^2}. \end{align*}

math.NT↗
arXiv2015

Proof of a conjecture of Z.-W. Sun on the divisibility of a triple sum

The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive integer $n$ and odd prime $p$, there hold \begin{align*} \sum_{k=0}^{n-1}(2k+1)R_k^2 &\equiv 0 \pmod{n}, \\ \sum_{k=0}^{p-1}(2k+1)R_k^2 &\equiv 4p(-1)^{\frac{p-1}{2}} -p^2 \pmod{p^3}, \\ 9\sum_{k=0}^{n-1}(2k+1)W_k^2 &\equiv 0 \pmod{n}, \\ \sum_{k=0}^{p-1}(2k+1)W_k^2 &\equiv 12p(-1)^{\frac{p-1}{2}}-17p^2 \pmod{p^3}, \quad\text{if $p>3$.} \end{align*} The first two congruences were originally conjectured by Z.-W. Sun. Our proof is based on the multi-variable Zeilberger algorithm and the following observation: $$ {2n\choose n}{n\choose k}{m\choose k}{k\choose m-n}\equiv 0\pmod{{2k\choose k}{2m-2k\choose m-k}}, $$ where $0\leqslant k\leqslant n\leqslant m \leqslant 2n$.

math.NT↗
arXiv2014

On the divisibility of sums involving powers of multi-variable Schmidt polynomials

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients in the polynomial $$ \sum_{k=0}^{n-1}\varepsilon^k(2k+1) S_k^{(r)}(x_0,\ldots,x_k)^m $$ are multiples of $n$. This generalizes a recent result of Pan on the divisibility of sums of Apéry polynomials.

math.NT↗
arXiv2014

Proof of some conjectures of Z.-W. Sun on the divisibility of certain double-sums

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1)^2$. In this paper we mainly prove that \begin{align*} 4\sum_{k=0}^{n-1}kS_k\equiv \sum_{k=0}^{n-1}s_k\equiv \sum_{k=0}^{n-1}S_k^{+}\equiv 0\pmod{n^2}\quad\text{for $n\geqslant 1$}, \end{align*} by establishing some binomial coefficient identities, such as \begin{align*} 4\sum_{k=0}^{n-1}kS_k=n^2\sum_{k=0}^{n-1}\frac{1}{k+1}{2k\choose k}(6k{n-1\choose k}^2+{n-1\choose k}{n-1\choose k+1}). \end{align*} This confirms several recent conjectures of Z.-W. Sun.

math.NT↗
arXiv2014

Some congruences involving powers of Delannoy polynomials

The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3 &\equiv p\left(\frac{-4x-3}{p}\right) \pmod{p^2}, \\ \sum_{k=0}^{p-1}(2k+1)D_k(x)^4 &\equiv p \pmod{p^2}, \\ \sum_{k=0}^{p-1}(-1)^k(2k+1)D_k(x)^3 &\equiv p\left(\frac{4x+1}{p}\right) \pmod{p^2}, \end{align*} where $\big(\frac{\cdot}{p}\big)$ denotes the Legendre symbol. The first two congruences confirm a conjecture of Z.-W. Sun [Sci. China 57 (2014), 1375--1400]. The third congruence confirms a special case of another conjecture of Z.-W. Sun [J. Number Theory 132 (2012), 2673--2699]. We also prove that, for any integer $x$ and odd prime $p$, there holds \begin{align*} \sum_{k=0}^{p-1}(-1)^k(2k+1)D_k(x)^4 &\equiv p\sum_{k=0}^{\frac{p-1}{2}} (-1)^k {2k\choose k}^2(x^2+x)^k(2x+1)^{2k} \pmod{p^2}, \end{align*} and conjecture that it still holds modulo $p^3$.

math.NT↗
arXiv2014

Some q-analogues of (super)congruences of Beukers, Van Hamme and Rodriguez-Villegas

For any odd prime p we obtain q-analogues of Van Hamme's supercongruence: $$ \sum_{k=0}^{\frac{p-1}{2}}{2k\choose k}^3\frac{1}{64^k} \equiv 0 \pmod{p^2} \quad\text{for}\quad p\equiv 3\pmod 4, $$ and Rodriguez-Villegas' Beukers-like supercongruences involving products of three binomial coefficients. For example, we prove that \begin{align*} \sum_{k=0}^{\frac{p-1}{2}} {2k\brack k}_{q^2}^3 \frac{q^{2k}}{(-q^2;q^2)_k^2 (-q;q)_{2k}^2} &\equiv 0\pmod{[p]^2} \quad\text{for}\quad p\equiv 3\pmod 4, \\ \sum_{k=0}^{\frac{p-1}{2}}{2k\brack k}_{q^3}\frac{(q;q^3)_k (q^{2};q^3)_{k} q^{3k} }{ (q^{6};q^{6})_k^2 } &\equiv 0 \pmod{[p]^2}\quad\text{for}\quad p\equiv 2\pmod{3}, \end{align*} where $[p]=1+q+\cdots+q^{p-1}$, $(a;q)_n=(1-a)(1-aq)\cdots(1-aq^{n-1})$, and ${n\brack k}_q$ denotes the q-binomial coefficient. Actually, our results give q-analogues of Z.-H. Sun's and Z.-W. Sun's generalizations of the above Beukers-like supercongruences. Our proof uses the theory of basic hypergeometric series including a new q-Clausen-type summation formula.

math.NT↗
arXiv2014

Some q-analogues of supercongruences of Rodriguez-Villegas

We study different q-analogues and generalizations of the ex-conjectures of Rodriguez-Villegas. For example, for any odd prime p, we show that the known congruence \sum_{k=0}^{p-1}\frac{{2k\choose k}^2}{16^k} \equiv (-1)^{\frac{p-1}{2}}\pmod{p^2} has the following two nice q-analogues with [p]=1+q+...+q^{p-1}: \sum_{k=0}^{p-1}\frac{(q;q^2)_k^2}{(q^2;q^2)_k^2}q^{(1+\varepsilon)k} &\equiv (-1)^{\frac{p-1}{2}}q^{\frac{(p^2-1)\varepsilon}{4}}\pmod{[p]^2}, where (a;q)_0=1, (a;q)_n=(1-a)(1-aq)...(1-aq^{n-1}) for n=1,2,..., and \varepsilon=\pm1. Several related conjectures are also proposed.

math.NT↗
arXiv2014

Proof of a conjecture of Mircea Merca

We prove that, for any prime $p$ and positive integer $r$ with $p^r>2$, the number of multinomial coefficients such that $$ {k\choose k_1,k_2,\ldots,k_n}=p^r,\quad \text{and}\quad k_1+2k_2+\cdots+nk_n=n, $$ is given by $$ δ_{p^r,\,k}\left(\left\lfloor\frac{n-1}{p^r-1}\right\rfloor -δ_{0,\,n\bmod p^r} \right), $$ where $δ_{i,j}$ is the Kronecker delta and $\lfloor x\rfloor$ stands for the largest integer not exceeding $x$. This confirms a recent conjecture of Mircea Merca.

math.NT↗
arXiv2014

Proof of a supercongruence conjectured by Z.-H. Sun

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv 0\pmod{n{2n\choose n}}, \\ \sum_{k=0}^{p-1}\frac{3k+1}{(-16)^k} {2k\choose k} f_k &\equiv p (-1)^{\frac{p-1}{2}} \pmod{p^3}. \end{align*} where $n>1$ and $p$ is an odd prime. The second congruence modulo $p^2$ confirms a recent conjecture of Z.-H. Sun. We also show that, if $p$ is a prime of the form $4k+3$, then $$ \sum_{k=0}^{p-1}\frac{{2k\choose k} f_k}{(-16)^k} \equiv 0 \pmod p, $$ which confirms a special case of another conjecture of Z.-H. Sun.

math.NT↗
arXiv2014

Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun

For all positive integers n, we prove the following divisibility properties: $$(2n+3){2n\choose n} | 3{6n\choose 3n}{3n\choose n}, and (10n+3){3n\choose n} | 21{15n\choose 5n} {5n\choose n}.$$ This confirms two recent conjectures of Z.-W. Sun. Some similar divisibility properties are given. Moreover, we show that, for all positive integers m and n, the product $am{am+bm-1\choose am}{an+bn\choose an}$ is divisible by m+n. In fact, the latter result can be generalized to the q-binomial coefficients and q-integers case, which generalizes the positivity of q-Catalan numbers. We also propose several related conjectures.

math.NT↗
arXiv2013

Some congruences related to the q-Fermat quotients

We give q-analogues of the following congruences by Z.-W. Sun: \sum_{k=1}^{p-1}\frac{D_k}{k} \equiv -\frac{2^{p-1}-1}{p} \pmod p,\\ \sum_{k=1}^{p-1}\frac{H_k}{k 2^k}\equiv 0 \pmod{p},\quad p\geqslant 5, where p is a prime, D_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k} are the Delannoy numbers, and H_n=\sum_{k=1}^n\frac{1}{k} are the harmonic numbers. We also prove that, for any positive integer m and prime p>m+1, \sum_{1\leqslant k_1\leqslant \cdots \leqslant k_m\leqslant p-1}\frac{1}{k_1\cdots k_m 2^{k_m}} \equiv\frac{1}{2}\sum_{k=1}^{p-1}\frac{(-1)^{k-1}}{k^m} \pmod p, which is a multiple generalization of Kohnen's congruence. Furthermore, a q-analogue of this congruence is established.

math.NT↗
arXiv2013

Some divisibility properties of binomial and q-binomial coefficients

We first prove that if $a$ has a prime factor not dividing $b$ then there are infinitely many positive integers $n$ such that $\binom {an+bn} {an}$ is not divisible by $bn+1$. This confirms a recent conjecture of Z.-W. Sun. Moreover, we provide some new divisibility properties of binomial coefficients: for example, we prove that $\binom {12n} {3n}$ and $\binom {12n} {4n}$ are divisible by $6n-1$, and that $\binom {330n} {88n}$ is divisible by $66n-1$, for all positive integers $n$. As we show, the latter results are in fact consequences of divisibility and positivity results for quotients of $q$-binomial coefficients by $q$-integers, generalizing the positivity of $q$-Catalan numbers. We also put forward several related conjectures.

math.NT↗
arXiv2013

A quadratic formula for basic hypergeometric series related to Askey-Wilson polynomials

We prove a general quadratic formula for basic hypergeometric series, from which simple proofs of several recent determinant and Pfaffian formulas are obtained. A special case of the quadratic formula is actually related to a Gram determinant formula for Askey-Wilson polynomials. We also show how to derive a recent double-sum formula for the moments of Askey-Wilson polynomials from Newton's interpolation formula.

math.CO↗