scispace - formally typeset
Search or ask a question

Showing papers by "Zhi-Wei Sun published in 2005"


Posted Content
Hao Pan1, Zhi-Wei Sun1
TL;DR: In this article, it was shown that if l,m,n$ are nonnegative integers and m,m+n-3k-l are not negative integers, then the Catalan number is a nonnegative integer.
Abstract: By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this identity, for $d,r=0,1,2,...$ we construct explicit $F(d,r)$ and $G(d,r)$ such that for any prime $p>\max\{d,r\}$ we have \sum_{k=1}^{p-1}k^r C_{k+d}\equiv \cases F(d,r)(mod p)& if 3|p-1, \\G(d,r)\ (mod p)& if 3|p-2, where $C_n$ denotes the Catalan number $(n+1)^{-1}\binom{2n}{n}$. For example, when $p\geq 5$ is a prime, we have \sum_{k=1}^{p-1}k^2C_k\equiv\cases-2/3 (mod p)& if 3|p-1, \1/3 (mod p)& if 3|p-2; and \sum_{0

54 citations


Journal ArticleDOI
TL;DR: In this article, a general criterion for m to be a quartic residue (mod p ) in terms of appropriate binary quadratic forms was given, where m ∈ Z and p ∤ m is an odd prime.

33 citations


Journal ArticleDOI
Zhi-Wei Sun1
TL;DR: In this article, the explicit congruence was used to give a new proof of a classical result due to M.A. Stern, which is called Euler number modulo powers of two.

31 citations


Posted Content
TL;DR: In this article, a generalization of Lucas' theorem was shown to be applicable to Bernoulli polynomials, and a p-adic order bound given by the authors in a previous paper can be obtained when p = 2.
Abstract: Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If a is greater than one, and $l,s,t$ are nonnegative integers with $s,t

28 citations


Journal ArticleDOI
Zhi-Wei Sun1
TL;DR: In this paper, a polynomial extension of Fleck's congruence has been proposed, where the authors obtain a lower bound of the order of the sum of the sums.
Abstract: Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$ where $\alpha\ge\beta\ge 0$, $n\ge p^{\alpha-1}$ and $r\in Z$. This polynomial extension of Fleck's congruence has various backgrounds and several consequences such as $$\sum_{k=r(mod p^\alpha)}\binom{n}{k} a^k\equiv 0 (mod p^{[(n-p^{\alpha-1})/\phi(p^\alpha)]})$$ provided that $\alpha>1$ and $a\equiv-1(mod p)$.

21 citations


Journal ArticleDOI
TL;DR: In this article, the authors studied various restricted sumsets of finite subsets of A 1, …, A n with restrictions of the following forms: a i - a j ∉ S ij, or α i a i ≠ α j a j, or a i + b i ≢ a j + b j ( mod m ij ).

20 citations


Journal ArticleDOI
TL;DR: In this article, it was shown that if such a covering system {a"s(modn"s)}"s"="1^k" with moduli n"1,...,n"k odd, distinct and greater than one exists, then the least common multiple has at least 22 prime divisors.

19 citations


Posted Content
TL;DR: In this paper, a congruence of Glaisher's congruences was shown for relatively prime integers, such that for any integer n>0 and r > 0, there exists an explicit period for which n+r]_m(a)=[n,r]-m(n, r](a)) is an integer with the following property:
Abstract: Let q>1 and m>0 be relatively prime integers. We find an explicit period $ u_m(q)$ such that for any integers n>0 and r we have $[n+ u_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q), or a=1 (mod q) and 2|m, where $[n,r]_m(a)=\sum_{k=r(mod m)}\binom{n}{k}a^k$. This is a further extension of a congruence of Glaisher.

16 citations


Journal ArticleDOI
Zhi-Wei Sun1
TL;DR: In this paper, it was shown that the range of the covering function w ( x ) is not contained in any residue class with modulus greater one, in particular, the values of w( x ) cannot have the same parity.

15 citations


Journal ArticleDOI
TL;DR: In this article, the authors established many formulas for Newton-Euler pairs, and then made use of them to obtain new results concerning some special sequences such as p(n); ae(n) and Bn, where p n is the number of partitions of n, ae (n) is the sum of divisors of n and bn is the nith Bernoulli number.

9 citations


Journal ArticleDOI
Zhi-Wei Sun1
TL;DR: Sun et al. as mentioned in this paper showed that ψ = ψ 1 + ⋯ + ψ k is constant if ψ ( x ) equals a constant for | S | consecutive integers x where S = { r / n s : r = 0, …, n s − 1 ; s = 1, …, k }.

Posted Content
Zhi-Wei Sun1
TL;DR: In this article, a new combinatorial congruence involving binomial coefficients was obtained, which confirmed two conjectures of the author and Davis and gave a new extension of Glaisher's Congruence by showing that $(p-1)p^{[\log_p m]}$ is a period of the sequence.
Abstract: In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence $\sum_{j=0}^l{l\choose j}S(j,m)a^{l-j}(l=m,m+1,...)$ modulo a prime $p$, where $a$ and $m>0$ are integers, and those $S(j,m)$ are Stirling numbers of the second kind. We also give a new extension of Glaisher's congruence by showing that $(p-1)p^{[\log_p m]}$ is a period of the sequence $\sum_{j=r(mod p-1)}{l\choose j}S(j,m)(l=m,m+1,...)$ modulo $p$.

