I was a Program in Computing Assistant Adjunct Professor in the Department of Mathematics at UCLA (2007-2011) and am a SAGEvangelist (2005-).

### Faculty Application 2011-2012

1. Cover Letter

http://sage.math.washington.edu/home/burhanud/app11/cover11/cover11.pdf

2. Curriculum Vitae

http://sage.math.washington.edu/home/burhanud/app11/cv11/iftikhar.burhanuddin.cv11.pdf

3. Written Work

http://sage.math.washington.edu/home/burhanud/app11/pub11/iftikhar.burhanuddin.pub11.pdf

4. Research Statement

http://sage.math.washington.edu/home/burhanud/app11/restat11/iftikhar.burhanuddin.restat11.pdf

5. Teaching Statement

http://sage.math.washington.edu/home/burhanud/app11/testat11/iftikhar.burhanuddin.testat11.pdf

### Papers

http://sage.math.washington.edu/home/burhanud/papers

1. Deciding whether the p-torsion group of the Q_p-rational points of an elliptic curve is non-trivial, with Ming-Deh Huang. ANTS VI Poster Abstracts. SIGSAM Bulletin, Volume 38, Number 3 September 2004 Issue 149.

Abstract: This note describes an algorithm to decide whether an elliptic curve over Q_p has a non-trivial p-torsion part (# E(Q_p)[p] is not equal to 1) under certain assumptions.

http://sage.math.washington.edu/home/burhanud/papers/burhanuddin.elliptic.curve.p-adic.torsion.pdf

2. Elliptic curve torsion points and division polynomials, with Ming-Deh Huang. Computational Aspects of Algebraic Curves, T. Shaska (Ed.), Lecture Notes Series on Computing, 13 (2005), 13--37, World Scientific.

Abstract: We present two algorithms - p-adic and l-adic - to determine E(Q)_{tors} the group of rational torsion points on an elliptic curve. Another algorithm we introduce is one which decides whether an elliptic curve over Q_p has a non-trivial p-torsion part and this comes into play in the p-adic torsion computation procedure. We also make some remarks about the discriminant of the m-division polynomial of an elliptic curve and the information it reveals about torsion points.

http://sage.math.washington.edu/home/burhanud/papers/burhanuddin.elliptic.curve.rational.torsion.pdf

3. Some computational problems motivated by the Birch and Swinnerton-Dyer conjecture. Ph.D. dissertation, University of Southern California, 2007.

Abstract: This dissertation revolves around the BSD (Birch and Swinnerton-Dyer) conjecture for elliptic curves defined over the rational numbers, a famous problem that has been open for over forty years and one of the seven Millennium Prize problems. The BSD conjecture is considered to be the first nontrivial number theoretic problem put forth as a result of explicit machine computation --- in the late '50s at Cambridge University. The BSD conjecture relates the rank of the Mordell-Weil group, the group of rational points of an elliptic curve, a quantity which seems to be difficult to pin down, to the order of vanishing of the L-function of the elliptic curve at its central point.

We make algorithmic and theoretical advances with regards to some of the terms appearing in the BSD formula, namely the sizes of the torsion subgroup and the Shafarevich-Tate group.

Firstly, we introduce an algorithm to compute elliptic curve torsion subgroup. The randomized version of this procedure runs in expected time which is essentially linear in the number of bits required to write down the equation of the elliptic curve.

Next, we discuss a conjecture of Hindry, who proposed a Brauer-Siegel type formula for elliptic curves. Driven by a suggestion of Hindry, we prove assuming standard conjectures that there are infinitely many elliptic curves with Shafarevich-Tate group of size about as large as the square root of the minimal discriminant of the curve. This improves on a result of de Weger.

Thirdly, we consider certain quartic twists of an elliptic curve. We establish a reduction between the problem of factoring integers of a certain form and the problem of computing rational points on these twists. We illustrate that the size of Shafarevich-Tate group of these curves will make it computationally expensive to factor integers by computing rational points via the Heegner point method.

Finally, we sketch existing algorithms that compute the quantities appearing in the BSD formula and introduce strategies to parallelize them.

http://sage.math.washington.edu/home/burhanud/papers/burhanuddin.dissertation.pdf

4. On projectively rational lifts of mod 7 Galois representations, with Luis Dieulefait. JP Journal of Algebra, Number Theory and Applications, Volume 20, Issue 1, 109 -- 119, February 2011.

Abstract: We consider the problem of constructing `projectively rational`* lifts of odd, two-dimensional Galois representations with values in F_7. Using modular forms, in particular the theory of congruences, we compute such lifts for many examples of mod 7 representations thus giving evidence that suggests that such lifts may always exist. We also consider the invariance after twist (weight change) of the existence of such lifts. *

*http://sage.math.washington.edu/home/burhanud/papers/burhanuddin.mod.7.galois.representations.pdf *

*5. Elliptic curves with large Shafarevich-Tate group, with Ming-Deh Huang. Submitted to Journal of Number Theory (October 21, 2010). *

*Abstract: We show that there exist infinitely many elliptic curves with Shafarevich-Tate group of order essentially as large as the the square root of the minimal discriminant assuming certain conjectures. This improves on a result of de Weger. *

*http://sage.math.washington.edu/home/burhanud/papers/burhanuddin.elliptic.curve.large.sha.pdf *

*6. Factoring integers and computing points on elliptic curves, with Ming-Deh Huang. To be submitted. *

*7. On the reducibility of Hecke polynomials over Z. (Conjecture 1.1 is False and Conjecture 1.2 follows from the work of http://en.wikipedia.org/wiki/Robert_Fricke Details to follow.) *

*http://sage.math.washington.edu/home/burhanud/heckered/heckered.pdf *

*
*

*TDoLP --- The Documentation of Lectures Project*

http://www.math.ucla.edu/~ntg/ntg-extra/

### Nontrivial pursuits

http://www.facebook.com/groups/quiiz/

### Stuff I have worked/am working/plan to work on wrt to SAGE

* Mestre's method of graphs project which started at the MSRI Computing with Modular Forms workshop.

- Check out:

* Implementing asymptotically fast elliptic curve rational torsion computation algorithms.

kurrently kludgey kode http://sage.math.washington.edu/home/burhanud/tor/tor.py.txt

algorithms http://modular.math.washington.edu/home/burhanud/volume.pdf

* My research is pretty SAGEy

Research Statement http://sage.math.washington.edu/home/burhanud/app11/restat11/iftikhar.burhanuddin.restat11.pdf

### Old Stuff

* Make wikipage about Talks related to SAGE (plan)

* Editing the SAGE programming guide in time for the release of sage-2.0

* Editing the SAGE reference manual (and build process?) in time for the release of sage-2.0 (plan)

* Wrapping Denis Simon's 2-descent (plan)

* Dekinking some SAGE tab completion kinks (plan)

* SAGE + Parallel, The Problem Book (plan)