Rajat Tandon - Academia.edu (original) (raw)

Related Authors

Dominik Wujastyk

James Mallinson

Philipp A Maas

Aliye Erol

Audrey Truschke

Jason Neelis

Vujadin M Ivanišević

Rebecca Ruth Gould

Bhikkhunī Dhammadinnā

Miljenko Jurkovic

Miljenko Jurkovic

University of Zagreb, Faculty of Humanities and Social Sciences [Filozofski fakultet]

Uploads

Papers by Rajat Tandon

Research paper thumbnail of The Nagell-Lutz Theorem

Almost all the material in this chapter can be found in the reference [2]. I have tried to give t... more Almost all the material in this chapter can be found in the reference [2]. I have tried to give the shortest and most direct proofs whenever possible.

Research paper thumbnail of Algebra and Number Theory

Research paper thumbnail of Computing the number of ways of representing primes by a norm form

Proc Indian Acad Sci Math Sci, 1986

Research paper thumbnail of Algorithm to Compute Squares of 1st N Natural Numbers Without UsingMultiplication

Processors may find some elementary operations to be faster than the others. Although an operatio... more Processors may find some elementary operations to be faster than the others. Although an operation may be conceptually as simple as some other operation, the processing speeds of the two can vary. A clever programmer will always try to choose the faster instructions for the job. This paper presents an algorithm to display squares of 1 st "N" natural numbers without using multiplication ('*' operator). Instead, the same work can be done using addition ('+' operator). The results can also be used to compute the sum of those squares. If we compare the normal method of computing the squares of 1 st "N" natural numbers with this method, we can conclude that the algorithm discussed in the paper is more optimized in terms of time complexity.

Research paper thumbnail of Computing the number of ways of representing primes by a norm form

Proceedings Mathematical Sciences, 1986

Research paper thumbnail of A course in number theory and cryptology

Research paper thumbnail of Roots are not contained in cyclotomic fields

Research paper thumbnail of Completing an extension of Tunnell's theorem

Journal of Number Theory, 2008

We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H an... more We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H and a complex representation π + of G how does π + decompose on restriction to H. Here G is GL(2, F) + , where F is a nonarchimedian local field of characteristic not two, K a separable quadratic extension of F , GL(2, F) + the subgroup of index 2 in GL(2, F) consisting of those matrices whose determinant is in N K/F (K *), π + is an irreducible, admissible supercuspidal representation of GL(2, F) + and H = K * under an embedding of K * into GL(2, F).

Research paper thumbnail of A Converse Theorem for Epsilon Factors

Journal of Number Theory, 2001

Research paper thumbnail of The class number problem

Resonance, 1998

... Rajat Tandon Rajat Tandon received his PhD from Yale University, USA. ... We have seen in the... more ... Rajat Tandon Rajat Tandon received his PhD from Yale University, USA. ... We have seen in the first part of this article in the previ-ous issue that some seemingly innocuous questions starting with the formula -b• lead to fairly deep mathemat-2a ics. This is typical of the subject. ...

Research paper thumbnail of The Nagell-Lutz Theorem

Almost all the material in this chapter can be found in the reference [2]. I have tried to give t... more Almost all the material in this chapter can be found in the reference [2]. I have tried to give the shortest and most direct proofs whenever possible.

Research paper thumbnail of Algebra and Number Theory

Research paper thumbnail of Computing the number of ways of representing primes by a norm form

Proc Indian Acad Sci Math Sci, 1986

Research paper thumbnail of Algorithm to Compute Squares of 1st N Natural Numbers Without UsingMultiplication

Processors may find some elementary operations to be faster than the others. Although an operatio... more Processors may find some elementary operations to be faster than the others. Although an operation may be conceptually as simple as some other operation, the processing speeds of the two can vary. A clever programmer will always try to choose the faster instructions for the job. This paper presents an algorithm to display squares of 1 st "N" natural numbers without using multiplication ('*' operator). Instead, the same work can be done using addition ('+' operator). The results can also be used to compute the sum of those squares. If we compare the normal method of computing the squares of 1 st "N" natural numbers with this method, we can conclude that the algorithm discussed in the paper is more optimized in terms of time complexity.

Research paper thumbnail of Computing the number of ways of representing primes by a norm form

Proceedings Mathematical Sciences, 1986

Research paper thumbnail of A course in number theory and cryptology

Research paper thumbnail of Roots are not contained in cyclotomic fields

Research paper thumbnail of Completing an extension of Tunnell's theorem

Journal of Number Theory, 2008

We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H an... more We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H and a complex representation π + of G how does π + decompose on restriction to H. Here G is GL(2, F) + , where F is a nonarchimedian local field of characteristic not two, K a separable quadratic extension of F , GL(2, F) + the subgroup of index 2 in GL(2, F) consisting of those matrices whose determinant is in N K/F (K *), π + is an irreducible, admissible supercuspidal representation of GL(2, F) + and H = K * under an embedding of K * into GL(2, F).

Research paper thumbnail of A Converse Theorem for Epsilon Factors

Journal of Number Theory, 2001

Research paper thumbnail of The class number problem

Resonance, 1998

... Rajat Tandon Rajat Tandon received his PhD from Yale University, USA. ... We have seen in the... more ... Rajat Tandon Rajat Tandon received his PhD from Yale University, USA. ... We have seen in the first part of this article in the previ-ous issue that some seemingly innocuous questions starting with the formula -b• lead to fairly deep mathemat-2a ics. This is typical of the subject. ...

Log In