Rohini Rajaraman

Learn More
In this paper, we have applied an efficient wavelet-based approximation method for solving the Fisher’s type and the fractional Fisher’s type equations arising in biological sciences. To the best of our knowledge, until now there is no rigorous wavelet solution has been addressed for the Fisher’s and fractional Fisher’s equations. The highest derivative in(More)
— In this paper, we have applied an accurate and efficient homotopy analysis method (HAM) to find the approximate/analytical solutions for space and time fractional reaction-diffusion equations arising in mathematical chemistry. The method provides solutions in rapid convergence series with computable terms. To the best of our knowledge, until now there is(More)
We will present here an elementary pedagogical introduction to CP N solitons in quantum Hall systems. We will begin with a brief introduction to both CP N models and to quantum Hall (QH) physics. Then we will focus on spin and layer-spin degrees of freedom in QH systems and point out that these are in fact CP N fields for N=1 and N=3. Excitations in these(More)
Routing in mobile ad hoc network is considered a challenging task due to the unpredictable changes in the network topology, resulting from the random and frequent movement of the nodes and due to the absence of any centralized control. Several routing protocols for mobile ad-hoc networks are being proposed. In this paper the performance of two major routing(More)
We calculate the lowest Landau level (LLL) current by working in the full Hilbert space of a two dimensional electron system in a magnetic field and keeping all the non-vanishing terms in the high field limit. The answer a) is not represented by a simple LLL operator and b) differs from the current operator, recently derived by Martinez and Stone in a field(More)
This concludes the proof of the Claim, and hence of Theorem 9(b). 2 In addition to its inherent interest, Theorem 9 can be used in conjunction with our results on coarse balancing to obtain better bounds for counting. The idea is simply to use the results of Section 3 to bound the time to reach a certain threshold discrepancy, and then to switch to Theorem(More)