![]() The page reproduced above is from Gauss, and concerns what we now call Gauss sums, which crop up often in my work. |
Daniel J. KatzPostdoctoral FellowDepartment of Mathematics Simon Fraser University I work with Jonathan Jedwab and his group, among the Discrete Mathematicians of SFU. I investigate number-theoretic and combinatorial problems, often motivated by information theory. Both algebra and analysis play crucial roles. A recent highlight is a proof for finite fields of characteristic 2 of a conjecture of Hellesth (1976) concerning cross-correlations of maximal linear recursive sequences (equivalent to a conjecture about Weil sums of binomials or a statement about weights in certain error-correcting codes). Jonathan Jedwab, Kai-Uwe Schmidt, and I have settled conjectures of Høholdt-Jensen (1988) Borwein-Choi-Jedwab (2004), Parker (2005), Yu-Gong (2007), and Jedwab-Schmidt (2010) on the asymptotic L4 norm of certain families of Littlewood polynomials. In doing so, we break a record (which stood for over two decades) for the lowest known asymptotic mean-square autocorrelation for binary sequences. |
| Curriculum Vitae | Research Statement | Teaching Statement |
On p-Adic Estimates of Weights in Abelian Codes over Galois Rings
Spring 2012 at SFU: Math 232, Applied Linear Algebra
Some materials from past classes:
Calculus Lecture Slides (Princeton, Math 103)
Graph Theory Two-Week Unit (Princeton, Applied and Computational Math 199)
| Graph Theory Notes, part 1 | (fundamentals, Eulerian cycles, flows in networks) |
| Graph Theory Notes, part 2 | (coloring, planar graphs, coloring maps) |
Putnam Preparation Class (Caltech, Math 17)