Journal ArticleDOI
TL;DR: It is shown that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter operating on bounded languages is decidable, resolving an open problem.

Posted Content
Hao Pan1, Zhi-Wei Sun1
TL;DR: In this article, it was shown that for any positive integer m_1,...,m_k and theta in [0,1], if there is a subset I of I of { 1,...,k} such that the fractional part of sum s in I m_s/n_s is theta, then there are at least 2^m such subsets of {1,k}.
Abstract: Let A={a_s+n_sZ}_{s=1}^k be a finite system of arithmetic sequences which forms an m-cover of Z (i.e., every integer belongs at least to m members of A). In this paper we show the following sharp result: For any positive integers m_1,...,m_k and theta in [0,1), if there is a subset I of {1,...,k} such that the fractional part of sum_{s in I}m_s/n_s is theta, then there are at least 2^m such subsets of {1,...,k}. This extends an earlier result of M. Z. Zhang and an extension by Z. W. Sun. Also, we generalize the above result to m-covers of the integral ring of any algebraic number field with a power integral basis.

Journal ArticleDOI
Hao Pan1, Zhi-Wei Sun1
TL;DR: In this article, it was shown that for any nonnegative integer n,s,t with t odd, where n = 0, 1, 2, there is a q-analogue of Stern's congruence.
Abstract: Let $(a;q)_n=\prod_{0\le k

Posted Content
Zhi-Wei Sun1
TL;DR: In this paper, it was shown that any natural number is a sum of an even square and two triangular numbers, and that each positive integer is the sum of a triangular number plus a square.
Abstract: By means of $q$-series, we prove that any natural number is a sum of an even square and two triangular numbers, and that each positive integer is a sum of a triangular number plus $x^2+y^2$ for some integers $x$ and $y$ with $x ot\equiv y (mod 2)$ or $x=y>0$. The paper also contains some other results and open conjectures on mixed sums of squares and triangular numbers.

Posted Content
TL;DR: In this paper, the authors used combinatorial number theory to prove that any homotopy group contains an element of order (i.e., the largest integer such that it can be divided by any prime.
Abstract: We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$ such that $p^{\alpha}$ divides $m$.

Posted Content
04 Aug 2005
TL;DR: In this article, a generalization of Lucas' theorem for nonnegative integers is presented, where the congruence is shown to be 0 (mod p √ √ r(mod p) √ n) = 0.
Abstract: Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{°f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If a is greater than one, and $l,s,t$ are nonnegative integers with $s,t

Posted Content
Hao Pan1, Zhi-Wei Sun1
TL;DR: In this paper, it was shown that if G is torsion-free or elementary abelian, then |C|\geq |A|+|B|-|S| -m.
Abstract: Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is torsion-free or elementary abelian then |C|\geq |A|+|B|-|S| -m. We also prove that |C|\geq |A|+|B|-2|S|-m if the torsion subgroup of G is cyclic. In the case S={0} this provides an advance on a conjecture of Lev.

Posted Content
TL;DR: For nonnegative integers l,n and an integer r, the normalized cyclotomic π$-coefficient is known to behave like binomial coefficients and satisfy some Lucas-type congruences as discussed by the authors.
Abstract: Let p be any prime and a be a positive integer. For nonnegative integers l,n and an integer r, the normalized cyclotomic $\psi$-coefficient $${n,r}_{l,p^a}:=p^{-[(n-p^{a-1}-lp^a)/(p^{a-1}(p-1))]} \sum_{k=r(mod p^a)}(-1)^k{n \choose k}{{(k-r)/p^a} \choose l}$$ is known to be an integer. In this paper, we show that this coefficient behaves like binomial coefficients and satisfies some Lucas-type congruences. This implies that a congruence of Wan is often optimal, and two conjectures of Sun and Davis are true.

Posted Content
Zhi-Wei Sun1
TL;DR: In this paper, the authors considered combinatorial aspects of finite covers of groups by cosets or subgroups, and they showed that there is a composition series from the identity element of a group to all the subgroups of the group to a subgroup whose factors are of prime order.
Abstract: This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its proper subsystems does. We show that if $G$ is cyclic, or $G$ is finite and $G_1,...,G_k$ are normal Hall subgroups of $G$, then $k\geq m+f([G:\bigcap_{i=1}^kG_i])$, where $f(\prod_{t=1}^r p_t^{\alpha_t})=\sum_{t=1}^r\alpha_t(p_t-1)$ if $p_1,...,p_r$ are distinct primes and $\alpha_1,...,\alpha_r$ are nonnegative integers. When all the $a_i$ are the identity element of $G$ and all the $G_i$ are subnormal in $G$, we prove that there is a composition series from $\bigcap_{i=1}^kG_i$ to $G$ whose factors are of prime orders. The paper also includes some other results and two challenging conjectures.