On Solving a Generalized Chinese Remainder Theorem in the Presence of Remainder Errors

In estimating frequencies given that the signal waveforms are undersampled multiple times, Xia et. al. proposed to use a generalized version of Chinese remainder Theorem (CRT), where the moduli are $M_1, M_2, \cdots, M_k$ which are not necessarily pairwise coprime. If the errors of the corrupted remainders are within \tau=\sds \max_{1\le i\le k} \min_{\stackrel{1\le j\le k}{j\neq i}} \frac{\gcd(M_i,M_j)}4, their schemes can be used to construct an approximation of the solution to the generalized CRT with an error smaller than $\tau$. Accurately finding the quotients is a critical ingredient in their approach. In this paper, we shall start with a faithful historical account of the generalized CRT. We then present two treatments of the problem of solving generalized CRT with erroneous remainders. The first treatment follows the route of Wang and Xia to find the quotients, but with a simplified process. The second treatment considers a simplified model of generalized CRT and takes a different approach by working on the corrupted remainders directly. This approach also reveals some useful information about the remainders by inspecting extreme values of the erroneous remainders modulo $4\tau$. Both of our treatments produce efficient algorithms with essentially optimal performance. Finally, this paper constructs a counterexample to prove the sharpness of the error bound $\tau$

Estimates on the first two buckling eigenvalues on spherical domains

In this paper, we study the first two eigenvalues of the buckling problem on spherical domains. We obtain an estimate on the second eigenvalue in terms of the first eigenvalue, which improves one recent result obtained by Wang-Xia in [7].Comment: This article has been submitted for publication on 2009-04-2

Proof of a Conjecture of Hirschhorn and Sellers on Overpartitions

Let $\bar{p}(n)$ denote the number of overpartitions of $n$. It was conjectured by Hirschhorn and Sellers that \bar{p}(40n+35)\equiv 0\ ({\rm mod\} 40) for $n\geq 0$. Employing 2-dissection formulas of quotients of theta functions due to Ramanujan, and Hirschhorn and Sellers, we obtain a generating function for $\bar{p}(40n+35)$ modulo 5. Using the $(p, k)$-parametrization of theta functions given by Alaca, Alaca and Williams, we give a proof of the congruence \bar{p}(40n+35)\equiv 0\ ({\rm mod\} 5). Combining this congruence and the congruence \bar{p}(4n+3)\equiv 0\ ({\rm mod\} 8) obtained by Hirschhorn and Sellers, and Fortin, Jacob and Mathieu, we give a proof of the conjecture of Hirschhorn and Sellers.Comment: 11 page